Advertisement

Toward Ameliorating K-Means Clustering Algorithm

  • D. SirishaEmail author
  • S. Sambhu Prasad
Conference paper
  • 6 Downloads
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1119)

Abstract

Mining knowledge and predicting the behavior of the data have become major challenge with the advent of unprecedented escalation in the volume of the existing databases. Generally, clustering is adopted for voluminous and intricate data. In the present work, two techniques of K-means clustering, namely, K-means algorithm with random sampling (without realignment) and K-means algorithm with realignment sampling, are compared in terms of time taken and number of moves made for clustering the given data. The first one checks for any transfers between the clusters after inserting all the data. The second one is to check for any transfers between clusters for each new data inserted into cluster. The experimental results reveal that K-means clustering algorithm with realignment has performed reasonably well against K-means clustering algorithm without realignment.

Keywords

Data mining Clustering K-means clustering algorithm 

References

  1. 1.
    Narayanan, R., Ozisikyilmaz, B., Zambreno, J., Memik, G., Choudhary, A.: MineBench: a benchmark suite for data mining workloads. In: 2006 IEEE International Symposium on Workload Characterization, pp. 182–188. San Jose, CA (2006)Google Scholar
  2. 2.
    Anh, DT., Thanh, LH.: An efficient implementation of k-means clustering for time series data with DTW distance. Int. J. Bus. Intell. Data Min. 10(3), 213–232 (2015)Google Scholar
  3. 3.
    Sakthi, M., Thanamani, AS.: An effective determination of initial centroids in K-Means clustering using kernel PCA. Int. J. Comput. Sci. Inf. Technol. 2(3), 955–959 (2011)Google Scholar
  4. 4.
    Sangalli, L.M., Secchi, P., Vantini, S., Vitelli, L.: K-mean alignment for curve clustering. Comput. Stat. Data Anal. 54(5), 1219–1233 (2010)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Bradley, P., Fayyad, U.: Refining initial data items for k-means clustering. In: Proceedings 15th International Conference on Machine Learning (1998)Google Scholar
  6. 6.
    Das, H., Naik, B., Behera, H. S.: Classification of diabetes mellitus disease (DMD): a data mining (DM) approach. Prog. Comput. Anal. Netw. 539–549 (2018) (Springer, Singapore)Google Scholar
  7. 7.
    Zhang, R., Rudnicky, A.: A large scale clustering scheme for K-means. In: 16th International Conference on Pattern Recognition (ICPR’02) (2002)Google Scholar
  8. 8.
    Nepolean, G., Ganga Lakshmi, G.: An efficient K-Means clustering algorithm for reducing time complexity using uniform distribution data points. Trends Inf. Sci. Comput. (2010)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.Pragati Engineering CollegeSurampalemIndia

Personalised recommendations