Minimising the delta test for variable selection in regression problems

作者: Alberto Guillen , Dusan Sovilj , Amaury Lendasse , Fernando Mateo , Ignacio Rojas

DOI: 10.1504/IJHPSA.2008.024211

关键词: Regression problemsMathematical optimizationFeature selectionRobustness (computer science)Scaling problemTabu searchDeltaComputer scienceScalability

摘要: The problem of selecting an adequate set variables from a given data sampled function becomes crucial by the time designing model that will approximate it. Several approaches have been presented in literature although recent studies showed how delta test is powerful tool to determine if subset correct. This paper presents new methodologies based on such as tabu search, genetic algorithms and hybridisation them, which representative function. considers well scaling where relevance value assigned each variable. were adapted be run parallel architectures so better performances could obtained small amount time, presenting great robustness scalability.

参考文章(47)
Isabelle Guyon, Steve Gunn, Lotfi A. Zadeh, Masoud Nikravesh, Feature Extraction: Foundations and Applications (Studies in Fuzziness and Soft Computing) Springer-Verlag New York, Inc.. ,(2006)
William F. Punch, Richard J. Enbody, Paul D. Hovland, Min Pei, Erik D. Goodman, Lai Chia-Shun, Further Research on Feature Selection and Classification Using Genetic Algorithms international conference on genetic algorithms. pp. 557- 564 ,(1993)
Carl Edward Rasmussen, Gaussian processes in machine learning Lecture Notes in Computer Science. pp. 63- 71 ,(2003) , 10.1007/978-3-540-28650-9_4
Antonio J. Nebro, Francisco Luna, Enrique Alba, Advances in parallel heterogeneous genetic algorithms for continuous optimization International Journal of Applied Mathematics and Computer Science. ,vol. 14, pp. 317- 333 ,(2004)
Colin R. Reeves, Using Genetic Algorithms with Small Populations international conference on genetic algorithms. pp. 92- 99 ,(1993)
Tomaso Poggio, Federico Girosi, A Theory of Networks for Approximation and Learning Massachusetts Institute of Technology. ,(1989)
Jianmin Zhang, Sikun Li, Shengyu Shen, Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm Lecture Notes in Computer Science. pp. 847- 856 ,(2006) , 10.1007/11941439_89
Larry J. Eshelman, J. David Schaffer, Real-Coded Genetic Algorithms and Interval-Schemata foundations of genetic algorithms. ,vol. 2, pp. 187- 202 ,(1993) , 10.1016/B978-0-08-094832-4.50018-0
Kalyanmoy Deb, Tushar Goel, Controlled Elitist Non-dominated Sorting Genetic Algorithms for Better Convergence international conference on evolutionary multi criterion optimization. pp. 67- 81 ,(2001) , 10.1007/3-540-44719-9_5