Top-down mining of frequent closed patterns from very high dimensional data
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2088104
- Frequent pattern mining from high-dimensional data using record space search
- scientific article; zbMATH DE number 2112391
- A new algorithm for mining frequent closed patterns in gene expression data sets
- Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data
Cites work
Cited in
(8)- Frequent pattern mining from high-dimensional data using record space search
- Opportunistic mining of top-\(n\) high utility patterns
- Mining closed patterns in relational, graph and network data
- CDPA: common and distinctive pattern analysis between high-dimensional datasets
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
- scientific article; zbMATH DE number 2088104 (Why is no real title available?)
- Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data
This page was built for publication: Top-down mining of frequent closed patterns from very high dimensional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007893)