Feature subset selection in a methodology for training and improving artificial neural network weights and connections

Proceedings of the International Joint Conference on Neural Networks

Volumn , Issue , 2008, Pages 1951-1958

  Zanchettin, Cleber ^a   Ludermir, Teresa B ^a  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ANNEALING; BACKPROPAGATION; BACKPROPAGATION ALGORITHMS; DIESEL ENGINES; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; HEURISTIC ALGORITHMS; SIMULATED ANNEALING; TABU SEARCH; VEGETATION;

ARTIFICIAL NEURAL NETWORKS; FEATURE SELECTION METHODS; FEATURE SUBSET SELECTIONS; LAYER PERCEPTRON; LOCAL SEARCHES; SIMULTANEOUS OPTIMIZATIONS;

NEURAL NETWORKS;

EID: 56349086073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2008.4634065     Document Type: Conference Paper

References (18)

1. D. W. Aha and R. L. Bankert. A comparative evaluation of sequential feature selection algorithms. In Proceedings of the 5th International Workshop on Artificial Intelligence and Statistics, pages 1-7, 1995.
2. E. Anderson. The irises of the gasp peninsula. Bulletin of the American Iris Society, 59:2-5, 1953.
3. J. E. Baker. Reducing bias and inefficiency in the selection algorithm. In Int. Conf. Gen. Alg. and their Application, pages 14-21, 1987.
4. C. L. Blake and C J. Merz. Cuci repository of machine learning databases. Technical report, University of California, Irvine, CA, 1998.
5. A. Blum and P. Langley. Selection of relevant features and examples in machine learning. In Artificial Intellignce, volume 97, pages 245-271, 1997.
6. L. Davis. Bit-climbing, representational bias, and test suite design. In Proceedings of the Fourth International Conference on Genetic Algorithms, pages 18-23. Morgan K. Publishers Inc., 1991.
7. Richard O. Duda and Peter E. Hart adn David G. Stork. Pattern. Classification. Wiley, 2000.
8. P. Langley and W. Iba. Average-case analysis of a nearest neighbor algorithm. In Proceedings of 13th International Conference on Artificial Intelligence, pages 889-894, 1993.
9. H. Liu and R. Setiono. Feature selection and classification - a probabilistic wrapper approach. In Proceedings of 9th International Conference on Industrial and Engineering Applications of Artificial Intelligence, pages 284-292, 1996.
10. T. M. Mitchell. Machine Learning., chapter Evaluating hypotheses, pages 128-153. WCB/McGraw-Hill, 1997.
11. L. Prehelt. Proben 1 - a set of neural network benchmark problems and benchmarking rules. Technical Report 21, Univ. Karlsruhe, 1994.
12. J. Quinlan. Simplifying decision trees. Int. Journal of Man-Machine Studies, 27:221234, 1987.
13. R. S. Sexton, R. E. Dorsey, and J. D. Johnson. Optimization of neural networks: A comparative analysis of the genetic algorithm and simulated annealing. In European Journal of Operational Research, volume 114, pages 589-601, 1999.
14. J.M. Steppe and K.W. Bauer. Improved feature screening in feedforward neural, networks. Neurocomputing, 13:4758, 1996.
15. G. Sywerda. Uniform crossover in genetic algorithm. In Int. Conf. on Genetic algorithms, pages 2-9. Morgan K. Publishers Inc., 1989.
16. H. Vafaie and K. De Jong. Robust feature selection algorithms. In Proceedings of the fifth IEEE International Conference on Tools for Artificial Intelligence, pages 356-363, 1993.
17. C. Zanchettin and T. B. Ludermir. Hybrid technique for artificial neural network architecture and weight optimization. In Lecture Notes in Artificial Intelligence, volume 3721, pages 709-716, 2005.
18. C. Zanchettin and T. B. Ludermir. A methodology to train and improve artificial neural networks weights and connections. In Int. Joint Conf. on Neural Networks, pages 1-12. IEEE Computer Society, 2006.