Abstract
In this paper we justify the need for a generalisation of Formal Concept Analysis for the purpose of data mining and begin the synthesis of such theory. For that purpose, we first review semirings and semimodules over semirings as the appropriate objects to use in abstracting the Boolean algebra and the notion of extents and intents, respectively. We later bring to bear powerful theorems developed in the field of linear algebra over idempotent semimodules to try to build a Fundamental Theorem for \(\mathcal{K}\)-Formal Concept Analysis , where \(\mathcal{K}\) is a type of idempotent semiring. Finally, we try to put Formal Concept Analysis in new perspective by considering it as a concrete instance of the theory developed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baccelli, F., Cohen, G., Olsder, G., Quadrat, J.: Synchronization and Linearity. Wiley, Chichester (1992)
Belohlávek, R.: Lattices generated by binary fuzzy relations. In: Int. Conf. on Fuzzy Set Theory and Applications, Slovakia (1998)
Blyth, T., Janowitz, M.: Residuation Theory. Pergamon Press, Oxford (1972)
Burusco, A., Fuentes-González, R.: The study of the l-fuzzy concept lattice. Mathware and Soft Computing 1(3), 209–218 (1994)
Cohen, G., Gaubert, S., Quadrat, J.-P.: Duality and separation theorems in idempotent semimodules. Linear Algebra and Its Applications 379, 395–422 (2004)
Davey, B., Priestley, H.: Introduction to lattices and order, 2nd edn. Cambridge University Press, Cambridge (2002)
Denecke, K., Erné, M., Wismath, S. (eds.): Galois Connections and Applications. Mathematics and Its Applications, vol. 565. Kluwer Academic, Dordrecht (2004)
Erné, M.: Adjunctions and Galois connections: Origins, History and Development. In: Denecke, et al. [7], pp. 1–138 (2004)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Gaubert, S.: Two lectures on max-plus algebra. Support de cours de la 26–iéme École de Printemps d’Informatique Théorique (May 1998), http://amadeus.inria.fr/gaubert/papers.html
Gaubert, S., the Maxplus Group: Methods and applications of (max, +) linear algebra. Technical Report 3088, INRIA (1997)
Gediga, G., Düntsch, I.: Approximation operators in qualitative data analysis. Technical Report CS-03-01, Department of Computer Science, Brock University, St. Catharines, Ontario, Canada (May 2003)
Golan, J.S.: Power Algebras over Semirings. With Applications in Mathematics and Computer Science. Mathematics and its applications, vol. 488. Kluwer Academic, Dordrecht (1999)
Golan, J.S.: Semirings and Their Applications. Kluwer Academic Publishers, Dordrecht (1999)
Wagneur, E.: Moduloïds and pseudomodules 1. dimension theory. Discrete Mathematics 98, 57–73 (1991)
Wille, R.: Dyadic Mathematics – Abstractions from Logical Thought. In: Denecke, et al. [7], pp. 453–498 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valverde-Albacete, F.J., Peláez-Moreno, C. (2006). Towards a Generalisation of Formal Concept Analysis for Data Mining Purposes. In: Missaoui, R., Schmidt, J. (eds) Formal Concept Analysis. Lecture Notes in Computer Science(), vol 3874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671404_11
Download citation
DOI: https://doi.org/10.1007/11671404_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32203-0
Online ISBN: 978-3-540-32204-7
eBook Packages: Computer ScienceComputer Science (R0)