Moduloi¨ds and pseudomodules 1.: dimension theory
Discrete Mathematics
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Galois connections between semimodules and applications in data mining
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Spectral lattices of Rmax,+-formal contexts
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Formal concept analysis in knowledge discovery: a survey
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
Extending conceptualisation modes for generalised Formal Concept Analysis
Information Sciences: an International Journal
Gene expression array exploration using K-formal concept analysis
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Detecting features from confusion matrices using generalized formal concept analysis
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
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.