Sunday, 26 May, 2019

011-28082485

011-47044510

+91-9899775880

A Modified K-means Algorithm that Determines Number of Clusters Automatically

International Journal of Knowledge Based Computer Systems

Volume 4 Issue 2

Published: 2016
Author(s) Name: Jyoti Sharma, G. N. Purohit | Author(s) Affiliation: Banasthali University, Banasthali, Rajasthan, India
Locked Subscribed Available for All

Abstract

This paper presents a modified k-means that not only increases classification accuracy but also determines optimal number of clusters automatically. It is a two phase clustering algorithm based on k-means, membership degree and standard deviation. Phase I automatically determines the number of clusters. Standard deviation of membership value helps us to identify number of clusters automatically. The phase II increases the classification accuracy. It does not require number of clusters as parameters like other previous most widely used unsupervised pattern clustering algorithms such as Fuzzy C-means and K-means. Experiments were done on some benchmark datasets and synthetic datasets to evaluate the performance of proposed approach.

Keywords: Clustering, Validitymeasures, K-means, Membership Degree

View PDF

Refund policy | Privacy policy | Copyright Information | Contact Us | Feedback © Publishingindia.com, All rights reserved