Knowledge cores in large formal contexts
This paper deals with the problem of extracting useful knowledge from large relational data sets in the context of formal concept analysis (FCA). The problem here is that, on the one hand, extracting meaningful knowledge characterizing the given data set is computationally hard and, on the other hand, the approaches aimed at reducing the size of the data sets to be analysed (so as to make knowledge extraction computationally feasible) bring the indirect negative consequences of either returning patterns that are hardly interpretable or limiting discovered knowledge to highly supported patterns, thus possibly missing interesting but rare ones. This paper proposes a new approach based on exploiting the concept of networks' \(k\)-cores. In particular, the paper first introduces the notion of \(k\)-core in the context of formal concept analysis and then uses the thus defined formal gadget to obtain techniques for knowledge extraction from large relational data sets. Experiments are also provided to demonstrate the validity of the presented approach.
- 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
- Characterization of Graphs Using Degree Cores
- Computing iceberg concept lattices with Titanic
- Discovering implicational knowledge in Wikidata
- Finding robust itemsets under subsampling
- scientific article; zbMATH DE number 3771669 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1945867 (Why is no real title available?)
- scientific article; zbMATH DE number 7635224 (Why is no real title available?)
- ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS
- On the complexity of enumerating pseudo-intents
- On the intractability of computing the Duquenne-Guigues base
- On the Merge of Factor Canonical Bases
- Smallest-last ordering and clustering and graph coloring algorithms
- Two basic algorithms in concept analysis
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)