Abstract
Real world data sets usually have many features, which increases the complexity of data mining task. Feature selection, as a preprocessing step to the data mining, has been shown very effective in reducing dimensionality, removing irrelevant data, increasing learning accuracy, and improving comprehensibility. To find the optimal feature subsets is the aim of feature selection. Rough sets theory provides a mathematical approach to find optimal feature subset, but this approach is time consuming. In this paper, we propose a novel heuristic algorithm based on rough sets theory to find out the feature subset. This algorithm employs appearing frequency of attribute as heuristic information. Experiment results show in most times our algorithm can find out optimal feature subset quickly and efficiently.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Liu, H., Motoda, H.: Feature Selcection for Knowledge discovery and Data Mining. Kluwer Academic Publishers, Dordrecht (1998)
Hall, M.A.: Correlation-based Feature Selection for Machine Learning. PHD thesis. Department of Computer Science, University of Waikato, Hamilton (1999)
Pawlak, Z.: Rough Sets. Int. J. Compute Inf. Sci. 11, 341–356 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Skowron, A., Rauszer, C.: The Discernibility matrices and Functions in Inforamtion Systems, in Intelligent Decision Support – Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362 (1992)
Hu, K., Diao, l., Shi, C.: A Heuristic Optimal Reduct algorithm. In: Leung, K.-S., Chan, L., Meng, H. (eds.) IDEAL 2000. LNCS, vol. 1983, pp. 139–144. Springer, Heidelberg (2000)
Zhong, N., Dong, J.: Using Rough Sets with Heuristics for Feature Selection. Journal of Intelligent Information Systems 16, 199–214 (2001)
Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases, http://www.ics.uci.edu/mlearn/MLReposityory.html
Øhrn, A.: Inst. of Mathematics, University of Warsaw, Poland, http://www.idi.ntun.no/aleks/rosetta/
Guan, J.W., Bell, D.A.: Rough Computational methods for Infor mation Systems, Artificial Intelligence (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Wang, J., Li, D., He, H., Sun, J. (2003). A New Heuristic Reduct Algorithm Base on Rough Sets Theory. In: Dong, G., Tang, C., Wang, W. (eds) Advances in Web-Age Information Management. WAIM 2003. Lecture Notes in Computer Science, vol 2762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45160-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-45160-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40715-7
Online ISBN: 978-3-540-45160-0
eBook Packages: Springer Book Archive