2010
DOI: 10.1142/s0129065710002474
|View full text |Cite
|
Sign up to set email alerts
|

Variable Selection in Nonlinear Modeling Based on RBF Networks and Evolutionary Computation

Abstract: In this paper a novel variable selection method based on Radial Basis Function (RBF) neural networks and genetic algorithms is presented. The fuzzy means algorithm is utilized as the training method for the RBF networks, due to its inherent speed, the deterministic approach of selecting the hidden node centers and the fact that it involves only a single tuning parameter. The trade-off between the accuracy and parsimony of the produced model is handled by using Final Prediction Error criterion, based on the RBF… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0
3

Year Published

2011
2011
2017
2017

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 33 publications
(12 citation statements)
references
References 85 publications
0
9
0
3
Order By: Relevance
“…22,32 GAs encode a potential solution as a chromosome-like data structure and apply genetic operations (crossover and mutation) to make the population evolve iteratively in order to reach the optimal solution. 33 At each iteration, a particular group of chromosomes (parents) are selected from the entire population to generate the offspring, which will replace chromosomes in the new population.…”
Section: Feature Selection and Classificationmentioning
confidence: 99%
“…22,32 GAs encode a potential solution as a chromosome-like data structure and apply genetic operations (crossover and mutation) to make the population evolve iteratively in order to reach the optimal solution. 33 At each iteration, a particular group of chromosomes (parents) are selected from the entire population to generate the offspring, which will replace chromosomes in the new population.…”
Section: Feature Selection and Classificationmentioning
confidence: 99%
“…In accordance with our earlier definition, this is used for the baseline rank score permutation of the individual feature components for the prescribed classification task and parameter settings, i.e. r b (x) = (3,1,4,2,5).…”
Section: Defining a Baseline Rankmentioning
confidence: 99%
“…These methods include the following: growing and pruning (Dash & Samantaray, 2004;Huang, Saratchandran, & Sundararajan, 2004;Karayiannis & Mi, 1997;Lu, Sundararajan, & Saratchandran, 1997), evolutionary optimization (Patrinos, Alexandridis, Ninos, & Sarimvei, 2010;Sarimveis, Alexandridis, & Mazarakis, 2004), and multiple linear regression (MLR), i.e., least squares regression (LSR), partial least squares regression (PLSR) (Walczak & Massart, 1996), and principal component analysis (PCA) (Weizhen et al, 2004;Xie, Ye, Liu, & Ying, n.d.). The pruning approach is the most widely used in the literature because it can train large and small networks.…”
Section: Introductionmentioning
confidence: 99%