STRETCHED RELIABLE METAHEURISTICS FOR ENHANCING K-MEANS

Murala Madhusudhanarao, Dr. G.V.S.N.V Prasad

Abstract


Cluster analysis is one of the primary data analysis methods and k-means is one of the most well known popular clustering algorithms. The k-means algorithm is one of the frequently used clustering method in data mining, due to its performance in clustering massive data sets. The final clustering result of the kmeans clustering algorithm greatly depends upon the correctness of the initial centroids, which are selected randomly. The original k-means algorithm converges to local minimum, not the global optimum. Many improvements were already proposed to improve the performance of the k-means, but most of these require additional inputs like threshold values for the number of data points in a set. In this paper a new method is proposed for finding the better initial centroids and to provide an efficient way of assigning the data points to suitable clusters with reduced time complexity. According to our experimental results, the proposed algorithm has the more accuracy with less computational time comparatively original k-means clustering algorithm.


Keywords


Clustering; Data Mining; Data partitioning; Initial cluster centers; K-means clustering algorithm. Cluster analysis.

References


M. Xu, Y. Shang, D. Li, and X. Wang, “Greening data center networkswith throughput-guaranteed power-aware routing,” Comput.Netw., vol. 57, no. 15, pp. 2880–2899, 2013.

R. Kubo, J. Kani, H. Ujikawa, T. Sakamoto, Y. Fujimoto, N.Yoshimoto, and H. Hadama, “Study and demonstration of sleepand adaptive link rate control mechanisms for energy efficient10G-EPON,” IEEE/OSA J. Opt. Commun. Netw., vol. 2, no. 9,pp. 716–729, Sep. 2010.

J. L. Sobrinho, “Algebra and algorithms for QoS path computationand hop-by-hop routing in the internet,” IEEE/ACM Trans. Netw.,vol. 10, no. 2, pp. 541–550, Aug. 2002.

Y. M. Kim, E. J. Lee, H. S. Park, J.-K. Choi, and H.-S. Park, “Antcolony based self-adaptive energy saving routing for energy efficientInternet,” Comput. Netw., vol. 56, no. 10, pp. 2343–2354, 2012.

J. Wang and K. Nahrstedt, “Hop-by-hop routing algorithms forpremium-class traffic in DiffServ networks,” ACM SIGCOMMComput. Commun. Rev., vol. 32, pp. 73–88, 2002.

Yuan Yang, Student Member, IEEE, Mingwei Xu, Member, IEEE,Dan Wang, Member, IEEE, and Suogang Li, “A Hop-by-Hop Routing Mechanismfor Green Internet”, ieee transactions on parallel and distributed systems, vol. 27, no. 1, january 2016.

O. Heckmann, M. Piringer, J. Schmitt, and R. Steinmetz, “Generating realistic ISP-level network topologies,” IEEE Commun. Lett., vol. 7, no. 6, pp. 335–336, Jul. 2003.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.