论文信息 - Attribute reduction among decision tables by voting

Attribute reduction among decision tables by voting

In the paper, we propose a novel method of attribute reduction among decision tables by voting. Different from almost all of other methods of attribute reduction, the method is at higher level of granularity. Its granularity is decision tables but not equivalence classes. The method could be applied into the cases of tremendously large data and dynamical data.

Dayong Deng

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

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

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

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

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

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

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

[8] Yiyu Yao,et al. Granular Computing , 2008 .

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

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