CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
@inproceedings{Sucahyo2004CTPROAB, title={CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure}, author={Y. G. Sucahyo and R. Gopalan}, booktitle={FIMI}, year={2004} }
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active research area and a large number of algorithms have been developed. In this paper, we propose another pattern growth algorithm which uses a more compact data structure named Compressed FP-Tree (CFP-Tree). The number of nodes in a CFP-Tree can be up to half less than in the corresponding FP-Tree. We also describe the… Expand
62 Citations
FP-Tree Based Algorithms Analysis: FP- Growth, COFI-Tree and CT-PRO
- Computer Science
- 2011
- 13
- Highly Influenced
- PDF
Modified FP-Growth: An Efficient Frequent Pattern Mining Approach from FP-Tree
- Computer Science
- PReMI
- 2019
F-Miner: A New Frequent Itemsets Mining Algorithm
- Computer Science
- 2006 IEEE International Conference on e-Business Engineering (ICEBE'06)
- 2006
- 11
Mining Frequent Patterns based on Compressed FP-tree without Conditional FP-tree Generation
- Computer Science
- 2006 IEEE International Conference on Granular Computing
- 2006
- 4
NCFP-tree: A Non-Recursive Approach to CFP-tree using Single Conditional Database
- Computer Science
- 2017
- 2
On a Parallel Spark Workflow for Frequent Itemset Mining Based on Array Prefix-Tree
- Computer Science
- 2019 IEEE/ACM Workflows in Support of Large-Scale Science (WORKS)
- 2019
- 1
Optimization of High Utility Itemset Mining from Large Transaction Databases on multi-core processor
- 2015
EFFICIENTLY MINING FREQUENT ITEMSETS IN TRANSACTIONAL DATABASES
- Computer Science
- 2016
- 1
- Highly Influenced
- PDF
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets
- Mathematics, Computer Science
- AIDM
- 2007
- 48
- PDF
References
SHOWING 1-10 OF 29 REFERENCES
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
- Computer Science
- ADC
- 2003
- 52
- PDF
Mining frequent patterns without candidate generation
- Computer Science
- SIGMOD '00
- 2000
- 5,195
- Highly Influential
- PDF
Mining frequent item sets by opportunistic projection
- Computer Science
- KDD
- 2002
- 221
- Highly Influential
- PDF
H-mine: hyper-structure mining of frequent patterns in large databases
- Computer Science
- Proceedings 2001 IEEE International Conference on Data Mining
- 2001
- 466
- Highly Influential
- PDF
LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets
- Mathematics, Computer Science
- FIMI
- 2003
- 186
- Highly Influential
- PDF
Mining sequential patterns
- Computer Science
- Proceedings of the Eleventh International Conference on Data Engineering
- 1995
- 5,709
- PDF
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
- Computer Science
- FIMI
- 2003
- 75
- Highly Influential
- PDF