Galois connections between semimodules and applications in data mining
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Towards a generalisation of formal concept analysis for data mining purposes
ICFCA'06 Proceedings of the 4th 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
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 [13] a generalisation of Formal Concept Analysis was introduced with data mining applications in mind, K-Formal Concept Analysis, where incidences take values in certain kinds of semirings, instead of the standard Boolean carrier set. Subsequently, the structural lattice of such generalised contexts was introduced in [15], to provide a limited equivalent to the main theorem of K-Formal Concept Analysis, resting on a crucial parameter, the degree of existence of the objectattribute pairs φ. In this paper we introduce the spectral lattice of a concrete instance of K-Formal Concept Analysis, as a further means to clarify the structural and the K-Concept Lattices and the choice of φ. Specifically, we develop techniques to obtain the join- and meet-irreducibles of a Rmax,+-Concept Lattice independently of φ and try to clarify its relation to the corresponding structural lattice.