Abstract
Feature subset selection is an importent component of knowledge discovery and data mining systems to help reduce the data dimensionality. Rough sets theory provides a mechanism of selecting feature subsets. In the rough set community, most feature subset selection algorithms are attributes reduct-oriented; that is, finding minimum reducts of the conditional attributes of a decision table. Two main approaches to finding attribute reducts are categorized as discernibility functions-based and attribute dependency-based. These algorithms, however, suffer from intensive computations of either discernibility functions for the former or positive regions for the latter. In this paper, we propose a new concept, called relative attribute dependency, and present a sufficient and necessary condition of the minimum conditional attributes reduct of a decision table represented with the relative attribute dependency. The relative attribute dependency can be calculated by counting the distinct rows of the sub-decision table, instead of generating discernibility functions or positive regions. Thus the computation efficiency of minimum reducts are highly improved. We develop two algorithms for finding minimum reducts of the conditional attributes, one brute-force algorithm and the other heuristic algorithm using attribute entropy as the heuristic function. We also show the results of these algorithms by an illustrative example.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bazan, J., Nguyen, H., Nguyen, S., Synak, P., Wroblewski, J.: Rough set algorithms in classification problems. In: Polkowski, L., Lin, T.Y., Tsumoto, S. (eds.) Rough Set Methods and Applications: New Developments in Knowledge Discovery in Information Systems, pp. 49–88. Physica-Verlag, Heidelberg (2000)
Cercone, N., Ziarko, W., Hu, X.: Rule Discovery from Databases: A Decision Matrix Approach. In: Michalewicz, M., Raś, Z.W. (eds.) ISMIS 1996. LNCS, vol. 1079, pp. 653–662. Springer, Heidelberg (1996)
John, G., Kohavi, R., Pfleger, K.: Irrelevant Features and the Subset Selection Problem. In: Proc. ICML, pp. 121–129 (1994)
Kira, K., Rendell, L.A.: The feature Selection Problem: Traditional Methods and a New Algorithm. In: Proc. AAAI, pp. 129–134. MIT Press, Cambridge (1992)
Kumar, A.: New Techniques for Data Reduction in Database Systems for Knowledge Discovery Applications. Journal of Intelligent Information Systems 10(1), 31–48 (1998)
Liu, H., Motoda, H. (eds.): Feature Extraction Construction and Selection: A Data Mining Perspective. Kluwer Academic Publishers, Dordrecht (1998)
Modrzejewski, M.: Feature Selection Using Rough Sets Theory. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, pp. 213–226. Springer, Heidelberg (1993)
Nguyen, H., Nguyen, S.: Some efficient algorithms for rough set methods. In: Proc. IPMU, Granada, Spain, pp. 1451–1456 (1996)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1992)
Polkowski, L., Skowron, A.: Rough mereology: A new paradigm for approximate reasoning. J. of Approximate Reasoning 15(4), 333–365 (1996)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo (1993)
Shen, Q., Chouchoulas, A.: A modular approach to generalizing fuzzy rules with reduced attributes for the monitoring of complex systems. Enginnering Applications of Artificial Intelligence 13(3), 263–278 (2000)
Shen, Q., Chouchoulas, A.: A rough-fuzzy approach for generating classification rules. Pattern Recognition 35, 2425–2438 (2002)
Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. In: Slowinski, K. (ed.) Intelligent Decision Support - Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362. Kluwer, Dordrecht (1992)
Ziarko, W.: The Discovery, analysis and representation of data dependencys in databases. In: Patesky-Shapiro, G., Frawley, W.J. (eds.) Knoweldge Discovery in Databases, MIT Press, Cambridge (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, J., Hu, X., Lin, T.Y. (2004). Feature Subset Selection Based on Relative Dependency between Attributes. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds) Rough Sets and Current Trends in Computing. RSCTC 2004. Lecture Notes in Computer Science(), vol 3066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25929-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-25929-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22117-3
Online ISBN: 978-3-540-25929-9
eBook Packages: Springer Book Archive