A Decision Tree Model for Inset-Fed Microstrip Patch Antenna

This work proposes a novel approach to modeling inset-fed microstrip patch antennas using Decision Tree (DT) algorithm. The technique involves a well-structured and systematic adjustment of the decision tree (DT) model's hyperparameters. This process includes evaluating the influence of key factors such as the number of trees, the depth of splits, and the learning rate on the overall performance of the model, we identify the most suitable configurations for accurately predicting antenna resonant frequencies. Furthermore, we investigate the relationship between resonant frequencies and various physical and geometrical factors, including material properties, patch dimensions, and feed location. To validate the effectiveness of our model, we evaluate the model's performance in comparison with several artificial intelligence techniques, such as Radial Basis Function (RBF) neural networks, Multilayer Perceptron (MLP) neural networks, and Gaussian Process Regression (GPR). The findings demonstrate that the proposed DT model outperforms these alternatives regarding metrics such as mean square error and coefficient of determination. Moreover, the outcomes align closely with those obtained using HFSS software, confirming the accuracy and reliability of our model for predicting resonant frequencies within the 1-10 GHz range.

Authors

Institutions

Publication Details

Published
2024-12-17
DOI
https://doi.org/10.1109/ecte-tech62477.2024.10851155
Primary Topic
Antenna Design and Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Decision Tree Model for Inset-Fed Microstrip Patch Antenna

Mounir Amir, Fouad Chebbara, Mohamed Lashab, Karim Ferroudji et al.
Antenna Design and Analysis
article

A Decision Tree Model for Inset-Fed Microstrip Patch Antenna

Mounir Amir, Fouad Chebbara, Mohamed Lashab, Karim Ferroudji, Raed A. Abd‐Alhameed, Malika Ouacifi
article en

Abstract

This work proposes a novel approach to modeling inset-fed microstrip patch antennas using Decision Tree (DT) algorithm. The technique involves a well-structured and systematic adjustment of the decision tree (DT) model's hyperparameters. This process includes evaluating the influence of key factors such as the number of trees, the depth of splits, and the learning rate on the overall performance of the model, we identify the most suitable configurations for accurately predicting antenna resonant frequencies. Furthermore, we investigate the relationship between resonant frequencies and various physical and geometrical factors, including material properties, patch dimensions, and feed location. To validate the effectiveness of our model, we evaluate the model's performance in comparison with several artificial intelligence techniques, such as Radial Basis Function (RBF) neural networks, Multilayer Perceptron (MLP) neural networks, and Gaussian Process Regression (GPR). The findings demonstrate that the proposed DT model outperforms these alternatives regarding metrics such as mean square error and coefficient of determination. Moreover, the outcomes align closely with those obtained using HFSS software, confirming the accuracy and reliability of our model for predicting resonant frequencies within the 1-10 GHz range.

University of Ouargla (DZ), University of Bradford (GB), Larbi Ben M'hidi University of Oum El Bouaghi (DZ), Université Larbi Tébessi (DZ), Mouloud Mammeri University of Tizi-Ouzou (DZ)
Openalex Percentile: Top 56%
Antenna Design and Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.