Publication:
Towards a generalisation of formal concept analysis for data mining purposes

Thumbnail Image
Identifiers
URI: https://hdl.handle.net/10016/1595
ISSN: 0302-9743 [print]
ISSN: 1611-3349 [online]
ISBN: 978-3-540-32203-0
DOI: 10.1007/11671404_11
Files
valverde01.pdf (268.6 KB)
Publication date
2006
Defense date
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
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 K-Formal Concept Analysis, where 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.
Description
Keywords
Bibliographic citation
Formal Concept Analysis. 4th International Conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006. Proceedings. PP. 161-176
Collections
DTSC - GPM - Capítulos de Monografías