A maximal frequent itemset algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6672129
- An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning
- scientific article; zbMATH DE number 2202222
- MAXFP-Miner: mining maximal frequent itemsets efficiently by using FP-tree
- scientific article; zbMATH DE number 2219521
Cited in
(20)- Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme
- An algebraic semigroup method for discovering maximal frequent itemsets
- Computational aspects of mining maximal frequent patterns
- Discovering frequent itemset with maximum time-window on temporal transaction database using variable neighborhood search
- Maximal frequent sets
- A novel bitmap-based algorithm for frequent itemsets mining
- scientific article; zbMATH DE number 6672129 (Why is no real title available?)
- Meta itemset: a new concise representation of frequent itemset
- A mining algorithm for fast maximal sequential patterns
- Mining maximal frequent itemsets using the ordered FP-tree
- An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning
- An efficient algorithm for mining frequent maximal and closed itemsets
- Maximum item first pattern growth for mining frequent patterns
- MaxDomino: Efficiently mining maximal sets
- SETM*-MaxK: An efficient SET-based approach to find the largest itemset
- scientific article; zbMATH DE number 2204015 (Why is no real title available?)
- Algorithm of mining frequent patterns based on the vertical bitmap
- MAXFP-Miner: mining maximal frequent itemsets efficiently by using FP-tree
- scientific article; zbMATH DE number 2219521 (Why is no real title available?)
- Mining maximal frequent patterns in transactional databases and dynamic data streams: a Spark-based approach
This page was built for publication: A maximal frequent itemset algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427023)