Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Get Better Accuracy and Quality of Clustering Using Variation of K Means


Affiliations
1 Department of Computer Engineering, Babaria Institute of Technology, Gujarat Technological University, Baroda, Gujarat, India
2 Department of Computer Science Engineering is Institute of Engineering and Science, Indore, Madhya Pradesh, India
     

   Subscribe/Renew Journal


Clustering analysis is a challenging task and there area number of issues associated with it, e.g. accuracy, quality, efficiency, finding cluster of different shape, size and density finding clusters which are sensitive to noise and outliers. K-means clustering algorithms are widely used for many practical applications. Original k-mean algorithms select initial centroids randomly that affect the accuracy and quality of the resulting clusters and sometimes it generates poor and empty clusters which are meaningless. Our approach for the K-mean algorithm eliminates the deficiency of exiting K-mean algorithm and Improve accuracy and generate high quality cluster by reducing mean square error.


Keywords

Centroids, Cluster Analysis, K-Means, Mean Square Error.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 257

PDF Views: 1




  • Get Better Accuracy and Quality of Clustering Using Variation of K Means

Abstract Views: 257  |  PDF Views: 1

Authors

Maikal Rana
Department of Computer Engineering, Babaria Institute of Technology, Gujarat Technological University, Baroda, Gujarat, India
Amit Chauhan
Department of Computer Science Engineering is Institute of Engineering and Science, Indore, Madhya Pradesh, India

Abstract


Clustering analysis is a challenging task and there area number of issues associated with it, e.g. accuracy, quality, efficiency, finding cluster of different shape, size and density finding clusters which are sensitive to noise and outliers. K-means clustering algorithms are widely used for many practical applications. Original k-mean algorithms select initial centroids randomly that affect the accuracy and quality of the resulting clusters and sometimes it generates poor and empty clusters which are meaningless. Our approach for the K-mean algorithm eliminates the deficiency of exiting K-mean algorithm and Improve accuracy and generate high quality cluster by reducing mean square error.


Keywords


Centroids, Cluster Analysis, K-Means, Mean Square Error.