Knowledge cores in large formal contexts

DOI10.1007/S10472-022-09790-6zbMATH Open1505.68041arXiv2002.11776OpenAlexW3007361619MaRDI QIDQ2149803FDOQ2149803

Authors: Tom Hanika, Johannes Hirth 

Publication date: 29 June 2022

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Abstract: Knowledge computation tasks are often infeasible for large data sets. This is in particular true when deriving knowledge bases in formal concept analysis (FCA). Hence, it is essential to come up with techniques to cope with this problem. Many successful methods are based on random processes to reduce the size of the investigated data set. This, however, makes them hardly interpretable with respect to the discovered knowledge. Other approaches restrict themselves to highly supported subsets and omit rare and interesting patterns. An essentially different approach is used in network science, called $k$-cores. These are able to reflect rare patterns if they are well connected in the data set. In this work, we study $k$-cores in the realm of FCA by exploiting the natural correspondence to bi-partite graphs. This structurally motivated approach leads to a comprehensible extraction of knowledge cores from large formal contexts data sets.

Full work available at URL: https://arxiv.org/abs/2002.11776

Recommendations

• Using congruence relations to extract knowledge from concept lattices
• Using fringes for minimal conceptual decomposition of binary contexts
• \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality
• A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data
• Formal Concept Analysis with Constraints by EM Operators

zbMATH Keywords

latticesformal concept analysisbipartite graphsknowledge basesimplicationsFCAk-cores

Mathematics Subject Classification ID

Knowledge representation (68T30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Smallest-last ordering and clustering and graph coloring algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two basic algorithms in concept analysis
• Computing iceberg concept lattices with Titanic
• On the intractability of computing the Duquenne-Guigues base
• On the complexity of enumerating pseudo-intents
• On the Merge of Factor Canonical Bases
• ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS
• Characterization of Graphs Using Degree Cores
• Discovering implicational knowledge in Wikidata
• Finding Robust Itemsets under Subsampling

Cited In (4)

• Title not available (Why is that?)
• Scaling dimension
• Ordinal motifs in lattices
• Conceptual views on tree ensemble classifiers

Uses Software

• UCI-ml
• ConExp

This page was built for publication: Knowledge cores in large formal contexts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149803)