Skip to main content

A New Clustering Algorithm for Transaction Data via Caucus

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2637))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal, R. Srikant: Fast algorithms for mining association rules. Proc. 1994 Int. Conf. on Very Large Data Bases. (1994) 487–499.

    Google Scholar 

  2. Charu C. Aggarwal, Philip S. Yu: Finding generalized projeted clusters in high dimensional spaces. Proc. 2000 ACM SIGMOD Inter. Conf. on Management of Data, (2000) 70–81.

    Google Scholar 

  3. Charu C. Aggarwal, Zheng S., Philip S. Yu: Finding Profile Association Rules. Proc. 1998 Int. conf. on Information and Knowledge Management, (1998).

    Google Scholar 

  4. M. Dash, H. Liu, J. Yao: Dimensionality reduction of unsupervised data. Proc. 9th IEEE Inter. Conf. on Tools with AI, (1997) 532–539.

    Google Scholar 

  5. D. L. Davies, S. W. Bouldin: A cluster separation measure. IEEE Trans. on Pattern Analysis and Machine Intelligence, (1979) PAMI-1(2) 224–227.

    Article  Google Scholar 

  6. J. D. Fast: Entropy: the signicance of the concept of entropy and its applications in science and technology. Chapter of The Statistical Significance of the Entropy Concept. Eindhoven: Philips Technical Library, (1962).

    Google Scholar 

  7. M. Gluck, J. Corter: Information, uncertainty, and the utility of categories. Proc. 7th Conf. Cognitive Science Society, (1985) 83–87.

    Google Scholar 

  8. R. Agrawal, R. Srikant: Fast algorithms for mining association rules. Proc. of the 20th Int’l Conf. on Very Large Database (VLDB), 1994 487–499.

    Google Scholar 

  9. E-H(Sam) Han, G. Karypis, B. Mobashad: Hypergraph Based Clustering In High-dimensional Data Sets: A Summary of Results. In Bulletin of the Technical Committee on Data Engineering, (1998).

    Google Scholar 

  10. L. Kaufman, P. J. Rousseeuw: Finding Groups in Data: An Introduction to Cluster Analysis. New York: John Wiley & Sons, (1990).

    Google Scholar 

  11. B. Pavel: Survey of Clustering Data Mining Techniques. (2002) http://www.accrue.com/products/rp_cluster_review.ps

  12. J. R. Quinlan: C4.5: programme for machine learning. Morgan Kaufmann (1993).

    Google Scholar 

  13. R. Setiona, H. Liu: Neural Network Feature Selector IEEE Trans. Neural Networks, Aug, (1997) 654–662.

    Google Scholar 

  14. K. Wang, C. Xu, B. Liu: Clustering Transactions Using Large Items. Proc. 1999 Int. Conf on Information and Knowledge Management, (1999) 483–490.

    Google Scholar 

  15. Ch. H. Yun, K. T. Chuang, M. S. Chen: An Efficient Clustering Algorithm for Market Basket Data Based on Small Large Ratio. Proc. 25th Annual International Computer Software and Applications Conference. (2001).

    Google Scholar 

  16. The Coil data set can be found at: http://www.liacs.nl/putten/library/cc2000/problem.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, J., Xiong, H., Sung, S.Y., Kumar, V. (2003). A New Clustering Algorithm for Transaction Data via Caucus. In: Whang, KY., Jeon, J., Shim, K., Srivastava, J. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2003. Lecture Notes in Computer Science(), vol 2637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36175-8_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-36175-8_55

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04760-5

  • Online ISBN: 978-3-540-36175-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics