Feature selection algorithms in classification problems: An experimental evaluation

Optimization Methods and Software

Volumn 22, Issue 1, 2007, Pages 199-212

  Salappa, A ^a   Doumpos, M ^a   Zopounidis, C ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

Feature selection; Knowledge discovery; Machine learning; Pattern recognition

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); FEATURE EXTRACTION; MATHEMATICAL MODELS;

FEATURE SELECTION; FEATURE SELECTION ALGORITHMS; KNOWLEDGE DISCOVERY;

PATTERN RECOGNITION;

EID: 33845300232     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780600881910     Document Type: Conference Paper

References (31)

1. Kira, K. and Rendell, L., 1992, The feature selection problem: traditional methods and a new algorithm, In: Proceedings of AMI-92 (Reston: AAAI Press).
2. Blum, A.L. and Langley, P., 1997, Selection of relevant features and examples in machine learning, Artificial Intelligence, 97, 245-271.
3. Doak, J., 1992, An evaluation of feature selection methods and their application to computer security, Technical report CSE-92-18, University of California, Department of Computer Science, Davis, CA.
4. Liu, H. and Motoda, H., 1998, Feature Selection for Knowledge Discovery and Data Mining (London: Kluwer Academic Publishers).
5. Molina, L.C., Belanche, L. and Nebot, A., 2002, Feature selection algorithms: A survey and experimental evaluation, In: Proceedings of the 2002 IEEE International Conference on Data Mining (New York: IEEE Computer Society).
6. Narendra, P. and Fukunaga, K., 1977, A branch and bound algorithm for feature subset selection. IEEE Transactions on Computers, 26, 917-922.
7. Devijver, P.A. and Kittler, J., 1982, Pattern Recognition: A Statistical Approach (Englewood Cliffs: Prentice Hall).
8. Ben-Bassat, M., 1982, Use of distance measures, information measures and error bounds in feature evaluation, In: P. R. Krishnaiah and L. N. Kanal (Eds), Handbook of Statistics (North Holland).
9. Almuallim, H. and Dietterich, T.G., 1994, Learning Boolean concepts in the presence of many irrelevant features, Artificial Intelligence, 69, 279-305.
10. Quinlan, J.R., 1993, C4.5: Programs for Machine Learning (San Mateo: Morgan Kaufmann).
11. Koller, D. and Sahami, M., 1996, Toward optimal feature selection, In: L. Saitta (Ed.), Proceedings of the 13th International Conference on Machine Learning (San Francisco: Morgan Kaufmann).
12. Almuallim, H. and Dietterich, T.G., 1991, Learning with many irrelevant features. In: Proceedings of the 9th National Conference on Artificial Intelligence, Vol. 2 (Anaheim: AAAI Press).
13. Liu, H. and Setiono, R., 1996, A probabilistic approach to feature selection: a filter solution, In: L. Saitta (Ed.), Proceedings of the 13th International Conference on Machine Learning (San Francisco: Morgan Kaufmann).
14. Liu, H. and Setiono, R., 1998, Scalable feature selection for large sized databases. In Proceedings of the 4th World Congress on Expert Systems (San Francisco: Morgan Kaufmann).
15. Choubey, S.K., Deogun, J.S., Raghavan, V.V. and Sever, H., 1996, A comparison of feature selection algorithms in the context of rough classifiers, In: Proceedings of the 5th IEEE international Conference, on Fuzzy System. Vol. 2, New Orleans, LA.
16. Pudil, P., Novovicova, J. and Kittler, J., 1994, Floating search methods in feature selection. Pattern Recognition Letters, 15, 1119-1125.
17. Dash, M. and Liu, H., 1998, Hybrid search of feature subsets. In: H.Y. Lee and H. Motoda (Eds) Proceedings of the 15th Pacific Rim International Conference on Artificial Intelligence (Singapore: Springer Verlag).
18. Kohavi, R. and John, G.H., 1997, Wrappers for feature subset selection. Artificial Intelligence, 97, 273-324.
19. Stone, M., 1974, Cross-validation choice and assessment of statistical predictions. Journal of the Royal Statistical Society B, 36, 111-147.
20. Efron, B., 1983, Estimating the error rate of a prediction rule: improvement of cross-validation. Journal of the American Statistical Association, 78, 316-330.
21. Breiman, L., Friedman, J.H., Olsen, R.A. and Stone, C.J., 1984, Classification and Regression Trees (New York: Chapman and Hall).
22. Pawlak, Z., 1982, Rough sets. International Journal of Information and Computer Sciences, 11, 341-356.
23. Quinlan, J.R., 1986, Induction of decision trees. Machine Learning, 1, 81-106.
24. Moody, J., 1992, The effective number of parameters: an analysis of generalization and regularization in nonlinear learning systems, In: J. Moody, S. Hanson and R. Lippmann (Eds) Advances in Neural Information Processing Systems (San Francisco: Morgan Kaufmann).
25. Vapnik, V.N., 1998, Statistical Learning Theory (New York: John Wiley).
26. Fukunaga, K., 1990, Introduction to Statistical Pattern Recognition, 2nd edition (San Diego: Academic Press).
27. Klecka, W.R., 1980, Discriminant Analysis (London: Sage Publications).
28. Hosmer, D.W. and Lemeshow, S., 2000, Applied Logistic Regression, 2nd edition (New York: John Wiley).
29. Duda, R.O., Hart, P.E. and Stork, D.G., 2001, Pattern Classification, 2nd edition (New York: John Wiley).
30. Specht, D.F., 1990, Probabilistic neural networks. Neural Networks, 3, 109-118.
31. Blake, C., Keogh, E. and Merz, C.J., 1998, UCI repository of machine learning data bases, University of California, Department of Information and Computer Science, Irvine, CA.