Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
From MaRDI portal
Publication:2671748
DOI10.1016/j.ijar.2021.12.012OpenAlexW4210968078MaRDI QIDQ2671748
Aleksey Buzmakov, Tatiana Makhalova, Sergei O. Kuznetsov, Amedeo Napoli
Publication date: 3 June 2022
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2021.12.012
Related Items (2)
Robot path planning based on concept lattice ⋮ Three views on dependency covers from an FCA perspective
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Listing closed sets of strongly accessible set systems with applications to data mining
- Lexicographic generation of ordered trees
- Generating a condensed representation for association rules
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
- Interface between logical analysis of data and formal concept analysis
- A semantic approach to concept lattice-based information retrieval
- On coupling FCA and MDL in pattern mining
- On stability of a formal concept
- Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts
- Interesting Patterns
- Approaches to the Selection of Relevant Concepts in the Case of Noisy Data
- Comparison of Data Structures for Computing Formal Concepts
- Comparing performance of algorithms for generating concept lattices
- Computing iceberg concept lattices with Titanic
- Scalable Estimates of Concept Stability
- On the Complexity of Computing Generators of Closed Sets
- Discovery Science
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Partially Ordered Sets
This page was built for publication: Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
