Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

A New Clustering Algorithm for Transaction Data via Caucus

Jinmei XuContact Information, Hui XiongContact Information, Sam Yuan SungContact Information and Vipin KumarContact Information

(5)  Department of Computer Science, National University of Singapore, Kent Ridge, 117543, Singapore
(6)  Department of Computer Science, University of Minnesota-Twin Cities, Minneapolis, MN 55455, USA
Abstract
The fast-growing large point of sale databases in stores and companies sets a pressing need for extracting high-level knowledge. Transaction clustering arises to receive attentions in recent years. However, traditional clustering techniques are not useful to solve this problem. Transaction data sets are different from the traditional data sets in their high dimensionality, sparsity and a large number of outliers. In this paper we present and experimentally evaluate a new efficient transaction clustering technique based on cluster of buyers called caucus that can be effectively used for identification of center of cluster. Experiments on real and synthetic data sets indicate that compare to prior work, caucus-based method can derive clusters of better quality as well as reduce the execution time considerably.

Contact Information Jinmei Xu
Email: xujinmei@comp.nus.edu.sg

Contact Information Hui Xiong
Email: huix@cs.umn.edu

Contact Information Sam Yuan Sung
Email: ssung@comp.nus.edu.sg

Contact Information Vipin Kumar
Email: kumar@cs.umn.edu
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.108 • Server: mpweb03
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)