F-Parallel Reducts in the Information View
暂无分享,去创建一个
[1] Jan G. Bazan,et al. Rough set algorithms in classification problem , 2000 .
[2] Liu Shao. A New Method for Fast Computing Positive Region , 2003 .
[3] 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.
[4] Dayong Deng. (F, epsilon)-Parallel Reducts in a Series of Decision Subsystems , 2010, CSO 2010.
[5] XIAOHUA Hu,et al. LEARNING IN RELATIONAL DATABASES: A ROUGH SET APPROACH , 1995, Comput. Intell..
[6] Janusz Zalewski,et al. Rough sets: Theoretical aspects of reasoning about data , 1996 .
[7] Dayong Deng,et al. Parallel reduct and its properties , 2009, 2009 IEEE International Conference on Granular Computing.
[8] Houkuan Huang,et al. A New Discernibility Matrix and Function , 2006, RSKT.
[9] Wang Guoyin. On the Relationship Between the Algebra View and Information View of Rough Set Theory , 2002 .
[10] Andrzej Skowron,et al. The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.
[11] Lin Chen,et al. Attribute significance for F — Parallel reducts , 2011, 2011 IEEE International Conference on Granular Computing.
[12] Wang Guo,et al. Decision Table Reduction based on Conditional Information Entropy , 2002 .
[13] Miao Duo,et al. An Information Representation of the Concepts and Operations in Rough Set Theory , 1999 .
[14] Dayong Deng,et al. Parallel Reducts Based on Attribute Significance , 2010, RSKT.