This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Conference on Innovative Computing, Information and Control - Volume II (ICICIC'06)
Frequent Itemset Mining Based on Heuristic Two Level Counting
Beijing, China
August 30-September 01
ISBN: 0-7695-2616-0
Feng Liu, Beijing University of Posts and Telecommunications, China
FengZhan Tian, Beijing Jiaotong University, China
QiLiang Zhu, Beijing University of Posts and Telecommunications, China
Recently, many enchanced Apriori algorithms have been proposed to efficiently generate all frequent itemsets from datasets in data mining field. Although efficient techniques were presented, those algorithms are either time-consuming or memory-consuming. To address the issue further, a new algorithm, which introduced a novel support counting method, Heuristic Two Level Counting, is proposed. HTLC method adopts an improved itemset generating technology in the generation process of low level itemsets, which promotes the production of low level frequent itemsets or candidate itemsets. It also applies a heuristic traversal technology which speeds up one pass over datasets and support counting technology which largely reduces the number of passes over datasets to the generation of high level frequent itemsets. Finally, the experimental results show that it outperforms existing Apriori-like algorithms in mostly datasets.
Citation:
Feng Liu, FengZhan Tian, QiLiang Zhu, "Frequent Itemset Mining Based on Heuristic Two Level Counting," icicic, vol. 2, pp.640-643, First International Conference on Innovative Computing, Information and Control - Volume II (ICICIC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.