Skip to main content

An Approach to Determine the Number of Clusters for Clustering Algorithms

  • Conference paper
Computational Collective Intelligence. Technologies and Applications (ICCCI 2012)

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

Included in the following conference series:

Abstract

When clustering a dataset, the right number k of clusters is not often obvious. And choosing k automatically is a complex problem. This paper first reviews existing methods for selecting the number of clusters for the algorithm. Then, an improved algorithm is presented for learning k while clustering. The algorithm is based on coefficients α, β that affect this selection. Meanwhile, a new measure is suggested to confirm the member of clusters. Finally, we evaluate the computational complexity of the algorithm, apply to real datasets and results show its efficiency.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Yan, M.S., Wu, K.L., Yu, J.: A novel fuzzy clustering algorithm. In: IEEE In’t Symp. on Computational Intelligence in Robotics and Automation, pp. 647–652 (2003)

    Google Scholar 

  2. Pham, D.T., Dimov, S.S., Nguyen, C.D.: Selection of K in K-means clustering. In: Proc. IMechE, Mechanical Engineering Science, vol. 219, pp. 103–119 (2005)

    Google Scholar 

  3. Yin, Z., Tang, Y., Sun, F., Sun, Z.: Fuzzy Clustering with Novel Separable Criterion Tsinghua Science and Technology, pp. 50–53 (2006) ISSN 1007-0214 09/2011

    Google Scholar 

  4. Haizhou, W., Mingzhou, S.: Optimal k-means Clustering in One Dimension by Dynamic Programming. The R Journal 3(2), 29–33 (2011) ISSN 2073-4859

    Google Scholar 

  5. Mohammad, F.E., Wesam, M.A.: Initializing K-Means Clustering Algorithm using Statistical Information. In’t Journal of Computer Applications, 51–55 (2011)

    Google Scholar 

  6. Santhi, M.V.B.T., Sai Leela, V.R.N., Anitha, P.U., Nagamalleswari, D.: Enhancing K-Means Clustering Algorithm. International Journal of Computer Science & Technology, IJCST 2(4), 73–77 (2011) ISSN: 2229-4333

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nguyen, D.T., Doan, H. (2012). An Approach to Determine the Number of Clusters for Clustering Algorithms. In: Nguyen, NT., Hoang, K., Jȩdrzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34630-9_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34630-9_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34629-3

  • Online ISBN: 978-3-642-34630-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics