scholar.google.com › citations
The clusters, called formal concepts, are naturally interpreted as human-perceived concepts in a traditional sense and can be partially ordered by a subconcept- ...
This paper presents a preliminary study in which the problem of how further information additionally supplied with the object- attribute data table can be ...
[PDF] Trees in Class-Oriented Concept Lattices Constrained by ...
www.naturalspublishing.com › dow...
This paper presents conditions for input data which are necessary and sufficient for the output class-oriented concept lattice constrained by equivalence ...
2 Concept lattices constrained by systems of partitions generated from data. Constraints by equivalence relations A considerabe problem of FCA is a possibly.
Trees in Class-Oriented Concept Lattices Constrained by ...
www.semanticscholar.org › paper › Tree...
Trees in Class-Oriented Concept Lattices Constrained by Equivalence Relations · H. Mao · Published 2017 · Mathematics · Mathematical Sciences Letters.
People also ask
What are the 3 conditions of equivalence relation?
What is a concept lattice?
Aug 15, 2021 · In this paper, we consider a special kind of equivalence relation to reduce concept lattices, which will be called local congruence.
Equivalence relations enable the classification of elements within lattices by grouping them into equivalence classes based on shared properties. This ...
Missing: Constrained | Show results with:Constrained
Apr 12, 2012 · If D is a set of equivalence relations on X, then ∩D is the smallest equivalence relation on X which is contained in every member of D.
Missing: Concept | Show results with:Concept
Equivalence relations basically generalize the identity re- lation. Technically, the definition of an equivalence relation is obtained from the definition of a ...
Sep 24, 2024 · This equivalence relation is based on the notion of congruence on lattices, with the goal of losing as less information as possible and being ...