Mathematical aspects of concept analysis

DOI10.1007/BF02362847zbMath0885.06001OpenAlexW2033895602MaRDI QIDQ676803

Sergei O. Kuznetsov

Publication date: 31 March 1998

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02362847

zbMATH Keywords

surveycomplexityalgorithmdecompositioncomplete latticesdata analysiscontextsconcept analysis

Mathematics Subject Classification ID

Complete lattices, completions (06B23) Lattices (06B99) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02)

Related Items (15)

On stability of a formal concept ⋮ Can triconcepts become triclusters? ⋮ Preclusivity and Simple Graphs ⋮ Dualization in lattices given by ordered sets of irreducibles ⋮ Three-way concept learning based on cognitive operators: an information fusion viewpoint ⋮ A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ Enumerating all maximal biclusters in numerical datasets ⋮ Decision implication canonical basis: a logical perspective ⋮ On Neural Network Architecture Based on Concept Lattices ⋮ Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis ⋮ On Algebraic Approach of R. Wille and B. Ganter in the Investigation of Texts ⋮ On the calculation of formal concept stability ⋮ On Shapley value interpretability in concept-based learning with formal concept analysis ⋮ A new kind of implication to reason with unknown information

Cites Work

• The complexity of computing the permanent
• Zur Kennzeichnung der Dedekind-MacNeilleschen Hülle einer geordneten Menge
• Subdirect decomposition of concept lattices
• On axiomatization of many-valued logics associated with formalization of plausible reasonings
• Tensorial decomposition of concept lattices
• Subdirect product construction of concept lattices
• A new result on the problem of Zarankiewicz
• The skeletons of free distributive lattices
• The computational complexity of abduction
• Concept lattices and conceptual knowledge systems
• A problem of Zarankiewicz
• Complexity in mechanized hypothesis formation
• Über ein Problem von K. Zarankiewicz
• Two Basic Algorithms in Concept Analysis
• Boolean concept lattices and good contexts
• The Complexity of Enumeration and Reliability Problems
• The Diclique Representation and Decomposition of Binary Relations
• Subdirekte Produkte vollständiger Verbände.
• Two improvements of a result concerning a problem of K. Zarankiewicz
• Subdirekte Produkte und konjunkte Summen.
• On a combinatorical problem of K. Zarankiewicz
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mathematical aspects of concept analysis