Skip to main content

Morphological Links Between Formal Concepts and Hypergraphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 10225))

Abstract

Hypergraphs can be built from a formal context, and conversely formal contexts can be derived from a hypergraph. Establishing such links allows exploiting morphological operators developed in one framework to derive new operators in the other one. As an example, the combination of derivation operators on formal concepts leads to closing operators on hypergraphs which are not the composition of dilations and erosions. Several other examples are investigated in this paper, with the aim of processing formal contexts and hypergraphs, and navigating in such structures.

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

Buying options

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

Learn about institutional subscriptions

Notes

  1. 1.

    In this paper we consider only the four basic operators (dilation, erosion, opening, closing).

  2. 2.

    In the table we denote by \(Inv(\varphi )\) the set of fixed points of an operator \(\varphi \) (i.e. \(x \in Inv(\varphi )\) iff \(\varphi (x)=x\)).

References

  1. Atif, J., Bloch, I., Distel, F., Hudelot, C.: Mathematical morphology operators over concept lattices. In: Cellier, P., Distel, F., Ganter, B. (eds.) ICFCA 2013. LNCS (LNAI), vol. 7880, pp. 28–43. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38317-5_2

    Chapter  Google Scholar 

  2. Atif, J., Bloch, I., Hudelot, C.: Some relationships between fuzzy sets, mathematical morphology, rough sets, F-transforms, and formal concept analysis. Int. J. Uncertain. Fuzz. Knowl. Based Syst. 24(2), 1–32 (2016)

    Article  MathSciNet  Google Scholar 

  3. Berge, C.: Hypergraphs. Elsevier Science Publisher, Amsterdam (1989)

    MATH  Google Scholar 

  4. Berry, A., Sigayret, A.: Representing a concept lattice by a graph. Discret. Appl. Math. 144(1), 27–42 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bloch, I.: Mathematical morphology, lattices, and formal concept analysis. In: 8th International Conference on Concept Lattices and Their Applications (CLA 2011) - Invited Conference, p. 1, Nancy, France, October 2011

    Google Scholar 

  6. Bloch, I., Bretto, A.: Mathematical morphology on hypergraphs, application to similarity and positive kernel. Comput. Vis. Image Underst. 117(4), 342–354 (2013)

    Article  Google Scholar 

  7. Bloch, I., Bretto, A., Leborgne, A.: Robust similarity between hypergraphs based on valuations and mathematical morphology operators. Discret. Appl. Math. 183, 2–19 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bloch, I., Heijmans, H., Ronse, C.: Mathematical morphology. In: Aiello, M., Pratt-Hartman, I., van Benthem, J. (eds.) Handbook of Spatial Logics, pp. 857–947. Springer, Dordrecht (2007). Chap. 13

    Chapter  Google Scholar 

  9. Bretto, A.: Hypergraph Theory: An Introduction. Mathematical Engineering. Springer, Cham (2013)

    Book  MATH  Google Scholar 

  10. Cousty, J., Najman, L., Dias, F., Serra, J.: Morphological filtering on graphs. Comput. Vis. Image Underst. 117, 370–385 (2013)

    Article  Google Scholar 

  11. Dias, F., Cousty, J., Najman, L.: Some morphological operators on simplicial complex spaces. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds.) DGCI 2011. LNCS, vol. 6607, pp. 441–452. Springer, Heidelberg (2011). doi:10.1007/978-3-642-19867-0_37

    Chapter  Google Scholar 

  12. Dias, F., Cousty, J., Najman, L.: Dimensional operators for mathematical morphology on simplicial complexes. Pattern Recogn. Lett. 47, 111–119 (2014)

    Article  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  14. Freund, A., Andreatta, M., Giavitto, J.L.: Lattice-based and topological representations of binary relations with an application to music. Ann. Math. Artif. Intell. 73(3–4), 311–334 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ganter, B., Wille, R., Franzke, C.: Formal Concept Analysis: Mathematical Foundations. Springer-Verlag New York, Inc., New York (1997)

    Google Scholar 

  16. 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 (LNAI), vol. 6178, pp. 270–280. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14049-5_28

    Chapter  Google Scholar 

  17. Ghosh, P., Kundu, K., Sarkar, D.: Fuzzy graph representation of a fuzzy concept lattice. Fuzzy Sets Syst. 161(12), 1669–1675 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work has been partly supported by the French ANR LOGIMA project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Isabelle Bloch .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Bloch, I. (2017). Morphological Links Between Formal Concepts and Hypergraphs. In: Angulo, J., Velasco-Forero, S., Meyer, F. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2017. Lecture Notes in Computer Science(), vol 10225. Springer, Cham. https://doi.org/10.1007/978-3-319-57240-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57240-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57239-0

  • Online ISBN: 978-3-319-57240-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics