Sciweavers

Share
FIMI
2004

LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets

12 years 1 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other frequent itemset, and closed if P is included in no other itemset included in the exactly same transactions as P. The problems of finding these frequent itemsets are fundamental in data mining, and from the applications, fast implementations for solving the problems are needed. In this paper, we propose efficient algorithms LCM (Linear time Closed itemset Miner), LCMfreq and LCMmax for these problems. We show the efficiency of our algorithms by computational experiments compared with existing algorithms.
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2004
Where FIMI
Authors Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
Comments (0)
books