loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
25th Annual International Computer Software and Applications Conference (COMPSAC'01)
An Efficient Clustering Algorithm for Market Basket Data Based on Small Large Ratios
Chicago, Illinois
October 08-October 12
ISBN: 0-7695-1372-7
Ching-Huang Yun, National Taiwan University
Kun-Ta Chuang, National Taiwan University
Ming-Syan Chen, National Taiwan University
In this paper, we devise an efficient algorithm for clustering market-basket data items. In view of the nature of clustering market basket data, we devise in this paper a novel measurement, called the small-large (abbreviated as SL) ratio, and utilize this ratio to perform the clustering. With this SL ratio measurement, we develop an efficient clustering algorithm for data items to minimize the SL ratio in each group. The proposed algorithm not only incurs an execution time that is significantly smaller than that by prior work but also leads to the clustering results of very good quality.
Index Terms:
Data mining, clustering analysis, market-basket data, small-large ratios.
Citation:
Ching-Huang Yun, Kun-Ta Chuang, Ming-Syan Chen, "An Efficient Clustering Algorithm for Market Basket Data Based on Small Large Ratios," compsac, pp.505, 25th Annual International Computer Software and Applications Conference (COMPSAC'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.