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}
}

• Y. G. Sucahyo, R. Gopalan
• Published in FIMI 2004
• Computer Science

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

View Paper

sunsite.informatik.rwth-aachen.de

Save to Library

Create Alert

Cite

Launch Research Feed