Knowledge cores in large formal contexts

DOI10.1007/s10472-022-09790-6zbMath1505.68041arXiv2002.11776OpenAlexW3007361619MaRDI QIDQ2149803

Tom Hanika, Johannes Hirth

Publication date: 29 June 2022

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

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

zbMATH Keywords

bipartite graphslatticesformal concept analysisknowledge basesimplicationsFCAk-cores

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items (3)

Conceptual views on tree ensemble classifiers ⋮ Scaling dimension ⋮ Ordinal motifs in lattices

Uses Software

• UCI-ml
• ConExp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of enumerating pseudo-intents
• Discovering implicational knowledge in Wikidata
• Characterization of Graphs Using Degree Cores
• ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS
• Two Basic Algorithms in Concept Analysis
• Smallest-last ordering and clustering and graph coloring algorithms
• Computing iceberg concept lattices with Titanic
• Finding Robust Itemsets under Subsampling
• On the Merge of Factor Canonical Bases

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