Abstract
Rough Sets Theory has opened new trends for the development of the Incomplete Information Theory. Inside this one, the notion of reduct is a very significant one, but to obtain a reduct in a decision system is an expensive computing process although very important in data analysis and knowledge discovery. Because of this, it has been necessary the development of different variants to calculate reducts. The present work look into the utility that offers Rough Sets Model and Information Theory in feature selection and a new method is presented with the purpose of calculate a good reduct. This new method consists of a greedy algorithm that uses heuristics to work out a good reduct in acceptable times. In this paper we propose other method to find good reducts, this method combines elements of Genetic Algorithm with Estimation of Distribution Algorithms. The new methods are compared with others which are implemented inside Pattern Recognition and Ant Colony Optimization Algorithms and the results of the statistical tests are shown.
Chapter PDF
References
Álvarez, D. Feature selection for data analysis using Rough Sets Theory. Thesis of Computer Science Engineering. Thesis Director: Yailé Caballero, M.Sc. University of Camagüey, Cuba. 2005.
Ahn, B.S. et al.. The integrated methodology of rough set theory and artificial neural networks for business failure predictions. Expert Systems with Applications 18, 65–74. 2000.
Bell, D. and Guan, J. Computational methods for rough classification and discovery. Journal of ASIS 49,5, pp. 403–414. 1998.
Caballero, Y. Using Rough Sets Theory to treatment of the data. Thesis of Master in Computer Science. Thesis Director: Rafael Bello, PhD. Universidad Central de Las Villas, Cuba. 2005.
Carlin, U.S. et al.. Rough set analysis of medical datasets and A case of patient with suspected acute appendicitis. In ECAI 98 Workshop on Intelligent data analysis in medicine and pharmacology.
Choubey, S.K. et al. A comparison of feature selection algorithms in the context of rough classifiers. In Proceedings of Fifth IEEE International Conference on Fuzzy Systems, vol. 2, pp. 1122–1128. 1996.
Chouchoulas, A. and Shen, Q. A rough set-based approach to text classification. Lectures Notes in Artificial Intelligence no. 1711, pp. 118–127. 1999.
Deogun, J.S. et al. Exploiting upper approximations in the rough set methodology. In Proceedings of First International Conference on Knowledge Discovery and Data Mining, Fayyad, U. Y Uthurusamy, (Eds.), Canada, pp. 69–74. 1995.
Deogun, J.S. et al. Feature selection and effective classifiers. Journal of ASIS 49,5, pp. 423–434. 1998.
Dimitriev, A. N.; Zhuravlev, J. I.; Krendeleiev, F. P.. About mathematical principles of objects and phenomenon classification. Diskretnyi Analiz No. 7, pp. 3–15, 1966.
Greco, S. Et al. Rough sets theory for multicriteria decision analysis. European Journal of Operational Research 129, pp. 1–47, 2001.
Jensen R. and Qiang, S. “Finding rough sets reducts with Ant colony optimization”. http://www.inf.ed.ac.uk/publications/online/0201.pdf 2003.
Koczkodaj, W.W. et al.. Myths about Rough Set Theory. Comm. of the ACM, vol. 41, no. 11, nov. 1998.
Kohavi, R. and Frasca, B. Useful feature subsets and Rough set Reducts. Proceedings of the Third International Workshop on Rough Sets and Soft Computing. 1994.
Komorowski, J. Pawlak, Z. et al.. Rough Sets: A tutorial. In Pal, S.K. and Skowron, A. (Eds) Rough Fuzzy Hybridization: A new trend in decision-making. Springer, pp. 3–98. 1999.
Komorowski, J. et al.. A Rough set perspective on Data and Knowledge. In The Handbook of Data mining and Knowledge discovery, Klosgen, W. and Zytkow, J. (Eds). Oxford University Press, 1999.
Maudal, O. Preprocessing data for neural network based classifiers: Rough sets vs Principal Component Analysis. Project report, Dept. of Artificial Intelligence, University of Edinburgh. 1996.
Mühlenbein H. The equation for the response to selection and its use for prediction. Evolutionary Computation 5(3), pp. 303–346, 1998.
Mühlenbein, H; Mahnig, T.; Ochoa, A. Schemata, distributions and graphical models on evolutionary optimization. Journal of Heuristics, 5(2), pp. 215–247. 1999.
Ohrn, A. and Komorowski, J.. Rosetta: A rough set toolkit for analysis of data. In Proc. Third Int. Join Conference on Information Science, Durham, NC, USA, march 1–5, vol. 3, pp. 403–407. 1997.
Pal, S.K. and Skowron, A. (Eds). Rough Fuzzy Hybridization: a new trend in decision-making. Springer-Verlag, 1999.
Pal, S.K. et al. Web mining in Soft Computing framework: Relevance, State of the art and Future Directions. IEEE Transactions on Neural Networks, 2002.
Pawlak, Z. Rough sets. International Journal of Information & Computer Sciences 11, 341–356, 1982.
Pawlak, Z. Rough SetsTheoretical Aspects of Reasoning About Data. Kluwer Academic Publishing, Dordrecht, 1991. En: http://citeseer.ist.psu.edu/context/36378.html
Pawlak, Z. and Skowron, A. “Rough sets rudiments”. Bulletin of International Rough Set Society. Volume 3, Number 3. http://w\vw.kuenstliche-intelligenz.de/archiv/2001_3/pawlak.pdf
Pawlak, Z. “Rough Sets, Rough Relations and Rough functions”. R. Yager, M. Fedrizzi, J. Keprzyk (eds.): Advances in the Dempster — Shafer Theory of Evidence, Wiley, New Cork, pp 251–271. 1995 http://citeseer.ist.psu.edu/105864.html
Piñero, P; Arco, L; García, M. and Caballero, Y. Two New Metrics for Feature Selection in Pattern Recognition. Lectures Notes in computer Science (LNCS 2905), pp. 488–497. Springer, Verlag, Berlin Heidelberg. New York. ISSN 0302-9743. ISBN 3-540-20590-X.
Polkowski, L.. Rough sets: Mathematical foundations. Physica-Verlag, p. 574. Berlin, Germany. 2002.
Predki, B. et al.. ROSE-Software implementation of the Rough Set Theory. In Polkowski, L. and Skowron, A. (Eds) Rough Sets and Current Trends in Computing, Proceedings of the RSCTC98 Conference. Lectures Notes in Artificial Intelligence vol. 1424, Berlin pp. 605–608.
Tay, F.E. and Shen, L.. Economic and financial prediction using rough set model. European Journal of Operational Research 141, pp. 641–659. 2002.
Wilson, Randall. Martinez, Tony R. Reduction Techniques for Exemplar-Based Learning Algorithms. Machine Learning. Computer Science Department, Brigham Young University. USA 1998.
Wroblewski, J. Finding minimal reducts using genetic algorithms. In Wang, P.P. (Ed). Proceedings of the International Workshop on Rough Sets Soft Computing at Second Annual Joint Conference on Information Sciences, North Carolina, USA, p. 679, pp. 186–189. 1995.
Wroblewski, J. Theoretical foundations of order-based genetic algorithms. Fundamenta Informaticae, vol. 28(3,4), pp. 423–430. IOS Press. 1996.
Wroblewski, J. Genetic algorithms in decomposition and classification problems. In Polkowski, L. and Skowron, A. (Eds.). Rough sets in Knowledge Discovery 1: Applications, Case Studies and Software Systems. Physica-Verlag, pp. 472–492. 1998.
Zhong, N. et al.. Using Rough sets with heuristics for feature selection. Journal of Intelligent Information Systems, 16, 199–214. 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Caballero, Y., Bello, R., Alvarez, D., Garcia, M.M. (2006). Two new feature selection algorithms with Rough Sets Theory. In: Bramer, M. (eds) Artificial Intelligence in Theory and Practice. IFIP AI 2006. IFIP International Federation for Information Processing, vol 217. Springer, Boston, MA . https://doi.org/10.1007/978-0-387-34747-9_22
Download citation
DOI: https://doi.org/10.1007/978-0-387-34747-9_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34654-0
Online ISBN: 978-0-387-34747-9
eBook Packages: Computer ScienceComputer Science (R0)