A novel algorithm for attribute reduction based on consistency criterion

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 33, Issue 2, 2010, Pages 231-239

  Yang, Ming ^a,b  

^a NANJING NORMAL UNIVERSITY   (China)

^b Jiangsu Research Center of Information Security and Privacy Technology   (China)

Author keywords

Attributes reduction; Consistency criterion; Rough set

Indexed keywords

ATTRIBUTE REDUCTION; ATTRIBUTES REDUCTION; CONSISTENCY CRITERIA; CONTINUOUS-VALUED ATTRIBUTE; DESIGNED MODELS; INCONSISTENT DATA; MATHEMATICAL TOOLS; MODEL-BASED; NEW MODEL; NOVEL ALGORITHM; ROUGH SET; ROUGH SET MODELS;

ALGORITHMS; DECISION TABLES;

ROUGH SET THEORY;

EID: 77950558361     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1016.2010.00231     Document Type: Article

References (20)

1. Pawlak Z. Rough sets. International Journal of Information and Computer Science, 1982, 11(5): 341-356.
2. Pawlak Z. Rough set approach to multi-attribute decision analysis. European Journal of Operational Research, 1994, 72(3): 443-459.
3. Liu Qing. Rough Sets and Rough Reasoning. Beijing: Science Press, 2001(in Chinese).
4. Swiniarski R W, Skowron A. Rough set methods in feature selection and recognition. Pattern Recognition Letters, 2003, 24(6): 833-849.
5. Jensen R, Shen Q. Semantics-preserving dimensionality reduction: Rough and fuzzy-rough-based approaches. IEEE Transactions on Knowledge and Data Engineering, 2004, 16(12): 1457-1471.
6. Yang Ming, Yang Ping. A novel condensing tree structure for Rough set feature selection. Neurocomputing, 2008, 71(4-6): 1092-1100.
7. Yang Ming. An incremental updating algorithm for attribute reduction based on improved discernibility matrix. Chinese Journal of Computers, 2007, 30(5): 815-822(in Chinese).
8. Jelonek J, Krawiec K, Slowinski R. Rough set reduction of attributes and their domains for neural networks. Computational Intelligence, 1995, 11(2): 339-347.
9. Wang Jue, Wang Ju. Reduction algorithm based on discernibility matrix the ordered attributes method. Journal of Computer Science and Technology, 2001, 16(6): 489-504.
10. Liu Shao-Hui, Sheng Qiu-Jian, Wu Bin, Shi Zhong-Zhi, Hu Fei. Research on efficient algorithms for Rough set methods. Chinese Journal of Computers, 2003, 26(5): 524-529(in Chinese).
11. Guan J W, Bell D A. Rough computational methods for information systems. Artificial Intelligences, 1998, 105(1-2): 77-103.
12. Miao Duo-Qian, Hu Gui-Rong. A heuristic algorithm for reduction of knowledge. Journal of Computer Research and Development, 1999, 36(6): 681-684(in Chinese).
13. Wang Guo-Yin et al. Theoretical study on attribute reduction of Rough set theory: Comparison of algebra and information views//Proceedings of the 3rd IEEE International Conference on Cognitive Informatics. Canada: IEEE Computer Society, 2004: 148-155.
14. Lin T Y. Computing on binary relation I: Data mining and neighborhood systems//Skoworn A, Polkowshi L eds. Proceedings of the Rough Sets in Knowledge Discovery. Physica-Verlag, 1998: 107-140.
15. Skowron A, Stepaniuk J. Information granules: Towards foundations of granular computing. International Journal of Intelligent Systems, 2001, 16(1): 57-85.
16. Zhu W. Topological approaches to covering Rough sets. Information Sciences, 2007, (177): 1499-1508.
17. Yao Y Y. Relational interpretations of neighborhood operators and Rough set approximation operators. Information Sciences, 1998, 111(1-4): 239-259.
18. Hu Qing-Hua, Yu Da-Ren, Xie Zong-Xia. Numerical attribute reduction based on neighborhood granulation and Rough approximation. Journal of Software, 2008, 19(3): 640-649(in Chinese).
19. Crammer K, Gilad-Bachrach R, Navot A, Tishby N. Margin analysis of the lvq algorithm//Proceedings of the 17th Conference on Neural Information Processing Systems. Vancouver, British Columbia, Canada, 2002: 1185-1192.
20. Vapnik V. The Nature of Statistical Learning Theory. New York: Springer-Verlag, 1995.