A State of Art Analysis of Telecommunication Data by k-Means and k-Medoids Clustering Algorithms

作     者：T. Velmurugan 

作者机构：PG and Research Department of Computer Science D. G. Vaishnav College Chennai India 

出 版 物：《Journal of Computer and Communications》 (电脑和通信（英文）)

年 卷 期：2018年第6卷第1期

页      面：190-202页

学科分类：1002[医学-临床医学] 100214[医学-肿瘤学] 10[医学] 

主　　题：k-Means Algorithm k-Medoids Algorithm Data Clustering Time Complexity Telecommunication Data 

摘      要：Cluster analysis is one of the major data analysis methods widely used for many practical applications in emerging areas of data mining. A good clustering method will produce high quality clusters with high intra-cluster similarity and low inter-cluster similarity. Clustering techniques are applied in different domains to predict future trends of available data and its uses for the real world. This research work is carried out to find the performance of two of the most delegated, partition based clustering algorithms namely k-Means and k-Medoids. A state of art analysis of these two algorithms is implemented and performance is analyzed based on their clustering result quality by means of its execution time and other components. Telecommunication data is the source data for this analysis. The connection oriented broadband data is given as input to find the clustering quality of the algorithms. Distance between the server locations and their connection is considered for clustering. Execution time for each algorithm is analyzed and the results are compared with one another. Results found in comparison study are satisfactory for the chosen application.