Parallel Reducts and Decision System Decomposition

In this paper, we continue to investigate the properties of parallel reducts. We reveal the drawbacks in the method of decomposing a decision system into a family of decision sub-tables for dynamic reducts, and present a novel method of decomposing a decision system into a series of decision sub-tables for parallel reducts, which also can be applied to dynamic reducts. We prove in theory that the method is effective. Moreover, the method provides a way of calculating the reducts of an inconsistent decision from a family of consistent decision sub-tables, and vice versa.

[1]  Wang Guo.  Calculation Methods for Core Attributes of Decision Table , 2003 .

[2]  Jan G. Bazan.  Dynamic Reducts and Statistical Inference , 1996 .

[3]  Marzena Kryszkiewicz,et al.  Finding Reducts in Composed Information Systems , 1993, RSKD.

[4]  Liu Shao.  A New Method for Fast Computing Positive Region , 2003 .

[5]  Dayong Deng.  Attribute reduction among decision tables by voting , 2008, 2008 IEEE International Conference on Granular Computing.

[6]  Liu Zong,et al.  An Incremental Arithmetic for the Smallest Reduction of Attributes , 1999 .

[7]  Dayong Deng.  (F, epsilon)-Parallel Reducts in a Series of Decision Subsystems , 2010, CSO 2010.

[8]  Dayong Deng,et al.  Parallel reduct and its properties , 2009, 2009 IEEE International Conference on Granular Computing.

[9]  Houkuan Huang,et al.  A New Discernibility Matrix and Function , 2006, RSKT.

[10]  Luo An.  Study for Dynamic Reduct Based on Rough Set , 2006 .

[11]  Dayong Deng,et al.  Parallel Reducts Based on Attribute Significance , 2010, RSKT.

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

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

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

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

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

[17]  Xiangjun Li,et al.  (F, epsilon)-Parallel Reducts in a Series of Decision Subsystems , 2009, 2010 Third International Joint Conference on Computational Science and Optimization.

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