Moduloi¨ds and pseudomodules 1.: dimension theory
Discrete Mathematics
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Methods and Applications of (MAX, +) Linear Algebra
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Towards a generalisation of formal concept analysis for data mining purposes
ICFCA'06 Proceedings of the 4th 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
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 [1] a generalisation of Formal Concept Analysis was introduced with data mining applications in mind, κ-Formal Concept Analysis, where incidences take values in certain kinds of semirings, instead of the standard Boolean carrier set. A fundamental result was missing there, namely the second half of the equivalent of the main theorem of Formal Concept Analysis. In this continuation we introduce the structural lattice of such generalised contexts, providing a limited equivalent to the main theorem of κ-Formal Concept Analysis which allows to interpret the standard version as a privileged case in yet another direction. We motivate our results by providing instances of their use to analyse the confusion matrices of multiple-input multiple-output classifiers.