Skip to main content

A Locality Sensitive K-Means Clustering Method Based on Genetic Algorithms

  • Conference paper
Advances in Swarm Intelligence (ICSI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7929))

Included in the following conference series:

  • 2838 Accesses

Abstract

The locality sensitive k-means clustering has been proposed recently. However, it performance depends greatly on the choice of the initial centers and only proper initial centers enable this clustering approach to produce a better accuracies. In this paper, an evolutionary locality sensitive k-means clustering method is presented. This new approach uses the genetic algorithms for finding its initial centers by minimizing the Davies Bouldin clustering validity index regarded as the fitness function. To investigate the effective of our approach, some experiments are done on several datasets. Experimental results show that the proposed method can get the clustering performance significantly compared to other clustering algorithms.

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. Fillippone, M., Camastra, F., Masulli, F., Rovetta, S.: A survey of kernel and spectral methods for clustering. Pattern Recognition 41(1), 176–190 (2008)

    Article  Google Scholar 

  2. Jain, A.K., Murty, M.N., Flyn, P.J.: Data clustering: a review. ACM Computing Surveys 32(3), 256–323 (1999)

    Google Scholar 

  3. Xu, R., Wunsch, D.: Survey of clustering algorithms. IEEE Transactions on Neural Networks 16(3), 645–678 (2005)

    Article  Google Scholar 

  4. Tou, J.T., Gonzalez, R.C.: Pattern recognition principles. Addison-Wesley, London (1974)

    MATH  Google Scholar 

  5. Bezdek, J.C.: Pattern recognition with fuzzy objective function algorithms. Plenum Press, New York (1981)

    Book  MATH  Google Scholar 

  6. Kim, D.W., Lee, K.Y., Lee, D., Lee, K.H.: A kernel-based subtractive clustering method. Pattern Recognition Letters 26(7), 879–891 (2005)

    Article  Google Scholar 

  7. Martinetz, T.M., Berkovich, S.G., Schulten, K.J.: Neural-gas network for vector quantization and its application to time-series prediction. IEEE Transactions on Neural Networks 4(4), 558–569 (1993)

    Article  Google Scholar 

  8. Huang, P.H., Zhang, D.Q.: Locality sensitive c-means clustering algorithms. Neuracomputing 73(4), 2935–2943 (2010)

    Article  Google Scholar 

  9. Bezdek, J.C., Nikhil, R.P.: Some new indexes of cluster validity. IEEE Transactions on Systems Man Cybernet Part B 28(3), 301–315 (1998)

    Article  Google Scholar 

  10. UCI Machine Learning Repository, http://www.ics.uci.edu/~mlearn/MLSummary.html

  11. Dunn, J.: A fuzzy relative of the ISODATA process and its use in detecting compact well separated clusters. Journal of Cybernet. (3), 32–57 (1974)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gu, L. (2013). A Locality Sensitive K-Means Clustering Method Based on Genetic Algorithms. In: Tan, Y., Shi, Y., Mo, H. (eds) Advances in Swarm Intelligence. ICSI 2013. Lecture Notes in Computer Science, vol 7929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38715-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38715-9_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38714-2

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics