Summary
The feature selection problem has been usually addressed through heuristic approaches given its significant computational complexity. In this context, evolutionary techniques have drawn the researchers’ attention owing to their appealing optimization capabilities. In this chapter, promising results achieved by the authors in solving the feature selection problem through a joint effort between rough set theory and evolutionary computation techniques are reviewed. In particular, two new heuristic search algorithms are introduced, i.e. Dynamic Mesh Optimization and another approach which splits the search process carried out by swarm intelligence methods.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bello, R., Nowe, A.: Using ACO and rough set theory to feature selection. In: WSEAS Trans. on Information Science and Applications, pp. 512–517 (2005)
Bello, R., Nowe, A.: A model based on ant colony system and rough set theory to feature selection. In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2005), pp. 275–276 (2005)
Bello, R., Puris, A., Nowe, A., Martínez, Y., García, M.: Two step ant colony system to solve the feature selection problem. In: Martínez-Trinidad, J.F., Carrasco Ochoa, J.A., Kittler, J. (eds.) CIARP 2006. LNCS, vol. 4225, pp. 588–596. Springer, Heidelberg (2006)
Bello, R., Gómez, Y., Nowé, A., García, M.: Two-step particle swarm optimization to solve the feature selection problem. In: Proc. of 7th Int’l Conf. on Intelligent Systems Design and Applications, pp. 691–696. IEEE Computer Society, Washington (2007)
Bello, R., Puris, A., Falcón, R.: Feature selection through dynamic mesh optimization. In: Ruiz-Shulcloper, J., Kropatsch, W.G. (eds.) CIARP 2008. LNCS, vol. 5197. Springer, Heidelberg (2008)
Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Caballero, Y., Bello, R.: Two new feature selection algorithms with rough sets theory. In: Bramer, M. (ed.) Artificial Intelligence in Theory and Practice. Springer, Boston (2006)
Dash, M., Liu, H.: Consistency-based search in feature selection. Artificial Intelligence 151, 155–176 (2003)
Dorigo, M., Stützle, T.: Ant colony optimization. Cambridge University Press, New York (2005)
Goldberg, D.E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley Longman Publishing Co. (1989)
Jensen, R., Shen, Q.: Finding rough set reducts with ant colony optimization. In: Proceedings of 6th Annual UK Workshop on Computational Intelligence, pp. 15–22 (2003)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. of IEEE Int’l. Conf. on Neural Networks, pp. 1942–1948. IEEE Service Center, Piscataway (1995)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm optimization algorithm. In: IEEE International Conference on Neural Networks, pp. 4104–4108 (1997)
Komorowski, J., Polkowski, L., Skowron, A.: Rough sets: a tutorial. In: Pal, S., Skowron, A. (eds.) Rough-Fuzzy Hybridization: A New Trend in Decision-Making. Springer, New York (1999)
Kudo, M., Sklansky, J.: Comparison of algorithms that select features for pattern classifiers. Pattern Recognition 33, 25–41 (2000)
Larrañaga, P., Etxeberria, R., Lozano, J.A., Peña, J.M.: Optimization in continuous domains by learning and simulation of Gaussian networks. In: Wu, A.S. (ed.) Proceedings of the 2000 Genetic and Evolutionary Computation Conference, pp. 201–204 (2000)
Mitchell, T.M.: Machine learning. McGraw Hill, New York (1997)
Mühlenbein, H., Mahnig, T., Ochoa, A.: Schemata, distributions and graphical models on evolutionary optimization. Journal of Heuristics 5(2), 215–247 (1999)
Pawlak, Z.: Rough sets. International Journal of Information & Computer Sciences 11, 341–356 (1982)
Pin̂ero, P., Arco, L., García, M., Caballero, Y.: Two new metrics for feature selection in pattern recognition. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol. 2905, pp. 488–497. Springer, Heidelberg (2003)
Polkowski, L.: Rough sets: mathematical foundations. Physica-Verlag, Berlin (2002)
Stefanowski, J.: An experimental evaluation of improving rule-based classifiers with two approaches that change representations of learning examples. Engineering Applications of Artificial Intelligence 17, 439–445 (2004)
Tay, F.E., Shen, L.: Economic and financial prediction using rough set model. European Journal of Operational Research 141, 641–659 (2002)
Wang, X., Yang, Y., Peng, N., Teng, X.: Finding minimal rough set reducts with particle swarm optimization. In: Ślęzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS, vol. 3641, pp. 451–460. Springer, Heidelberg (2005)
Wang, X., Yang, J., Jensen, R., Liu, X.: Rough set feature selection and rule induction for prediction of malignancy degree in brain glioma. Computer Methods and Programs in Biomedicine 83, 147–156 (2006)
Wang, X., Yang, J., Teng, X., Xia, W., Jensen, R.: Feature selection based on rough sets and particle swarm optimization. Pattern Recognition Letters 28, 459–471 (2007)
Wroblewski, J.: Finding minimal reducts using genetic algorithms. In: Wang, P.P. (ed.) Proceedings of the 2nd Annual Joint Conference on Information Sciences, pp. 186–189 (1995)
Xing, H., Xu, L.: Feature space theory -a mathematical foundation for data mining. Knowledge-based systems 14, 253–257 (2001)
Xu, Z.B., Liang, J., Dang, C., Chin, K.S.: Inclusion degree: a perspective on measures for rough set data analysis. Information Sciences 141, 227–236 (2002)
Yuan, S., Chu, F.L.: Fault diagnostics based on particle swarm optimization and support vector machines. Mechanical Systems and Signal Processing 21, 1787–1798 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bello, R., Gómez, Y., Caballero, Y., Nowe, A., Falcón, R. (2009). Rough Sets and Evolutionary Computation to Solve the Feature Selection Problem. In: Abraham, A., Falcón, R., Bello, R. (eds) Rough Set Theory: A True Landmark in Data Analysis. Studies in Computational Intelligence, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89921-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-89921-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89920-4
Online ISBN: 978-3-540-89921-1
eBook Packages: EngineeringEngineering (R0)