Skip to main content

The Linear Algebra in Extended Formal Concept Analysis Over Idempotent Semifields

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

Abstract

We report on progress relating \(\mathcal K\)-valued FCA to \(\mathcal K\)-Linear Algebra where \(\mathcal K\) is an idempotent semifield. We first find that the standard machinery of linear algebra points to Galois adjunctions as the preferred construction, which generates either Neighbourhood Lattices of attributes or objects. For the Neighbourhood of objects we provide the adjoints, their respective closure and interior operators and the general structure of the lattices, both of objects and attributes. Next, these results and those previous on Galois connections are set against the backdrop of Extended Formal Concept Analysis. Our results show that for a \(\mathcal K\)-valued formal context (GMR)—where \(|G| = g\), \(|M| = m\) and \(R \in K^{g\times {m}}\)—there are only two different “shapes” of lattices each of which comes in four different “colours”, suggesting a notion of a 4-concept associated to a formal concept. Finally, we draw some conclusions as to the use of these as data exploration constructs, allowing many different “readings” on the contextualized data.

C. Peláez-Moreno—FVA and CPM have been partially supported by the Spanish Government-MinECo projects TEC2014-53390-P and TEC2014-61729-EXP for this work.

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

Access this chapter

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

Notes

  1. 1.

    The notation follows the more developed one in [5].

  2. 2.

    With a little abuse of the terms “extent” and “intent”.

References

  1. Valverde-Albacete, F.J., Peláez-Moreno, C.: Towards a generalisation of formal concept analysis for data mining purposes. In: Missaoui, R., Schmidt, J. (eds.) ICFCA 2006. LNCS, vol. 3874, pp. 161–176. Springer, Heidelberg (2006). doi:10.1007/11671404_11

    Chapter  Google Scholar 

  2. Valverde-Albacete, F.J., Peláez-Moreno, C.: Further Galois connections between semimodules over idempotent semirings. In: Diatta, J., Eklund, P. (eds.) Proceedings of the 4th Conference on Concept Lattices and Applications (CLA 2007), Montpellier, France, pp. 199–212 (2007)

    Google Scholar 

  3. Valverde-Albacete, F.J., Peláez-Moreno, C.: Extending conceptualisation modes for generalised formal concept analysis. Inf. Sci. 181, 1888–1909 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  4. Valverde-Albacete, F.J., Peláez-Moreno, C.: The linear algebra in formal concept analysis over idempotent semifields. In: Baixeries, J., Sacarea, C., Ojeda-Aciego, M. (eds.) ICFCA 2015. LNCS, vol. 9113, pp. 97–113. Springer, Cham (2015). doi:10.1007/978-3-319-19545-2_6

    Chapter  Google Scholar 

  5. Valverde-Albacete, F.J., Peláez-Moreno, C.: K-formal concept analysis as linear algebra over idempotent semifields (2017). Submitted

    Google Scholar 

  6. Strang, G.: The fundamental theorem of linear algebra. Am. Math. Mon. 100, 848–855 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cuninghame-Green, R.: Minimax Algebra. LNEMS, vol. 166. Springer, Heidelberg (1979)

    MATH  Google Scholar 

  8. Gaubert, S.: Two lectures on max-plus algebra. Support de cours de la 26-iéme École de Printemps d’Informatique Théorique (1998). http://amadeus.inria.fr/gaubert/papers.html

  9. Butkovič, P.: Max-Linear Systems: Theory and Algorithms. Springer Monographs in Mathematics. Springer, Heidelberg (2010)

    Book  MATH  Google Scholar 

  10. Düntsch, I., Gediga, G.: Modal-style operators in qualitative data analysis. In: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002, pp. 155–162 (2002)

    Google Scholar 

  11. Deiters, K., Erné, M.: Negations and contrapositions of complete lattices. Discrete Math. 181, 91–111 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Wille, R.: Finite distributive lattices as concept lattices. Atti Inc. Logica Math. 2, 635–648 (1985)

    MathSciNet  MATH  Google Scholar 

  13. Reuter, K.: The jump number and the lattice of maximal antichains. Discrete Math. 88, 289–307 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  14. Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Ordered Sets (Banff, Alta 1981), Reidel, pp. 445–470 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Francisco José Valverde-Albacete .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Valverde-Albacete, F.J., Peláez-Moreno, C. (2017). The Linear Algebra in Extended Formal Concept Analysis Over Idempotent Semifields. In: Bertet, K., Borchmann, D., Cellier, P., Ferré, S. (eds) Formal Concept Analysis. ICFCA 2017. Lecture Notes in Computer Science(), vol 10308. Springer, Cham. https://doi.org/10.1007/978-3-319-59271-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59271-8_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59270-1

  • Online ISBN: 978-3-319-59271-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics