Formal Contexts, Formal Concept Analysis, and Galois Connections

  title={Formal Contexts, Formal Concept Analysis, and Galois Connections},
  author={Jeffrey T. Denniston and Austin Melton and Stephen Ernest Rodabaugh},
  booktitle={Festschrift for Dave Schmidt},
Formal concept analysis (FCA) is built on a special type of Galois connections called polarities. We present new results in formal concept analysis and in Galois connections by presenting new Galois connection results and then applying these to formal concept analysis. We also approach FCA from the perspective of collections of formal contexts. Usually, when doing FCA, a formal context is fixed. We are interested in comparing formal contexts and asking what criteria should be used when… 
Relational Connections Between Preordered Sets
This paper focuses on the relational generalization of the notion of Galois connection in the theory of Formal Concept Analysis.
A Relational Extension of Galois Connections
The notion of relational Galois connection between two transitive digraphs is introduced, some of its properties are studied and its relationship with other existing approaches in the literature is studied.
Towards fuzzy relational Galois connections between fuzzy T-digraphs
In this paper, we give the first steps towards a formal definition of fuzzy relational Galois connection between fuzzy sets with arbitrary fuzzy transitive relations (fuzzy T-digraphs), where the two
Relation-based Galois connections: towards the residual of a relation
Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Aciego, Relation-based Galois connections: towards the residual of a relation, CMMSE 2017: Proceedings of the 17th International Conference on
Galois Connections Between Unbalanced Structures in a Fuzzy Framework
This paper surveys recent results obtained in the construction of Galois connections between unbalanced structures, focusing specially on fuzzy structures that have been considered so far: fuzzy preposets, fuzzy preordered structures, and fuzzy T-digraphs.
On the Existence of Right Adjoints for Surjective Mappings between Fuzzy Structures
This paper focuses on the fuzzy case in which the authors have a fuzzy ordering ρA on A and a surjective mapping f : 〈A,≈A〉 → 〉B,≉B〉 compatible with respect to the fuzzy equivalences ≈A and ≈B .
Formal Concept Analysis for Semantic Compression of Knowledge Graph Versions
This article describes a novel method that relies on aggregating graph versions to obtain one single complete graph and semantically compresses similar and common edges together to obtain a final graph smaller than the sum of the distinct versioned ones.
Measuring Innovation and Innovativeness - A Data-Mining Approach
A new output-based approach to measure innovation in goods and services is proposed that draws on formal context and concept analysis and can reveal innovation patterns and thereby support rigorous prescriptions for innovation management.


A Primer on Galois Connections
The rudiments of the theory of Galois connections (or residuation theory, as it is sometimes called) are provided, together with many examples and applications, that can be used as an effective research tool throughout mathematics and related areas.
Formal concept analysis and lattice-valued Chu systems
A Category of Galois Connections
One of the categories—the one which is the most closely related to the closed and open elements of the Galois connections—is Cartesian-closed.
Formal Concept Analysis: foundations and applications
This book discusses Formal Concept Analysis as Mathematical Theory of Concepts and Concept Hierarchies as well as applications for Software Analysis and Modelling, and the ToscanaJ Suite for Implementing Conceptual Information Systems.
Semiconcept and Protoconcept Algebras: The Basic Theorems
The main results of this paper are the two basic theorems which characterize semiconcept resp.
Calois Connections and Computer Science Applications
The proof of correctness of an implementation follows simply from the construction of a Galois insertion, and further applications of Galois connections theory to computing-related problems are planned.
Efficient Data Mining Based on Formal Concept Analysis
It is shown that iceberg concept lattices are a starting point for computing condensed sets of association rules without loss of information, and are a visualization method for the resulting rules.
Lessons Learned in Applying Formal Concept Analysis
This paper describes the approach, outlines three case studies, and discusses how the approach is applied iteratively in order to draw the maximum benefit offered by FCA.
Lattice Theory, first edition
  • American Mathematical Society Colloqui um Publications
  • 1940