Concept Lattices
From MaRDI portal
Publication:5901760
DOI10.1007/b95548zbMath1198.68251OpenAlexW4229975786MaRDI QIDQ5901760
Dean van der Merwe, Sergei Obiedkov, Derrick G. Kourie
Publication date: 14 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95548
Nonnumerical algorithms (68W05) Knowledge representation (68T30) Software, source code, etc. for problems pertaining to ordered structures (06-04)
Related Items (16)
Comparison of reduction in formal decision contexts ⋮ Attribute-incremental construction of the canonical implication basis ⋮ Improving the performance of Lindig-style algorithms with empty intersections ⋮ Dichotomic lattices and local discretization for Galois lattices ⋮ Formal concept analysis for the generation of plural referring expressions ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections ⋮ Probabilistic generalization of formal concepts ⋮ A semantic approach to concept lattice-based information retrieval ⋮ Approximating concept stability using variance reduction techniques ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ \textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns ⋮ An incremental algorithm to construct a lattice of set intersections ⋮ On Neural Network Architecture Based on Concept Lattices ⋮ AddIntent ⋮ Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis
Uses Software
This page was built for publication: Concept Lattices
