Advances in Frequent Itemset Mining Implementations: Introduction to FIMI03
Explore this paper's citation graph
Summary
Given the experimental, algorithmic nature of FIM (and most of data mining in general), it is crucial that other researchers be able to independently verify the claims made in a new paper, and the FIM community has a very poor track record in this regard.
- Type
- article
- Published
- 2003-01-01
- Cited by
- 102
- References
- 35
- OpenAlex
- https://openalex.org/W43825479
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:1140539
Keywords
Implementation, Computer science, Data mining, Data science, Software engineering
References
- Efficient frequent pattern mining
- A fast APRIORI implementation
- Galois Connections and Data Mining
- New Algorithms for Fast Discovery of Association Rules
- CHARM: An Efficient Algorithm for Closed Itemset Mining
- Fast Discovery of Association Rules
- An Efficient Algorithm for Mining Association Rules in Large Databases
- Sampling Large Databases for Association Rules
- Mining association rules: anti-skew algorithms
- Using association rules for product assortment decisions: a case study
- Turbo-charging vertical mining of large databases
- Real world performance of association rule algorithms
- An effective hash-based algorithm for mining association rules
- Dynamic itemset counting and implication rules for market basket data
- Mining frequent patterns without candidate generation
- Depth first generation of long patterns
- Towards long pattern generation in dense databases
- Fast vertical mining using diffsets
- Scalable Algorithms for Association Mining
- SmartMiner: a depth first algorithm guided by tail information for mining maximal frequent itemsets
Cited by
- Revealing Topic-based Relationship Among Documents using Association Rule Mining
- Toward more parallel frequent itemset mining algorithms
- Algorithmic Features of Eclat
- Spatio-Temporal Data Mining for Location-Based Services
- Réécriture de requêtes en termes de vues en présence de contraintes de valeurs pour un système d'intégration de sources de données agricoles. (Query rewriting using views in presence of value constraints for an integration system of agricultural data sources)
- Hybridization of Neighbourhood Search Metaheuristic with Data Mining Technique to Solve p-median P roblem
- A hybrid k-Mean-GRASP for partition based Clustering of two-dimensional data space as an application of p-median problem
- Mining association rules for clustered domains by separating disjoint sub-domains inLarge Databases
- Mining frequent itemsets from secondary memory
- A virtual reality-based approach for interactive and visual mining of association rules
- YAFIMA: Yet Another Frequent Itemset Mining Algorithm
- Unsupervised Learning for Gene Regulation Network Inference from Expression Data: A Review
- Surprising Results of Trie-based FIM Algorithms
- Extending the Hybridization of Metaheuristics with Data Mining to a Broader Domain
- Out-of-core frequent pattern mining on a commodity PC
- Issues in pattern mining and their resolutions
- Applications of the DM-GRASP heuristic: a survey
- Efficient pattern mining on shared memory systems: implications for chip multiprocessor architectures
- An FPGA-Based Accelerator for Frequent Itemset Mining
- Index-Maxminer: a New Maximal Frequent Itemset Mining Algorithm
Related papers
- Mining frequent patterns without candidate generation
- Fast Algorithms for Mining Association Rules
- Mining association rules between sets of items in large databases
- Efficiently Using Prefix-trees in Mining Frequent Itemsets
- Fast Algorithms for Mining Association Rules in Large Databases
- Scalable Algorithms for Association Mining
- CLOSET+: searching for the best strategies for mining frequent closed itemsets
- Efficiently mining long patterns from databases
- Sampling Large Databases for Association Rules