Addconcept:A Top-Down Algorithm for Horizontal Merger of  Concept Lattices

doi:10.13190/jbupt.201204.124.lüll

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2012, Vol. 35 ›› Issue (4): 124-128.doi: 10.13190/jbupt.201204.124.lüll

• Reports • Previous Articles

Addconcept:A Top-Down Algorithm for Horizontal Merger of Concept Lattices

Lu Ling-ling1,ZHANG Lei2

1.Electric Power College, North China Institute of Water Conservancy and Hydroelectric Power 2.School of Computer Science and Technology, Harbin Institute of Technology

Received:2011-06-27 Revised:2012-02-16 Online:2012-08-28 Published:2012-07-08
Contact: Ling-Ling Lv E-mail:lingling_lv@163.com
Supported by:
;the National Natural Science Foundation of China

Abstract

Abstract:

A top-down and depth-first algorithm is proposed for horizontally merging concept lattices. The influences of the inserting order of the parents/children concepts on new concepts and updated concepts are investigated. Some theorems on inserting and updating concepts are proved. Based on this, a recursive traversal order is designed to insert concepts into lattices, which can drastically reduce the number of concepts comparisons. Experiment and analysis indicate that the proposed algorithm can obviously improve efficiencies compared with other concept lattices merging algorithms.

Key words: concept lattice, horizontal merger, top-down, distributed construction

CLC Number:

TP18

Lu Ling-ling,ZHANG Lei. Addconcept:A Top-Down Algorithm for Horizontal Merger of Concept Lattices[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2012, 35(4): 124-128.

References

［1］Ganter B, Wille R. Formal concept analysis: mathematical foundations[M]. Berlin: Springer Verlag, 1999. [2］Godin R, Missaoui R, Alaoui H. Incremental concept formation algorithms based on Galois (concept) lattices [J]. Computational Intelligence, 1995, 11(2): 246-267.[3］Merwe D, Obiedkov S, Kourie D. AddIntent: a new incremental algorithm for constructing concept lattices[C]//LNCS 2961: Proceedings of the 2nd International Conference on Formal Concept Analysis. Berlin: Springer, 2004: 372-385. [4］Li Yun, Liu Zongtian, Shen Xiajiong, et al. Theoretical research on the distributed construction of concept lattices [C]// Proceedings of the International Conference on Machine Learning and Cybernetics. New York: Institute of Electrical and Electronics Engineers Inc, 2003: 474-479. [5］智慧来, 智东杰, 刘宗田. 概念格合并原理与算法[J]. 电子学报, 2010, 38(2): 455-459. Zhi Huilai, Zhi Dongjie, Liu Zongtian. Theory and algorithm of concept lattice union[J]. Acta Electronica Sinica, 2010, 38(2): 455-459. [6］Liu Zongtian, Li Liangsheng, Zhang Qing. Research on a union algorithm of multiple concept lattices[C]//Proceedings of 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. Berlin: Springer Verlag, 2003: 533-540.[7］李云, 刘宗田, 陈崚, 等. 多概念格的横向合并算法[J]. 电子学报, 2004, 32 (11) :1849-1854. Li Yun, Liu Zongtian, Chen Ling, et al. Horizontal union algorithm of multiple concept lattices [J]. Acta Electronica Sinica, 2004, 32(11): 1849-1854. [8］张磊, 沈夏炯, 贾培艳, 等. 基于同类概念的概念格横向合并算法[J]. 计算机应用, 2006, 26(8): 1900-1903. Zhang Lei, Shen Xiajiong, Jia Peiyan, et al. Horizontal union algorithm of concept lattice based on congener concept [J]. Journal of Computer Applications, 2006, 26(8): 1900-1903.

Addconcept:A Top-Down Algorithm for Horizontal Merger of Concept Lattices

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 1

Recommended Articles

Metrics

Comments