Please use this identifier to cite or link to this item:
|Title:||A new clustering algorithm for transaction data via caucus|
|Citation:||Xu, J.,Xiong, H.,Sung, S.Y.,Kumar, V. (2003). A new clustering algorithm for transaction data via caucus. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) 2637 : 551-562. ScholarBank@NUS Repository.|
|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.|
|Source Title:||Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.