Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Lattices of Triadic Concept Graphs
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Associatively tied implications
Fuzzy Sets and Systems - Theme: Basic concepts
Information Sciences: an International Journal
Graphs, Dioids and Semirings: New Models and Algorithms (Operations Research/Computer Science Interfaces Series)
Formal concept analysis via multi-adjoint concept lattices
Fuzzy Sets and Systems
Residuated Lattices: An Algebraic Glimpse at Substructural Logics, Volume 151
Residuated Lattices: An Algebraic Glimpse at Substructural Logics, Volume 151
Multi-adjoint t-concept lattices
Information Sciences: an International Journal
Galois connections between semimodules and applications in data mining
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
The toscanaj suite for implementing conceptual information systems
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
Morphological associative memories
IEEE Transactions on Neural Networks
Systemic approach to fuzzy logic formalization for approximate reasoning
Information Sciences: an International Journal
Mining gene expression data with pattern structures in formal concept analysis
Information Sciences: an International Journal
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
Formal concept analysis based on fuzzy granularity base for different granulations
Fuzzy Sets and Systems
Formal query systems on contexts and a representation of algebraic lattices
Information Sciences: an International Journal
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
On galois connections and soft computing
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
Hi-index | 0.07 |
Formal Concept Analysis (FCA) is an exploratory data analysis technique for boolean relations based on lattice theory. Its main result is the existence of a dual order isomorphism between two set lattices induced by a binary relation between a set of objects and a set of attributes. Pairs of dually isomorphic sets of objects and attributes, called formal concepts, form a concept lattice, but actually model only a conjunctive mode of conceptualisation. In this paper we augment this formalism in two ways: first we extend FCA to consider different modes of conceptualisation by changing the basic dual isomorphism in a modal-logic motivated way. This creates the three new types of concepts and lattices of extended FCA, viz., the lattice of neighbourhood of objects, that of attributes and the lattice of unrelatedness. Second, we consider incidences with values in idempotent semirings-concretely the completed max-plus or schedule algebra R@?"m"a"x","+-and focus on generalising FCA to try and replicate the modes of conceptualisation mentioned above. To provide a concrete example of the use of these techniques, we analyse the performance of multi-class classifiers by conceptually analysing their confusion matrices.