Improving the efficacy of clustering by using far enhanced clustering algorithm
by Bikram Keshari Mishra; Amiya Kumar Rath
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 10, No. 3, 2018

Abstract: There are several aspects on which research works are carried out on clustering. The prime focus is on finding the near optimal cluster centres and determining the best possible clusters. Hence, we have emphasised our work on finding a technique which contemplates on these facets in a way which is far more efficient than several novel approaches. In this paper, we have examined four varieties of clustering algorithms namely; K-Means, FEKM, ECM and proposed FECA implemented on varying data sets. We used few internal cluster validity indices like Dunn's index, Davies-Bouldin's index, Silhouette Coefficient, C index and Calinski index for quantitative evaluation of the clustering results obtained. The results obtained from simulation were compared, and as per our expectation it was found that, the quality of clustering produced by FECA is far more satisfactory than the others. Almost every value of validity indices used give encouraging results for FECA, implying good cluster formation. Further experiments support that the proposed algorithm also produces minimum quantisation error almost for all the data sets used.

Online publication date: Wed, 08-Aug-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com