论文信息 - (F, epsilon)-Parallel Reducts in a Series of Decision Subsystems

(F, epsilon)-Parallel Reducts in a Series of Decision Subsystems

In the paper we continue to investigate a new type of attribute reducts in a decision system, which is called parallel reduct. We extend the concept of parallel reducts to (F, epsilon)-parallel reducts and (F,k)-parallel reducts, and investigate their properties. Moreover, We present algorithms to get (F, epsilon)-parallel reducts and (F,k)-parallel reducts.

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

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

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

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

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

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

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

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

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

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

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

[12] Daoguo Li,et al. Knowledge reduction based on incremental algorithms on attribute space , 2008, 2008 International Conference on Machine Learning and Cybernetics.