On Reduct Construction Algorithms

This paper critically analyzes reduct construction methodsat two levels. At a high level, one can abstract commonalities from theexisting algorithms, and classify them into three basic groups based onthe underlying control structures. At a low level, by adopting differentheuristics or fitness functions for attribute selection, one is able to derivemost of the existing algorithms. The analysis brings new insights into theproblem of reduct construction, and provides guidelines for the design ofnew algorithms.

[1]  Duoqian Miao,et al.  A Comparison of Rough Set Methods and Representative Inductive Learning Algorithms , 2003, Fundam. Informaticae.

[2]  A. F. Adams,et al.  The Survey , 2021, Dyslexia in Higher Education.

[3]  Anil K. Jain,et al.  Feature Selection: Evaluation, Application, and Small Sample Performance , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Miao Duo,et al.  An Information Representation of the Concepts and Operations in Rough Set Theory , 1999 .

[5]  Ron Kohavi,et al.  Wrappers for Feature Subset Selection , 1997, Artif. Intell..

[6]  Theresa Beaubouef,et al.  Information-Theoretic Measures of Uncertainty for Rough Sets and Rough Relational Databases , 1998, Inf. Sci..

[7]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[8]  Jan G. Bazan,et al.  Rough set algorithms in classification problem , 2000 .

[9]  Qiang Shen,et al.  A modular approach to generating fuzzy rules with reduced attributes for the monitoring of complex systems , 2000 .

[10]  Dominik Ślęzak,et al.  Various approaches to reasoning with frequency based decision reducts: a survey , 2000 .

[11]  Kai Zhao,et al.  A reduction algorithm meeting users’ requirements , 2008, Journal of Computer Science and Technology.

[12]  Wojciech Ziarko,et al.  Data mining tasks and methods: Rule discovery: rough set approaches for discovering rules and attribute dependencies , 2002 .

[13]  Jerzy W. Grzymala-Busse,et al.  LERS-A System for Learning from Examples Based on Rough Sets , 1992, Intelligent Decision Support.

[14]  Ron Kohavi,et al.  Irrelevant Features and the Subset Selection Problem , 1994, ICML.

[15]  Wang Guo,et al.  Decision Table Reduction based on Conditional Information Entropy , 2002 .

[16]  XIAOHUA Hu,et al.  LEARNING IN RELATIONAL DATABASES: A ROUGH SET APPROACH , 1995, Comput. Intell..

[17]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[18]  Wei-Zhi Wu,et al.  Approaches to knowledge reduction based on variable precision rough set model , 2004, Inf. Sci..

[19]  Xiaohua Hu,et al.  Using rough sets theory and database operations to construct a good ensemble of classifiers for data mining applications , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[20]  Wang Jue,et al.  A reduction algorithm meeting users' requirements , 2002 .

[21]  Andrzej Skowron,et al.  The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.

[22]  Roman W. Świniarski,et al.  Rough sets methods in feature reduction and classification , 2001 .

[23]  Andrzej Czyzewski,et al.  Rough Set Methods and Applications , 1998, Rough Sets and Current Trends in Computing.

[24]  Liu San.  Multivalued rough set based attribute reduction algorithm , 2003 .

[25]  Pat Langley,et al.  Selection of Relevant Features and Examples in Machine Learning , 1997, Artif. Intell..

[26]  Cecylia Rauszer.  Reducts in information systems , 1991, Fundam. Informaticae.

[27]  Daphne Koller,et al.  Toward Optimal Feature Selection , 1996, ICML.

[28]  Wang Ju,et al.  Reduction algorithms based on discernibility matrix: The ordered attributes method , 2001, Journal of Computer Science and Technology.

[29]  Qiang Shen,et al.  A Rough Set-Aided System for Sorting WWW Bookmarks , 2001, Web Intelligence.