Corpus ID: 6445710

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
  • 14
  • Highly Influenced
  • PDF
F-Miner: A New Frequent Itemsets Mining Algorithm
  • 11
Mining Frequent Patterns based on Compressed FP-tree without Conditional FP-tree Generation
  • 4
NCFP-tree: A Non-Recursive Approach to CFP-tree using Single Conditional Database
  • 2
Efficient mining frequent itemsets algorithms
  • 23
On a Parallel Spark Workflow for Frequent Itemset Mining Based on Array Prefix-Tree
  • 2
EFFICIENTLY MINING FREQUENT ITEMSETS IN TRANSACTIONAL DATABASES
  • 1
  • Highly Influenced
  • PDF
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets
  • 48
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 29 REFERENCES
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
  • 52
  • PDF
Mining frequent patterns without candidate generation
  • 5,213
  • Highly Influential
  • PDF
Mining frequent item sets by opportunistic projection
  • 221
  • Highly Influential
  • PDF
H-mine: hyper-structure mining of frequent patterns in large databases
  • 469
  • Highly Influential
  • PDF
CHARM: An Efficient Algorithm for Closed Itemset Mining
  • 1,119
  • PDF
Mining frequent patterns with counting inference
  • 340
  • PDF
LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets
  • 187
  • Highly Influential
  • PDF
Mining sequential patterns
  • R. Agrawal, R. Srikant
  • Computer Science
  • Proceedings of the Eleventh International Conference on Data Engineering
  • 1995
  • 5,725
  • PDF
kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets
  • 75
  • Highly Influential
  • PDF
...
1
2
3
...