Skip to main content

K-means Based Consensus Clustering

  • Chapter
  • First Online:

Part of the book series: Springer Theses ((Springer Theses))

Abstract

Consensus clustering, also known as cluster ensemble or clustering aggregation, aims to find a single clustering from multi-source basic clusterings on the same group of data objects. It has been widely recognized that consensus clustering has merits in generating better clusterings, finding bizarre clusters, handling noise, outliers and sample variations, and integrating solutions from multiple distributed sources of data or attributes.

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

Buying options

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 EPUB and 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
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    http://www.strehl.com.

  2. 2.

    http://www.mathworks.cn/help/toolbox/stats/kmeans.html.

  3. 3.

    http://glaros.dtc.umn.edu/gkhome/views/cluto/.

References

  • DeGroot, M., Schervish, M.: Probability and Statistics, 3rd ed. Addison Wesley, Reading (2001)

    Google Scholar 

  • Dudoit, S., Fridlyand, J.: Bagging to improve the accuracy of a clustering procedure. Bioinformatics 19(9), 1090–1099 (2003)

    Article  Google Scholar 

  • Fern, X., Brodley, C.: Random projection for high dimensional data clustering: A cluster ensemble approach. In: Proceedings of the 20th International Conference on Machine Learning, pp. 186–193. Washington, DC, USA (2003)

    Google Scholar 

  • Fischer, R., Buhmann, J.: Path-based clustering for grouping of smooth curves and texture segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 25(4), 513–518 (2003)

    Article  Google Scholar 

  • Fred, A., Jain, A.: Data clustering using evidence accumulation. In: Proceedings of the 16th International Conference on Pattern Recognition, vol. 4, pp. 276–280. Quebec City, Quebec, Canada (2002)

    Google Scholar 

  • Fred, A., Jain, A.: Combining multiple clusterings using evidence accumulation. IEEE Trans. Pattern Anal. Mach. Intell. 27(6), 835–850 (2005)

    Article  Google Scholar 

  • Gionis, A., Mannila, H., Tsaparas, P.: Clustering aggregation. ACM Trans. Knowl. Discov. Data 1(1), 1–30 (2007)

    Article  Google Scholar 

  • Goder, A., Filkov, V.: Consensus clustering algorithms: Comparison and refinement. In: Proceedings of the 9th SIAM Workshop on Algorithm Engineering and Experiments. San Francisco, USA (2008)

    Google Scholar 

  • Jain, A., Dubes, R.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1988)

    MATH  Google Scholar 

  • Li, T., Ding, C.: Weighted consensus clustering. In: Proceedings of the 8th SIAM International Conference on Data Mining, pp. 798–809. Atlanta, Georgia, USA (2008)

    Google Scholar 

  • Lu, Z., Peng, Y., Xiao, J.: From comparing clusterings to combining clusterings. In: Fox, D., Gomes, C. (eds.) Proceedings of the 23rd AAAI Conference on Artificial Intelligence, pp. 361–370. AAAI Press, Chicago, Illinois, USA (2008)

    Google Scholar 

  • MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Cam L.L., Neyman J. (eds.) Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, Statistics. University of California Press (1967)

    Google Scholar 

  • Mirkin, B.: Reinterpreting the category utility function. Mach. Learn. 45(2), 219–228 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  • Monti, S., Tamayo, P., Mesirov, J., Golub, T.: Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data. Mach. Learn. 52(1–2), 91–118 (2003)

    Article  MATH  Google Scholar 

  • Nguyen, N., Caruana, R.: Consensus clusterings. In: Proceedings of the 7th IEEE International Conference on Data Mining, pp. 607–612. Washington, DC, USA (2007)

    Google Scholar 

  • Strehl, A., Ghosh, J.: Cluster ensembles-a knowledge reuse framework for combining partitions. J. Mach. Learn. Res. 3, 583–617 (2002)

    MathSciNet  Google Scholar 

  • Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley, Boston (2005)

    Google Scholar 

  • Topchy, A., Jain, A., Punch, W.: Combining multiple weak clusterings. In: Proceedings of the 3th IEEE International Conference on Data Mining, pp. 331–338. Melbourne, Florida, USA (2003)

    Google Scholar 

  • Topchy, A., Jain, A., Punch, W.: A mixture model for clustering ensembles. In: Proceedings of the 4th SIAM International Conference on Data Mining, pp. 379–390. Florida, USA (2004)

    Google Scholar 

  • Wu, J., Xiong, H., Chen, J.: Adapting the right measures for k-means clustering. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 877–886. Paris, France (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Wu, J. (2012). K-means Based Consensus Clustering. In: Advances in K-means Clustering. Springer Theses. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29807-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29807-3_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29806-6

  • Online ISBN: 978-3-642-29807-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics