A new clustering algorithm for transaction data via caucus

Jinmei Xu; Hui Xiong; Sam Yuan Sung; Vipin Kumar

doi:10.1007/3-540-36175-8_55

A new clustering algorithm for transaction data via caucus

Jinmei Xu, Hui Xiong, Sam Yuan Sung, Vipin Kumar

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Scopus citations

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.

Original language	English (US)
Title of host publication	Advances in Knowledge Discovery and Data Mining
Editors	Kyu-Young Wang, Jongwoo Jeon, Kyuseok Shim, Jaideep Srivastava
Publisher	Springer Verlag
Pages	551-562
Number of pages	12
ISBN (Electronic)	3540047603, 9783540047605
DOIs	https://doi.org/10.1007/3-540-36175-8_55
State	Published - 2003
Event	7th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2003 - Seoul, Korea, Republic of Duration: Apr 30 2003 → May 2 2003

Publication series

Name	Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume	2637
ISSN (Print)	0302-9743

Other

Other	7th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2003
Country/Territory	Korea, Republic of
City	Seoul
Period	4/30/03 → 5/2/03

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2003.

Access

10.1007/3-540-36175-8_55

Cite this

Xu, J., Xiong, H., Sung, S. Y., & Kumar, V. (2003). A new clustering algorithm for transaction data via caucus. In K-Y. Wang, J. Jeon, K. Shim, & J. Srivastava (Eds.), Advances in Knowledge Discovery and Data Mining (pp. 551-562). (Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science); Vol. 2637). Springer Verlag. https://doi.org/10.1007/3-540-36175-8_55

A new clustering algorithm for transaction data via caucus. / Xu, Jinmei; Xiong, Hui; Sung, Sam Yuan; Kumar, Vipin.

Advances in Knowledge Discovery and Data Mining. ed. / Kyu-Young Wang; Jongwoo Jeon; Kyuseok Shim; Jaideep Srivastava. Springer Verlag, 2003. p. 551-562 (Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science); Vol. 2637).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Xu, J, Xiong, H, Sung, SY & Kumar, V 2003, A new clustering algorithm for transaction data via caucus. in K-Y Wang, J Jeon, K Shim & J Srivastava (eds), Advances in Knowledge Discovery and Data Mining. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), vol. 2637, Springer Verlag, pp. 551-562, 7th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2003, Seoul, Korea, Republic of, 4/30/03. https://doi.org/10.1007/3-540-36175-8_55

Xu, Jinmei ; Xiong, Hui ; Sung, Sam Yuan ; Kumar, Vipin. / A new clustering algorithm for transaction data via caucus. Advances in Knowledge Discovery and Data Mining. editor / Kyu-Young Wang ; Jongwoo Jeon ; Kyuseok Shim ; Jaideep Srivastava. Springer Verlag, 2003. pp. 551-562 (Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)).

@inproceedings{dcf00ef70bdd41c3830dc7165da6c8e5,

title = "A new clustering algorithm for transaction data via caucus",

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.",

author = "Jinmei Xu and Hui Xiong and Sung, {Sam Yuan} and Vipin Kumar",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2003.; 7th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2003 ; Conference date: 30-04-2003 Through 02-05-2003",

year = "2003",

doi = "10.1007/3-540-36175-8_55",

language = "English (US)",

series = "Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)",

publisher = "Springer Verlag",

pages = "551--562",

editor = "Kyu-Young Wang and Jongwoo Jeon and Kyuseok Shim and Jaideep Srivastava",

booktitle = "Advances in Knowledge Discovery and Data Mining",

}

TY - GEN

T1 - A new clustering algorithm for transaction data via caucus

AU - Xu, Jinmei

AU - Xiong, Hui

AU - Sung, Sam Yuan

AU - Kumar, Vipin

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2003.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=7444237077&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=7444237077&partnerID=8YFLogxK

U2 - 10.1007/3-540-36175-8_55

DO - 10.1007/3-540-36175-8_55

M3 - Conference contribution

AN - SCOPUS:7444237077

T3 - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

SP - 551

EP - 562

BT - Advances in Knowledge Discovery and Data Mining

A2 - Wang, Kyu-Young

A2 - Jeon, Jongwoo

A2 - Shim, Kyuseok

A2 - Srivastava, Jaideep

PB - Springer Verlag

T2 - 7th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2003

Y2 - 30 April 2003 through 2 May 2003

ER -

A new clustering algorithm for transaction data via caucus

Abstract

Publication series

Other

Bibliographical note

Access

Other files and links

Fingerprint

Cite this