Abstract The exitsing reduction methods mainly use basic algorithm or heuristic algorithm based on discernibility matrix. However, the former can only be applied to the small dataset and the latter can not guarantee completeness. On the basis of studying the mapping relation between equivalence class and extension, the relevant solution of rough set based on concept lattice is mainly studied. Moreover, a complete reduction algorithm is proposed based on concept lattice and the test results show that the proposed algorithm enhances the performance of time and space.
[1] Pawlak Z. Rough Sets. London, UK: Kluwer Academic Publishers, 1991 [2] Wang Guoying. Rough Set Theory and Knowledge Acquaintance. Xi'an, China: Xi'an Jiaotong University Press, 2003 (in Chinese) (王国胤.Rough集理论与知识获取.西安:西安交通大学出版社, 2003) [3] Mrózek A. Rough Set and Dependency Analysis among Attributes in Computer Implementations of Expert's Inference Model. International Journal of Man-Machine Studies, 1989, 30(4): 457-471 [4] Skowron A, Son N H. Some Efficient Algorithms for Rough Set Methods // Proc of the 2nd International Joint Conference on Information Science. Granada, Spain, 1996: 1451-1456 [5] PawIak Z. Rough Set. International Journal of Computer and Information Sciences, 1982, 11: 341-356 [6] Hu X H. Knowledge Discovery in Databases: An Attribute-Oriented Rough Set Approach. Ph.D Dissertation. Regina, Canada: University of Regina. College of Information Science and Technology, 1995 [7] Wille R. Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts // Rival I, ed. Ordered Sets. Dordrecht, Netherlands: Reidel, 1982: 445-470 [8] Yao Y Y. Concept Lattices in Rough Set Theory // Proc of the Annual Meeting of the North American Fuzzy Information Processing Society. Banff, Canada, 2004: 796-801 [9] Wang Hong, Zhang Wenxiu. Relationships between Concept Lattice and Rough Set // Proc of the 8th International Conference on Artificial Intelligence and Soft Computing. Zakopane, Poland, 2006: 538-547 [10] Wei Lin, Qi Jianjun, Zhang Wenxiu. Study on Relationships between Concept Lattice and Rough Set. Computer Science, 2006, 33(3): 18-21 (in Chinese) (魏 玲,祁建军,张文修.概念格与粗糙集的关系研究.计算机科学, 2006, 33(3): 18-21) [11] Hu Xuegang. Research on the Model of Knowledge Acquaintance from Database. Ph.D Dissertation. Hefei, China: Hefei University of Technology. School of Computer and Information, 2000 (in Chinese) (胡学钢.从数据库中提取知识的模型研究.博士学位论文.合肥:合肥工业大学.计算机与信息学院, 2000) [12] Hu Keyun.Research on Concept Lattice and Rough Set Based Data Mining Methods. Ph.D Dissertation. Beijing, China: Tsinghua University. School of Computer Science and Technology, 2001 (in Chinese) (胡可云.基于概念格和粗糙集的数据挖掘方法研究.博士学位论文.北京:清华大学.计算机科学与技术学院,2001) [13] Hu Xuegang, Wang Xinya, Zhang Yuhong. Representation and Resolution of Reduction Based on Concept Lattice.Journal of Hefei University of Technology: Natural Science, 2007, 30(3): 278-281 (in Chinese) (胡学钢,王昕娅,张玉红.基于概念格模型的约简表示及求解.合肥工业大学学报:自然科学版, 2007, 30(3): 278-281)
2009, Vol. 22 
