Wuhan University Journal of Natural Sciences

, Volume 11, Issue 5, pp 1362–1366 | Cite as

Reconstructing concept lattices usingnth-order context kernels

  • Shen Xiajiong
  • Xu Bin
  • Liu Zongtian
Text Processing and Decision Support


To be different from traditional algorithms for concept lattice constructing, a method based onnth-order context kernel is suggested in this paper. The context kernels support generating small lattices for sub-contexts split by a given context. The final concept lattice is reconstructed by combining these small lattices. All relevant algorithms are implemented in a system IsoFCA. Test shows that the method yields concept lattices in lower time complexity than Godin algorithm in practical case.

Key words

context kernel concept lattice isomorphism reconstruction 

CLC number

TP 18 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Rudolf Wille. Why Can Concept Lattice Support Knowledge Discovery in Databases [J].Journal of Experimental and Theoretical Artificial Intelligence, 2002,14: 81–92.MATHCrossRefGoogle Scholar
  2. [2]
    Bordat J P. Calcul Pratique Du Treillis De Galois Dune Correspondence[J].Mathematiques at Sciences Humaines, 1986,96 (2): 31–47.MATHMathSciNetGoogle Scholar
  3. [3]
    Godin R, Missaoui K, Alaoui H. Incremental Concept Formation Algorithms Based on Galois (Concept) Lattices[J].Computational Intelligence, 1995,11(2): 246–267.CrossRefGoogle Scholar
  4. [4]
    Jian Songquan, Hu Xuegang, Jiang Meihua. Incremental Algorithms for Extended Concept Lattice[J].Computer Engineering and Applications, 2001, (15): 132–134 (Ch).Google Scholar
  5. [5]
    Xie Zhipeng, Liu Zongtian. A Fast Incremental Algorithm for Building Concept Lattice [J].Chinese Journal of Computers, 2002, (5): 490–496 (Ch).Google Scholar
  6. [6.
    |Shen Xiajiong, Han Daojun, Liu Zongtian. Improvement on Constructing Algorithm of Concept Lattices [J].Computer Engineering and Applications, 2004, (24): 100–104 (Ch).Google Scholar
  7. [7]
    Zhang Wenxiu, Wei Ling, Qi Jianjun. Theory and Approach on Attributes Reduction of Concept Lattices [J].Science in China Ser E Information Sciences, 2005, (6): 628–639 (Ch).Google Scholar
  8. [8]
    Tonella P. Using a Concept Lattice of Decomposition Slices for Program Understanding and Impact Analysis [J].IEEE Transactions on Software Engineering, 2003,29(6): 495–509.CrossRefGoogle Scholar
  9. [9]
    Liu Zongtian, Li Liangsheng, Zhang Qing. Research on a Union Algorithm of Multiple Concept Lattices [C].//RSFDGrC 2003,LNAI 2639. Berlin: Springer-Verlag, 2003: 533–540.Google Scholar
  10. [10]
    Shen Xiajiong, Liu Zongtian, Zhang Qing,et al. Isomorphic Generating of Concept Lattices [C].IEEE International conference on Granular Computing, 2005. Piscataway, NJ: IEEE Inc. 2005,1: 249–252.Google Scholar
  11. [11]
    Yun Li, Liu Zongtian, Shen Xiajiong,et al. Theoretical Research on the Distributed Construction of Concept Lattices [C]//Proceedings of the Second International Conference on Machine Learning and Cybernetics, Xi'an: Institute of Electrical and Electronics, April, 2003: 474–479.Google Scholar
  12. [12]
    Xie Cuihua, Li Yun, Shen Jie. A Constructing Algorithm of Concept Lattice with Attribute Generalization Based on Cloud Models [C]//The Fifth International Conference on Computer and Information Technology 2005.CIT 2005. Piscataway, NJ: IEEE Inc, 2005: 110–115.Google Scholar
  13. [13]
    Hauaiguo Fu, Engelbert M N. A Parallel Algorithm to Generate Formal Concepts for Large Data [C]//ICFCA 2004. Sydney, Australia, May, 2004: 394–401.Google Scholar
  14. [14]
    Qi Hong, Liu Dayou, Hu Chengquan,et al. A Parallel Algorithm Based on Search Space Partition for Generating Concepts [C]//Parallel and Distributed Systems. July 2004: 241–248.Google Scholar
  15. [15]
    Zhang Qing.Data Mining Based on the Distributed Model of Concept Lattices [D]. Shanghai: Dept Comp Info Eng, Shanghai Univ, 2002.Google Scholar
  16. [16]
    Hu Keyun, Lu Yuchang, Shi Chunyi. An Integrated Mining Approach Classification and Association Rule Based on Concept Lattice[J].Journal of Software, 2000,11(11): 1478–1484 (Ch).Google Scholar
  17. [17]
    Ganter B, Wille R.Formal Concept Analysis: Mathematical Foundations [M]. Berlin: Springer Verlag, 1999.Google Scholar

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.School of Computer and Information EngineeringHenan UniversityKaifeng, HenanChina
  2. 2.School of Computer Engineering and ScienceShanghai UniversityShanghaiChina

Personalised recommendations