Abstract：Attribute reduction is the kernel contents of rough set theory.Concept lattice is effective for knowledge representation and data analysis. Multi-level attribute reduction algorithm based on concept lattice is proposed by using concept lattice as reduction tool. The concepts including discriminable concepts, equivalent concepts and wane-n level are also introduced. The infuence of intent waned-value producing impact on the change of classification ability and the judge theorems of attribute reduction in concept lattice are mainly studied. The proposed algorithm discovers all the maximal reductions completely and an effective approach is presented to attribute reduction in concept lattice. Finally, a real example and experiment comparisons demonstrate both its feasibility and effectiveness.
[1] Ganter B,Wille R.Formal Concept Analysis: Mathematical Foundations.Heidelberg,Germany: Springer-Verlag,1999 [2] Krohn U,Davies N J,Weeks R.Concept Lattices for Knowledge Management.BT Technology Journal,1999,17(4): 108-116 [3] Kuznetsov S O.Machine Learning on the Basis of Formal Concept Analysis.Automation and Remote Control,2001,62(10): 1543-1564 [4] Carpineto C,Romano G.Information Retrieval through Hybrid Navigation of Lattice Representations.International Journal of Human-Computer Studies,1996,45(5): 553-578 [5] Godin R,Mili H,Mineau G W,et al.Design of Class Hierarchies Based on Concept (Galois) Lattices.Theory and Application of Object Systems,1998,4(2): 117-134 [6] Pawlak Z.Rough Sets.London,UK: Kluwer Academic Publishers,1991 [7] Wei Lin,Qi Jianjun,Zhang Wenxiu.Study on Relationships between Concept Lattice and Rough Set.Computer Science,2006,33(3): 18-2l (in Chinese) (魏 玲,祁建军,张文修.概念格与粗糙集的关系研究.计算机科学,2006,33(3): 18-21) [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 Yuanzhen,Pei Xiaobing.A Fast Algorithm for Reduction Based on Skowron Discernibility Matrix.Computer Science,2005,32(4): 42-44 (in Chinese) (王元珍,裴小兵.基于Skowron分明矩阵的快速约简算法.计算机科学,2005,32(4): 42-44) [10] Hou Lijuan,Shi Changqiong.Heuristic Algorithm to Rough Set Attribute Reduction Based on Discernibility Matrix.Computer Engineering and Design,2007,28(18): 4466-4468 (in Chinese) (侯利娟,史长琼.基于分明矩阵的属性约筒启发式算法.计算机工程与设计,2007,28(18): 4466-4468) [11] Wu Mingfen,Xu Yong,Liu Zhiming. Heuristic Algorithm for Reduction Based on the Significance of Attributes.Journal of Chinese Computer Systems,2007,28(8): 1452-1455 (in Chinese) (吴明芬,许 勇,刘志明.一种基于属性重要性的启发式约简算法.小型微型计算机系统,2007,28(8): 1452-1455) [12] Zhang Tengfei,Xiao Jianmei,Wang Xihuai.Algorithms of Attribute Relative Reduction in Rough Set Theory.Acta Electronica Sinica,2005,33(11): 2080-2083 (in Chinese) (张腾飞,肖健梅,王锡淮.粗糙集理论中属性相对约简算法.电子学报,2005,33(11): 2080-2083) [13] Li Lifeng,Wang Guojun.A Method to Explore the Reduction of Concept Lattice.Computer Engineering and Applications,2006,42(20): 147-149,216 (in Chinese) (李立峰,王国俊.一种求概念格属性约简的方法.计算机工程与应用,2006,42(20): 147-149,216) [14] Hu Xuegang,Xue Feng,Zhang Yuhong,et al.Attribute Reduction Methods of Decision Table Based on Concept Lattice.Pattern Recognition and Artificial Intelligence,2009,22(4): 624-629 (in Chinese) (胡学钢,薛 峰,张玉红,等.基于概念格的决策表属性约简方法.模式识别与人工智能,2009,22(4): 624-629)
2012, Vol. 25 
