A dynamic rule extraction based on information granularity model for complete data

Rule extraction is an important issue in data mining and knowledge discovery. The effective computation of rule extraction has a direct bearing on the efficiency of knowledge acquisition. In data mining and machine learning tasks, some of the irrelevant attributes not only influence the performance of rule extraction algorithms but also decrease classification accuracy. To acquire brief decision rules, attribute reduction is needed. Since the information granularity is an important approach for attribute measure in rough set theory, in this paper, the effective information granularity based on consistent objects is proposed in complete decision systems, which can effectively measure the discernibility of objects under different value of decision attribute. In addition, when an attribute set may vary dynamically in complete decision system, a dynamic rule extraction approach based on the proposed information granularity is developed in the complete decision system. Finally, the experimental results on different UCI data sets are included to demonstrate the efficiency and effectiveness of the proposed method.

[1]  Andrzej Skowron,et al.  Rough sets and Boolean reasoning , 2007, Inf. Sci..

[2]  Jiang Xu,et al.  Employing rough sets and association rule mining in KANSEI knowledge extraction , 2012, Inf. Sci..

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

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

[5]  Jiye Liang,et al.  Information entropy, rough entropy and knowledge granulation in incomplete information systems , 2006, Int. J. Gen. Syst..

[6]  Guoyin Wang,et al.  RRIA: A Rough Set and Rule Tree Based Incremental Knowledge Acquisition Algorithm , 2003, Fundam. Informaticae.

[7]  Sankar K. Pal,et al.  Case generation using rough sets with fuzzy representation , 2004, IEEE Transactions on Knowledge and Data Engineering.

[8]  Yiyu Yao,et al.  A Unified Framework of Granular Computing , 2008 .

[9]  Potential Applications of Granular Computing in Knowledge Discovery and Data Mining , 1999 .

[10]  Weibin Liu,et al.  Research on the approach of dynamically maintenance of approximations in rough set theory while attribute values coarsening and refining , 2009, 2009 IEEE International Conference on Granular Computing.

[11]  Geert Wets,et al.  A rough sets based characteristic relation approach for dynamic attribute generalization in data mining , 2007, Knowl. Based Syst..

[12]  Roman Slowinski,et al.  Incremental Induction of Decision Rules from Dominance-based Rough Approximations , 2003, RSKD.

[13]  Yiyu Yao,et al.  Perspectives of granular computing , 2005, 2005 IEEE International Conference on Granular Computing.

[14]  Qinghua Hu,et al.  Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation , 2007, Pattern Recognit..

[15]  Da Ruan,et al.  An Incremental Approach for Inducing Knowledge from Dynamic Information Systems , 2009, Fundam. Informaticae.

[16]  Chien-Chung Chan,et al.  A Rough Set Approach to Attribute Generalization in Data Mining , 1998, Inf. Sci..

[17]  Tianrui Li,et al.  An incremental algorithm for mining classification rules in incomplete information systems , 2004, IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04..

[18]  Dun Liu,et al.  An approach for inducing interesting incremental knowledge based on the change of attribute values , 2009, 2009 IEEE International Conference on Granular Computing.