Loading...
A combination approach to frequent itemsets mining
Author(s)
Sahaphong, Supatra
Boonjing, Veera
Date Issued
December 29, 2008
Type
Conference Paper
Abstract
In this paper, we propose a new mining of frequent itemsets algorithm, called SFI-mine algorithm. The SFI-mine constructs pattern-base by using a new method which is different from the conditional patternbase in FP-growth, mines frequent itemsets with a new combination method without recursive construction of conditional FP-trees. It obtains complete and correct frequent itemsets. We have conducted the examples of all definitions and correctness proving. © 2008 IEEE.
Citation
Proceedings 3rd International Conference on Convergence and Hybrid Information Technology Iccit 2008, 1, 565-570, 2008