KC-means: A fast fuzzy clustering

13Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A novel hybrid clustering method, named KC-Means clustering, is proposed for improving upon the clustering time of the Fuzzy C-Means algorithm. The proposed method combines C-Means and Fuzzy C-Means algorithms into two stages. In the first stage, the C-Means algorithm is applied to the dataset to find the centers of a fixed number of groups. In the second stage, the Fuzzy C-Means algorithm is applied on the centers obtained in the first stage. Comparisons are then made between the proposed and other algorithms in terms of time processing and accuracy. In addition, the mentioned clustering algorithms are applied to a few benchmark datasets in order to verify their performances. Finally, a class ofMinkowski distances is used to determine the influence of distance on the clustering performance.

Cite

CITATION STYLE

APA

Atiyah, I. A., Mohammadpour, A., & Taheri, M. M. (2018). KC-means: A fast fuzzy clustering. Advances in Fuzzy Systems, 2018. https://doi.org/10.1155/2018/2634861

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free