Using congruence relations to extract knowledge from concept lattices

DOI10.1016/j.dam.2016.11.021zbMath1398.68523OpenAlexW2560135924MaRDI QIDQ1800395

Jean-François Viaud, Karell Bertet, Christophe Demko, Rokia Missaoui

Publication date: 23 October 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.11.021

zbMATH Keywords

formal concept analysiscongruence relationsubdirect decompositionconcept latticedoubling convex constructionimplication system

Mathematics Subject Classification ID

Knowledge representation (68T30) Lattice ideals, congruence relations (06B10)

Related Items (2)

Factorizing lattices by interval relations ⋮ Reducing concept lattices by means of a weaker notion of congruence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Discovery of the \(D\)-basis in binary tables based on hypergraph dualization
• On implicational bases of closure systems with unique critical sets.
• Subdirect decomposition of concept lattices
• Doubling convex sets in lattices and a generalized semidistributivity condition
• Computing congruences efficiently
• Subdirect product construction of concept lattices
• Splitting lattices generate all lattices
• Congruence normality: The characterization of the doubling class of convex sets
• The generalized doubling construction and formal concept analysis
• A partition-based approach towards constructing Galois (concept) lattices
• Alan Day's doubling construction
• Ordered direct implicational basis of a finite closure system
• Attribute-incremental construction of the canonical implication basis
• Lattice Theory: Foundation
• Lattice Drawings and Morphisms
• Two Basic Algorithms in Concept Analysis
• Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
• Subdirekte Produkte vollständiger Verbände.
• Computing congruence lattices of finite lattices
• On the Merge of Factor Canonical Bases
• Unique Factorization Theorem and Formal Concept Analysis
• A Simple Solution to the Word Problem for Lattices
• Subdirekte Produkte und konjunkte Summen.

This page was built for publication: Using congruence relations to extract knowledge from concept lattices