A Study on the Modified FCM Algorithm using Intracluster


The KIPS Transactions:PartB , Vol. 9, No. 2, pp. 205-214, Apr. 2002
10.3745/KIPSTB.2002.9.2.205,   PDF Download:

Abstract

In this paper, we propose a modified FCM (MFCM) algorithm to solve the problems of the FCM algorithm and the fuzzy clustering algorithm using an average intracluster distance (FCAID). The MFCM algorithm grants the regular grade of membership in the small size of cluster. And it clears up the convergence problem of objective function because its objective function is designed according to the grade of membership of it, verified, and used for clustering data. So, it can solve the problem of the FCM algorithm in different size of cluster and the FCAID algorithm in the convergence problem of objective function. To verify the MFCM algorithm, we compared with the result of the FCM and the FCAID algorithm in data clustering. From the experimental results, the MFCM algorithm has a good performance compared with others by classification entropy.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. S. Ahn and S. J. Cho, "A Study on the Modified FCM Algorithm using Intracluster," The KIPS Transactions:PartB , vol. 9, no. 2, pp. 205-214, 2002. DOI: 10.3745/KIPSTB.2002.9.2.205.

[ACM Style]
Kang Sik Ahn and Seok Je Cho. 2002. A Study on the Modified FCM Algorithm using Intracluster. The KIPS Transactions:PartB , 9, 2, (2002), 205-214. DOI: 10.3745/KIPSTB.2002.9.2.205.