A partition-based approach towards constructing Galois (concept) lattices
From MaRDI portal
Publication:1849987
DOI10.1016/S0012-365X(02)00349-7zbMath1013.06007OpenAlexW2007327392MaRDI QIDQ1849987
P. Lebrun, Rokia Missaoui, Petko Valtchev
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00349-7
Complete lattices, completions (06B23) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Lattices (06B99)
Related Items
SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES ⋮ Relational concept discovery in structured datasets ⋮ A local approach to concept generation ⋮ Incremental Pseudo Rectangular Organization of Information Relative to a Domain ⋮ Relational concept analysis: mining concept lattices from multi-relational data ⋮ Constructing L-fuzzy concept lattices without fuzzy Galois closure operation ⋮ Formal concept analysis for the generation of plural referring expressions ⋮ Formal concept analysis based on the topology for attributes of a formal context ⋮ A framework for incremental generation of closed itemsets ⋮ Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory ⋮ On the Merge of Factor Canonical Bases ⋮ On the size of \(\exists \)-generalized concept lattices ⋮ Rule Validation of a Meta-classifier Through a Galois (Concept) Lattice and Complementary Means ⋮ Using congruence relations to extract knowledge from concept lattices ⋮ A representation of FS-domains by formal concept analysis
