Skip to main content
SpringerLink
Log in

Simple Undirected Graphs as Formal Contexts

  • 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

The adjacency matrix of a graph is interpreted as a formal context. Then, the counterpart of Formal Concept Analysis (FCA) tools are introduced in graph theory. Moreover, a formal context is seen as a Boolean information table, the structure at the basis of Rough Set Theory (RST). Hence, we also apply RST tools to graphs. The peculiarity of the graph case, put in evidence and studied in the paper, is that both FCA and RST are based on a (different) binary relation between objects.

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. Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Appl. Math. 145, 11–21 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ciucci, D., Dubois, D., Prade, H.: The structure of oppositions in rough set theory and formal concept analysis - toward a new bridge between the two settings. In: Beierle, C., Meghini, C. (eds.) FoIKS 2014. LNCS, vol. 8367, pp. 154–173. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  3. Dawande, M., Keskinocak, P., Swaminathan, J.M., Tayur, S.: On bipartite and multipartite clique problems. J. Algorithms 41, 388–403 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dubois, D., Dupin de Saint Cyr, F., Prade, H.: A possibility-theoretic view of formal concept analysis. Fundamenta Informaticae 75, 195–213 (2007)

    MATH  MathSciNet  Google Scholar 

  5. Dubois, D., Prade, H.: From Blanché’s hexagonal organization of concepts to formal concept analysis and possibility theory. Log. Univers. 6, 149–169 (2012)

    Article  MATH  MathSciNet  Google Scholar 

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

    Book  MATH  Google Scholar 

  7. Gaume, B., Navarro, E., Prade, H.: A parallel between extended formal concept analysis and bipartite graphs analysis. In: Hüllermeier, E., Kruse, R., Hoffmann, F. (eds.) IPMU 2010. LNCS, vol. 6178, pp. 270–280. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell. 14, 189–216 (2002)

    Article  MATH  Google Scholar 

  9. Li, J., Liu, G., Li, H., Wong, L.: Maximal biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms. IEEE Trans. Knowl. Data Eng. 19, 1625–1637 (2007)

    Article  Google Scholar 

  10. Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publisher, The Netherlands (1991)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DISCo, University of Milano – Bicocca, Viale Sarca 336 – U14, 20126, Milan, Italy

    Davide Ciucci

  2. Department of Mathematics and Informatics, University of Calabria, Via Pietro Bucci, Cubo 30B, 87036, Arcavacata di Rende (CS), Italy

    Giampiero Chiaselotti & Tommaso Gentile

Authors
  1. Giampiero Chiaselotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Davide Ciucci
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tommaso Gentile
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Davide Ciucci .

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

Chiaselotti, G., Ciucci, D., Gentile, T. (2015). Simple Undirected Graphs as Formal Contexts. 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_18

Download citation

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

  • 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