Skip to main content
SpringerLink
Log in
Book cover

International Conference on Formal Concept Analysis

ICFCA 2005: Formal Concept Analysis pp 235–248Cite as

Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases

  • Conference paper

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

Abstract

Mannila and Räihä [5] have shown that minimum implicational bases can have an exponential number of implications. Aim of our paper is to understand how and why this combinatorial explosion arises and to propose mechanisms which reduce it.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Guigues, J.-L., Duquenne, V.: Famille minimale d’implications informatives résultant d’un tableau de donneés binaires. Mathématiques et sciences humaines, 24 (1986)

    Google Scholar 

  2. Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 549–564. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Ganter, B.: Finding closed sets under symmetry, FB4-Preprint 1307, TH Darmstadt (1990)

    Google Scholar 

  4. Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  5. Mannila, H., Räihä, K.J.: On the complexity of inferring functional dependencies. Discrete Applied Mathematics 40(2), 237–243 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Medina, R., Nourine, L.: Clone items: a pre-processing information for knowledge discovery (Submitted)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    A. Gély, R. Medina, L. Nourine & Y. Renaud

Authors
  1. A. Gély
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Medina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. Nourine
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Y. Renaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Algebra, University of Technology, Dresden, Germany

    Bernhard Ganter

  2. Département d’informatique, UQAM, P.O. Box, Montréal, (Qc), Canada

    Robert Godin

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gély, A., Medina, R., Nourine, L., Renaud, Y. (2005). Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases. In: Ganter, B., Godin, R. (eds) Formal Concept Analysis. ICFCA 2005. Lecture Notes in Computer Science(), vol 3403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32262-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32262-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24525-4

  • Online ISBN: 978-3-540-32262-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation