Skip to main content

Improved K-Means Algorithm and Its Application to Vehicle Steering Identification

  • Conference paper
  • First Online:
Advanced Hybrid Information Processing (ADHIP 2017)

Abstract

K-means is a very common clustering algorithm, whose performance depends largely on the initially selected cluster center. The K-means algorithm proposed by this paper uses a new strategy to select the initial cluster center. It works by calculating the minimum and maximum distances from data to the origin, dividing this range into several equal ranges, and then adjusting every range according to the data distribution to equate the number of data contained in the ranges as much as possible, and finally calculating the average of data in every range and taking it as initial cluster center. The theoretical analysis shows that despite linear time complexity of initialization process, this algorithm has the features of an superlinear initialization method. The application of this algorithm to the analysis of GPS data when vehicle is moving shows that it can effectively increase the clustering speed and finally achieve better vehicle steering identification.

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 EPUB and 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

References

  1. Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245–248 (2009)

    Article  MATH  Google Scholar 

  2. Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar-means problem is NP-hard. Theoret. Comput. Sci. 442, 13–21 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Qi, H., Liu, Y., Wei, D.: GPS-based vehicle moving state recognition method and its applications on dynamic in-car navigation systems. In: 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing, pp. 354–360 (2014)

    Google Scholar 

  4. Celebi, M.E., Kingravi, H.A., Vela, P.A.: A comparative study of efficient initialization methods for the K-means clustering algorithm. Expert Syst. Appl. 40(1), 200–210 (2013)

    Article  Google Scholar 

  5. Celebi, M.E.: Improving the performance of K-means for color quantization. Image Vis. Comput. 29(4), 260–271 (2011)

    Article  Google Scholar 

  6. Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 1027–1035 (2007)

    Google Scholar 

  7. Al-Daoud, M.B.: A new algorithm for cluster initialization. Int. J. Comput. Control Quantum Inf. Eng. 1(4), 1016–1018 (2007)

    Google Scholar 

  8. Redmond, S.J., Heneghan, C.: A method for initialising the K-means clustering algorithm using kd-trees. Pattern Recogn. Lett. 28(8), 965–973 (2007)

    Article  Google Scholar 

  9. Hasan, M.A., Chaoji, V., Salem, S., Zaki, M.J.: Robust partitional clustering by outlier and density insensitive seeding. Pattern Recogn. Lett. 30(11), 994–1002 (2009)

    Article  Google Scholar 

  10. Nazeer, K.A.A., Sebastian, M.P.: Improving the accuracy and efficiency of the K-means clustering algorithm. In: World Congress on Engineering, WCE 2009, Hong Kong, China, vol. 1, pp. 308–312 (2009)

    Google Scholar 

  11. Yedla, M., Pathakota, S.R., Srinivasa, T.M.: Enhancing K-means clustering algorithm with improved initial centre. Int. J. Comput. Sci. Inf. Technol. 1(2), 121–125 (2010)

    Google Scholar 

  12. Goyal, M., Kumar, S.: Improving the initial centroids of K-means clustering algorithm to generalize its applicability. J. Inst. Eng. (India): Ser. B 95(4), 345–350 (2014)

    Google Scholar 

  13. Broder, A., Garcia-Pueyo, L., Josifovski, V., Vassilvitskii, S., Venkatesan, S.: Scalable K-means by ranked retrieval. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, New York, NY, USA, pp. 233–242 (2014)

    Google Scholar 

  14. Cap, M., Prez, A., Lozano, J.A.: An efficient approximation to the K-means clustering for massive data. Knowl.-Based Syst. 117, 56–69 (2017)

    Article  Google Scholar 

Download references

Acknowledgment

This work is supported in part by the National High Technology Research and Development Program (863 Program) of China under Grant No. 2015AA015701, the Science and Technology Planning Project of Jilin Province under Grant No. 20150204081GX.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hui Qi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Qi, H., Di, X., Li, J., Ma, H. (2018). Improved K-Means Algorithm and Its Application to Vehicle Steering Identification. In: Sun, G., Liu, S. (eds) Advanced Hybrid Information Processing. ADHIP 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 219. Springer, Cham. https://doi.org/10.1007/978-3-319-73317-3_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73317-3_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73316-6

  • Online ISBN: 978-3-319-73317-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics