Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset

DOI10.1016/J.IJAR.2021.12.012MaRDI QIDQ2671748zbMATH OpenOpenAlexFDO

Authors Tatiana Makhalova, Aleksey Buzmakov, 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

zbMATH Keywords

closed itemsetclosure structuredata topologyequivalence classitemset miningkey and passkey

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Mining closed patterns in relational, graph and network data
• Mining Association Rules from Tabular Data Guided by Maximal Frequent Itemsets
• A formal concept analysis approach to rough data tables
• A formal concept analysis approach to rough data tables
• Top-down mining of frequent closed patterns from very high dimensional data

Cites work

• A semantic approach to concept lattice-based information retrieval
• Approaches to the selection of relevant concepts in the case of noisy data
• Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
• Comparing performance of algorithms for generating concept lattices
• Comparison of data structures for computing formal concepts
• Computing iceberg concept lattices with Titanic
• Discovery Science
• Generating a condensed representation for association rules
• scientific article; zbMATH DE number 1696848 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• Interesting patterns
• Interface between logical analysis of data and formal concept analysis
• Lexicographic generation of ordered trees
• Listing closed sets of strongly accessible set systems with applications to data mining
• Looking for a structural characterization of the sparseness measure of (frequent closed) itemset contexts
• On coupling FCA and MDL in pattern mining
• On stability of a formal concept
• On the Complexity of Computing Generators of Closed Sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Partially Ordered Sets
• Scalable estimates of concept stability

Cited in

(2)

• Robot path planning based on concept lattice
• Three views on dependency covers from an FCA perspective

Describes a project that uses

Uses Software

• LCM

This page was built for publication: Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset

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