COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation

@inproceedings{Zaane2003COFItreeMA,
  title={COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation},
  author={Osmar R. Za{\"i}ane and Mohammad El-Hajj},
  booktitle={FIMI},
  year={2003}
}
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk scans, (2) the huge computation involved during the candidacy generation, and (3) the high memory dependency. This paper presents the implementation of our frequent itemset mining algorithm, COFI, which achieves its efficiency by applying four new ideas. First, it can mine using a compact memory based data structures… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

Memory boosting for pattern growth approach

2014 International Conference on Information Science, Electronics and Electrical Engineering • 2014

An efficient approach for updating the structure for mining frequent patterns

2012 IEEE International Conference on Industrial Engineering and Engineering Management • 2012

Mining frequent patterns from incremental databases

2011 International Conference on Machine Learning and Cybernetics • 2011
View 1 Excerpt

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…