COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
- Mohammad El-Hajj
- Osmar R. Zaiane, University of Alberta (Database)
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 min using a compact memory based data structures. Second, for each frequent item assigned, a relatively small independent tree is built summarizing co-occurrences. Third, clever pruning reduces the search space drastically. Finally, a simple and non-recursive mining process reduces the memory requirements as minimum candidacy generation and counting is needed to generate all relevant frequent patterns.
Citation
M. El-Hajj, O. Zaiane. "COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation". Workshop on Frequent Itemset Mining Implementations (FIMI), pp n/a, November 2003.| Keywords: | |
| Category: | In Workshop |
BibTeX
@misc{El-Hajj+Zaiane:FIMI03,
author = {Mohammad El-Hajj and Osmar R. Zaiane},
title = {COFI-tree Mining: A New Approach to Pattern Growth with Reduced
Candidacy Generation},
Pages = {n/a},
booktitle = {Workshop on Frequent Itemset Mining Implementations (FIMI)},
year = 2003,
}Last Updated: February 04, 2020Submitted by Sabina P
