Skip to main content
SpringerLink
Log in

About the Enumeration Algorithms of Closed Sets

  • Conference paper
Book cover Formal Concept Analysis (ICFCA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5986))

Included in the following conference series:

  • 1034 Accesses

Abstract

This paper presents a review of enumeration technics used for the generation of closed sets. A link is made between classical enumeration algorithms of objects in graphs and algorithms for the enumeration of closed sets. A unified framework, the transition graph, is presented. It allows to better explain the behavior of the enumeration algorithms and to compare them independently of the data structures they use.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berry, A., McConnell, R.M., Sigayret, A., Spinrad, J.: Very Fast Instances for Concept Generation. In: Missaoui, R., Schmidt, J. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3874, pp. 119–129. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Bordat, J.P.: Calcul pratique du treillis de galois d’une correspondance. Math. Sci. Hum. 96, 31–47 (1986)

    MATH  MathSciNet  Google Scholar 

  3. Cay, Y., Kong, M.C.: Generating all maximal cliques and related problems for certain perfect graphs. Congressus Numerantium 90, 33–55 (1992)

    MathSciNet  Google Scholar 

  4. Chein, M.: Algorithme de recherche de sous-matrice première d’une matrice. Bull. Math. R. S. Roumanie 13 (1969)

    Google Scholar 

  5. Diday, E., Emilion, R.: Maximal and stochastic galois lattices. Discrete Applied Mathematics 127, 271–284 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Emilion, R., Lambert, G., Lévy, G.: Algorithms for general galois lattice building. Technical report, CERIA, Université Paris IX Dauphine (2001)

    Google Scholar 

  7. Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms 21(3), 618–628 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fu, H.: Algorithmique des Treillis de concepts: Application á la fouille de données. PhD thesis, Université d’Artois, France (2005)

    Google Scholar 

  9. Fu, H., Fu, H., Njiwoua, P., Mephu Nguifo, E.: A comparative study of fca-based supervised classification algorithms. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 313–320. Springer, Heidelberg (2004)

    Google Scholar 

  10. Fu, H., Mephu Nguifo, E.: A parallel algorithm to generate formal concepts for large data. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 394–401. Springer, Heidelberg (2004)

    Google Scholar 

  11. Ganter, B.: Two basic algorithms in concept analysis. Technical report, Technische Hoschule Darmstadt (1984)

    Google Scholar 

  12. Ganter, B., Reuter, K.: Finding all closed sets: a general approach. Order 8 (1991)

    Google Scholar 

  13. Gely, A.: Algorithmique combinatoire: Cliques, Bicliques et systèmes implicatifs. PhD Thesis, Université Blaise Pascal, Clermont-Ferrand, France (2005)

    Google Scholar 

  14. Gély, A., Nourine, L.: Algorithmique d’énumération: Cliques, bicliques, itemset fermés. Revue I3: Information - Interaction - Intelligence, numéro Special (Juin 2007)

    Google Scholar 

  15. Gély, A., Nourine, L., Sadi, B.: Enumeration aspects of maximal cliques and bicliques. Discrete Applied Mathematics 157(7), 1447–1459 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  16. Eiter, T., Gottlob, G., Makino, K.: New results n monotone dualization and generating hypergraph transversals. SIAM J. on Computing 32(2), 514–537 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters 27, 119–123 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  18. Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. Journal of Experimental and Theoritical Artificial Intelligence (JETAI) 14(2/3), 189–216 (2002)

    Article  MATH  Google Scholar 

  19. Kuznetsov, S., Obiedkov, S.: Some decision and counting problems of the Duquenne-Guigues basis of implications. Discrete Applied Mathematics 156(11), 1994–2003 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  20. Lindig, C.: Fast concept analysis. In: Stumme, G. (ed.) Working with Conceptual Structures - Contributions to ICCS 2000, pp. 235–248 (2000)

    Google Scholar 

  21. Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260–272. Springer, Heidelberg (2004)

    Google Scholar 

  22. Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Information Processing Letters 71, 199–204 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  23. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398–416. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  24. Pei, J., Han, J., Mao, R.: Closet: an efficient mining algorithm for mining frequent closed itemsets. In: Proc. of ACM-SIGMOD, International Workshop on Data Mining and Knowledge Discovery (DMKD 2000), Dallas (May 2000)

    Google Scholar 

  25. Savage, C.: A survey of combinatorial (Gray) codes. SIAM Review 39(4), 605–629 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  26. Sertkaya, B.: Some Computational Problems Related to Pseudo-intents. In: Ferré, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol. 5548, pp. 130–145. Springer, Heidelberg (2009)

    Google Scholar 

  27. Tsukiyama, S., Ide, M., Aiyoshi, M., Shirawaka, I.: A new algorithm for generating all the independent sets. SIAM J. Computing 6, 505–517 (1977)

    Article  MATH  Google Scholar 

  28. Uno, T., Asai, T., Uchida, Y., Arimura, H.: Lcm: An efficient algorithm for enumerating frequent closed item sets. In: ICDM 2003 - Proc. of Workshop on Frequent Itemset Mining Implementations, FIMI (2003)

    Google Scholar 

  29. Uno, T., Kiyomi, M., Arimura, H.: Lcm ver. 2: Efficient mining for algorithms for frequent/closed/maximal itemsets. In: ICDM 2004 - Proc. of Workshop on Frequent Itemset Mining Implementations, FIMI (2004)

    Google Scholar 

  30. Valiant, L.: Lcm ver. 2: The complexity of Enumeration and Reliability Problems. SIAM Journal on Computing 8(3) (1979)

    Google Scholar 

  31. Wang, J., Han, J., Pei, J.: Closet+: Searching for the best strategies for mining frequent closed itemsets. In: Proc. of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington D.C. (August 2003)

    Google Scholar 

  32. Zaki, M.J., Hsiao, C.-J.: Charm: an efficient algorithm for closed itemset mining. In: 2nd SIAM International Conference on Data Mining, Arlington (April 2002)

    Google Scholar 

  33. Zaki, M.J., Hsiao, C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transaction on Knowledge and Data Engineering 17(4), 462–478 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IUT de Metz - Département STID, Ile du Saulcy, Université Paul Verlaine - Metz, 57045, Metz Cedex 1

    Alain Gély

  2. Université Blaise Pascal – LIMOS, Campus des Cézeaux, 63173, Aubière Cedex, France

    Raoul Medina & Lhouari Nourine

Authors
  1. Alain Gély
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raoul Medina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lhouari Nourine
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, Zurich University of Applied Sciences, Technikumstraße 9, 8401, Winterthur, Switzerland

    Léonard Kwuida

  2. SAP Research Center, Chemnitzer Straße 48, 01187, Dresden, Germany

    Barış Sertkaya

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gély, A., Medina, R., Nourine, L. (2010). About the Enumeration Algorithms of Closed Sets. In: Kwuida, L., Sertkaya, B. (eds) Formal Concept Analysis. ICFCA 2010. Lecture Notes in Computer Science(), vol 5986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11928-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11928-6_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11927-9

  • Online ISBN: 978-3-642-11928-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation