scientific article; zbMATH DE number 2219521
From MaRDI portal
Publication:5698263
Recommendations
- scientific article; zbMATH DE number 1983139
- An improved algorithm based on sets operation for mining frequent itemsets
- scientific article; zbMATH DE number 6672129
- An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning
- A fast algorithm for mining association rules
Cited in
(17)- Efficient automatic discovery of `hot' itemsets
- A new algorithm for fast mining frequent itemsets using N-lists
- An algorithm for mining association rules with multiple minimum supports
- An improved algorithm based on sets operation for mining frequent itemsets
- An efficient algorithm for mining frequent maximal and closed itemsets
- scientific article; zbMATH DE number 1954170 (Why is no real title available?)
- scientific article; zbMATH DE number 1964830 (Why is no real title available?)
- scientific article; zbMATH DE number 1983139 (Why is no real title available?)
- scientific article; zbMATH DE number 2033276 (Why is no real title available?)
- scientific article; zbMATH DE number 2088101 (Why is no real title available?)
- scientific article; zbMATH DE number 2112477 (Why is no real title available?)
- An efficient procedure for mining statistically significant frequent itemsets
- A fast algorithm for mining frequent fuzzy itemsets
- Fast FP-growth for association rule mining
- A fast algorithm for mining association rules
- Parametric algorithms for mining share frequent itemsets
- A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5698263)
