Skip to main content
SpringerLink
Log in

Totally Balanced Formal Context Representation

  • Conference paper
  • First Online:
Formal Concept Analysis (ICFCA 2015)

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

Included in the following conference series:

Abstract

We show in this paper that doubly lexical orders of totally balanced formal context matrices yield a unique graphical representation binding formal contexts, associated concepts and underlying lattice directed cover graphs. Moreover this representation can be done linearly in the size of the formal context matrix.

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 EPUB and 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

References

  1. Antsee, R., Farber, M.: Characterizations of totally balanced matrices. J. Algorithms 5, 215–230 (1984)

    Article  MathSciNet  Google Scholar 

  2. Berge, C.: Sur certains hypergraphes généralisant les graphes bipartites. Comb. Theor. Appl. I, Colloquium Math. Soc. Janos Bolyai 4, 119–133 (1970)

    MathSciNet  Google Scholar 

  3. Bandelt, H.-J., Dress, A.: Weak hierarchies associated with similarity measures - an additive clustering technique. Bull. Math. Biol. 51, 133–166 (1989)

    MATH  MathSciNet  Google Scholar 

  4. Barbut, C., Monjardet, B.: Ordre et Classification, algèbre et Combinatoire. Hachette, Paris (1970)

    MATH  Google Scholar 

  5. Brucker, F., Gély, A.: Crown-free lattices and their related graphs. Order 28, 443–454 (2009)

    Article  Google Scholar 

  6. Brucker, F., Gély, A.: Parsimonious cluster systems. Adv. Data Anal. Classif. 3, 189–204 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  8. Lehel, J.: A characterization of totally balanced hypergraphs. Discrete Math. 57, 59–65 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  9. Rival, I.: Lattices with doubly irreducible elements. Can. Math. Bull. 17(1), 91–95 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  10. Spinrad, J.: Doubly lexical ordering of dense 0/1 matrices. Inf. Process. Lett. 45, 229–235 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  11. Spinrad, J.: Efficient Graph representations. American Mathematical Society, USA (2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École Centrale Marseille – LIF, CNRS UMR 7279, Marseille, France

    François Brucker & Pascal Préa

Authors
  1. François Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Préa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to François Brucker .

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Barcelona, Spain

    Jaume Baixeries

  2. Babeş-Bolyai University, Cluj-Napoca, Romania

    Christian Sacarea

  3. Departamento de Matemática Aplicada, Universidad de Málaga, Malaga, Spain

    Manuel Ojeda-Aciego

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Brucker, F., Préa, P. (2015). Totally Balanced Formal Context Representation. In: Baixeries, J., Sacarea, C., Ojeda-Aciego, M. (eds) Formal Concept Analysis. ICFCA 2015. Lecture Notes in Computer Science(), vol 9113. Springer, Cham. https://doi.org/10.1007/978-3-319-19545-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19545-2_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19544-5

  • Online ISBN: 978-3-319-19545-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation