Vertical Union of Synonymous Concept Lattice


Article Preview

Owing to the completeness of concept lattice, construction efficiency is always a bottleneck restricting its next application. Starting with construction of concept lattice, the paper puts forward the idea of synonymous concept lattice. Applying the character of synonymous concept lattice, the paper promotes an algorithm that is vertical union of synonymous concept lattice (VUSCL Algorithm).The test results show that with the nodes increasing, the algorithm makes better improvement in time complexity than the other vertical union algorithm found in related literature.



Advanced Materials Research (Volumes 219-220)

Edited by:

Helen Zhang, Gang Shen and David Jin




G. Q. Zang and Y. P. Yang, "Vertical Union of Synonymous Concept Lattice", Advanced Materials Research, Vols. 219-220, pp. 1528-1532, 2011

Online since:

March 2011




[1] Ganter B ,Wille R. Formal Concept Analysis :Mathematical Foundations.

[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] Bordat J P.Calcul pratique du treillis de Galois d'une correspondence.Math.Et Sci[M].Humaines,24eme annee,1986,96,31-47.

[4] Njiwoua P,Mephu Nguifo E. A parallel algorithm to build concept lattice[C]. In Proceeding of 4th Groningen Int1. Information Technical Conference for Students,1997,103-107.

[5] Yun Li, Zongtian Liu. Horizontal union algorithm of multiple concept lattice[J], Chinese Journal Of Electronics,2004,11(11):1849-1854.

[6] Xiajiong Shen, Daojun Han, Zongtian Liu. Improved algorithm of concept lattice. Computer Engineering And Application,2004,40(24):100-103.

[7] Lei Zhang, Xiajiong Shen, Daojun Han,An guangwei. Horizontal union algorithm of concept lattice based on Congerer concept.[J],Computer Engineering And Application,2007,43(2):95-98.

[8] Zongtian Liu, Liangsheng Li, Qing Zhang.Research on a union algorithm of multiple concept lattices[C]//RSFDGrC 2003,LNAI2639,Berlin:Springer-Verlag Heidelberg 2003.533-540.

Fetching data from Crossref.
This may take some time to load.