loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Workshop on Intelligent Information Technology Application (IITA 2007)
A New Algorithm Finding Frequent Itemsets Based on Minimum Separating into Buckets
Zhang Jiajia, China
December 02-December 03
ISBN: 0-7695-3063-X
ASCII Text
x 
 
Zhou Qihai, Chen Yongming, Wu Hongyu, "A New Algorithm Finding Frequent Itemsets Based on Minimum Separating into Buckets," Intelligent Information Technology Applications, 2007 Workshop on, pp. 38-42, Workshop on Intelligent Information Technology Application (IITA 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/IITA.2007.79,
author = {Zhou Qihai and Chen Yongming and Wu Hongyu},
title = {A New Algorithm Finding Frequent Itemsets Based on Minimum Separating into Buckets},
journal ={Intelligent Information Technology Applications, 2007 Workshop on},
volume = {0},
year = {2007},
isbn = {0-7695-3063-X},
pages = {38-42},
doi = {http://doi.ieeecomputersociety.org/10.1109/IITA.2007.79},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Intelligent Information Technology Applications, 2007 Workshop on
TI - A New Algorithm Finding Frequent Itemsets Based on Minimum Separating into Buckets
SN - 0-7695-3063-X
SP38
EP42
A1 - Zhou Qihai,
A1 - Chen Yongming,
A1 - Wu Hongyu,
PY - 2007
KW - null
VL - 0
JA - Intelligent Information Technology Applications, 2007 Workshop on
ER -
 
In this paper, we point out two main shortcomings of a conventional hash algorithm used for finding frequent itemsets in data mining excavate routine Hash algorithm: 1) it is difficult to choose a suitable hash function; 2) it is easy to lead to a hash conflict. In order to overcome these shortcomings, a new algorithm which can separate into buckets and can suit dynamically the practical need of finding frequent itemsets is advanced, which has a reaction ability to any itemsets according to need and does not look for any hash function and does not lead to any hash conflict. At the same time, the directions for further improving and razing the efficiency of this new algorithm are given.
Citation:
Zhou Qihai, Chen Yongming, Wu Hongyu, "A New Algorithm Finding Frequent Itemsets Based on Minimum Separating into Buckets," iita, pp.38-42, Workshop on Intelligent Information Technology Application (IITA 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.