A Linear Delay Algorithm for Building Concept Lattices

  • Martin Farach-Colton
  • Yang Huang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5029)


Concept lattices (also called Galois lattices) have been applied in numerous areas, and several algorithms have been proposed to construct them. Generally, the input for lattice construction algorithms is a binary matrix with size |G||M| representing binary relation I ⊆ G ×M . In this paper, we consider polynomial delay algorithms for building concept lattices. Although the concept lattice may be of exponential size, there exist polynomial delay algorithms for building them. The current best delay-time complexity is O(|G||M|2). In this paper, we introduce the notion of irregular concepts, the combinatorial structure of which allows us to develop a linear delay lattice construction algorithm, that is, we give an algorithm with delay time of O(|G||M|). Our algorithm avoids the union operation for the attribute set and does not require checking if new concepts are already generated. In addition, we propose a compact representation for concept lattices and a corresponding construction algorithm. Although we are not guaranteed to achieve optimal compression, the compact representation can save significant storage space compared to the full representation normally used for concept lattices.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berry, A., Bordat, J.-P., Aigayret, A.: Concepts can’t afford to stammer. In: INRIA Proceedings of the International Conference, Journées de l’Informatique Messine (JIM 2003) (2003)Google Scholar
  2. 2.
    Bordat, J.-P.: Calcul pratique du treillis de galois dune correspondance. Mathmatique, Informatique et Sciences Humaines 24, 31–47 (1986)MathSciNetGoogle Scholar
  3. 3.
    Carpineto, C., Romano, G.: A lattice conceptual clustering system and its application to browsing retrieval. Machine Learning 24, 95–122 (1996)Google Scholar
  4. 4.
    Carpineto, C., Romano, G.: Concept Data Analysis: Theory and Applications. Wiley, Chichester (2004)zbMATHGoogle Scholar
  5. 5.
    Choi, V.: Faster algorithms for constructing a concept (galois) lattice (2006),
  6. 6.
    Choi, V., Huang, Y., Lam, V., Potter, D., Laubenbacher, R., Duca, K.: Using formal concept analysis for microarray data comparison. In: Proceedings of the 5th Asia Pacific Bioinformatics Conference, pp. 57–66 (2006)Google Scholar
  7. 7.
    Eppstein, D.: Arboricity and bipartite subgraph listing algorithm. Information Processing Letters 54, 207–211 (1994)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Everts, T.J., Park, S.S., Kang, B.H.: Using formal concept analysis with an incremental knowledge acquisition system for web document management. In: Proceedings of the 29th Australasian Computer Science Conference, pp. 247–256 (2006)Google Scholar
  9. 9.
    Ganter, B., Wille, R.: Formal concept analysis: Mathematical Foundations. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  10. 10.
    Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on galois (concept) lattices. Computational Intelligence 11, 246–267 (1995)CrossRefGoogle Scholar
  11. 11.
    Huang, Y., Farach-Colton, M.: Lattice based clustering of temporal gene-expression matrices. In: Proceedings of the 7th SIAM International Conference on Data Mining (2007)Google Scholar
  12. 12.
    Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters 27, 119–123 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Kalfoglou, Y., Dasmahapatra, S., Chen-Burger, Y.: Fca in knowledge technologies: Experiences and opportunities. In: Proceedings of 2nd International Conference on Formal Concept Analysis, pp. 252–260. Springer, Heidelberg (2004)Google Scholar
  14. 14.
    Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Proceedings of 9th Scand. Workshop on Algorithm Theory, pp. 260–272 (2004)Google Scholar
  15. 15.
    Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Information Processing Letters 71, 199–204 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Snelting, G., Tip, F.: Reengineering class hierarchies using concept analysis. In: Proceedings of the 6th ACM SIGSOFT International Symposium on Foundations of Software Engineering, pp. 99–110 (1998)Google Scholar
  17. 17.
    Uno, T., Asai, T., Uchida, Y., Arimura, H.: Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets. In: IEEE ICDM Workshop on Frequent Itemset Mining Implementation (2004)Google Scholar
  18. 18.
    Wang, J., Han, J., Pei, J.: Searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 344–353 (2004)Google Scholar
  19. 19.
    Yang, G.: The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 344–353 (2004)Google Scholar
  20. 20.
    Zaki, M.J., Hsiao, C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transaction on Knowledge and Data Engineering 17, 462–478 (2005)CrossRefGoogle Scholar
  21. 21.
    Zaki, M.J., Ogihara, M.: Theoretical foundations of association rules. In: Proceedings of 3rd ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 1–7 (1998)Google Scholar
  22. 22.
    Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 326–335 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Martin Farach-Colton
    • 1
  • Yang Huang
    • 1
  1. 1.Department of Computer ScienceRutgers UniversityPiscataway

Personalised recommendations