Attribute Reduction Algorithm Based on Structure Discernibility Matrix in Composite Information Systems

Attribute reduction, as an important preprocessing step for knowledge acquiring in data mining, is one of the key issues in rough set theory. It can only deal with attributes of a specific type in the information system by using a specific binary relation. However, there may be attributes of multiple different types in information systems in real-life applications. A composite relation is proposed to process attributes of multiple different types simultaneously in composite information systems. In order to solve the time-consuming problem of traditional heuristic attribute reduction algorithms, a novel attribute reduction algorithm based on structure discernibility matrix was proposed in this paper. The proposed algorithms can choose the same attribute reduction as its previous version, but it can be used to accelerate a heuristic process of attribute reduction by avoiding the process of intersection and adopting the forward greedy attribute reduction approach. The theoretical analysis and experimental results with UCI data sets show that the proposed algorithm can accelerate the heuristic process of attribute reduction.

[1]  Jerzy W. Grzymala-Busse,et al.  Characteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation , 2005, Trans. Rough Sets.

[2]  Liu Fu-chun Extension of Rough Set Under Incomplete Information System , 2005 .

[3]  Qian Yu A Positive-Approximation Based Accelerated Algorithm to Feature Selection from Incomplete Decision Tables , 2011 .

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

[5]  Jiye Liang,et al.  Set-valued ordered information systems , 2009, Inf. Sci..

[6]  Alexis Tsoukiàs,et al.  Incomplete Information Tables and Rough Classification , 2001, Comput. Intell..

[7]  H. M. Abu-Donia,et al.  Multi knowledge based rough approximations and applications , 2012, Knowl. Based Syst..

[8]  Andrzej Skowron,et al.  Rudiments of rough sets , 2007, Inf. Sci..

[9]  Yanyong Guan,et al.  Set-valued information systems , 2006, Inf. Sci..

[10]  Tianrui Li,et al.  Composite Rough Sets , 2012, AICI.

[11]  Witold Pedrycz,et al.  Positive approximation: An accelerator for attribute reduction in rough set theory , 2010, Artif. Intell..

[12]  W. Li,et al.  Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation , 2011, Int. J. Approx. Reason..

[13]  Andrzej Skowron,et al.  Rough sets: Some extensions , 2007, Inf. Sci..

[14]  Feng Wang,et al.  A Positive-Approximation Based Accelerated Algorithm to Feature Selection from Incomplete Decision Tables: A Positive-Approximation Based Accelerated Algorithm to Feature Selection from Incomplete Decision Tables , 2011 .

[15]  Tianrui Li,et al.  Composite rough sets for dynamic data mining , 2014, Inf. Sci..

[16]  Manfred M. Fischer,et al.  A Rough Set Approach for the Discovery of Classification Rules in Interval-Valued Information Systems , 2008, Int. J. Approx. Reason..

[17]  Guoyin Wang,et al.  Extension of rough set under incomplete information systems , 2002, 2002 IEEE World Congress on Computational Intelligence. 2002 IEEE International Conference on Fuzzy Systems. FUZZ-IEEE'02. Proceedings (Cat. No.02CH37291).

[18]  Da Ruan,et al.  Incremental learning optimization on knowledge discovery in dynamic business intelligent systems , 2011, J. Glob. Optim..

[19]  Qinghua Hu,et al.  Neighborhood rough set based heterogeneous feature subset selection , 2008, Inf. Sci..