Accelerating Fuzzy-C Means Using an Estimated Subsample Size

Many algorithms designed to accelerate the fuzzy c-means (FCM) clustering algorithm randomly sample the data. Typically, no statistical method is used to estimate the subsample size, despite the impact subsample sizes have on speed and quality. This paper introduces two new accelerated algorithms, i...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on fuzzy systems Vol. 22; no. 5; pp. 1229 - 1244
Main Authors:	Parker, Jonathon K., Hall, Lawrence O.
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.10.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Accelerated Acceleration Algorithm design and analysis Algorithms Clustering algorithms Estimates extensible fast fuzzy c-means (EFFCM) Fuzzy fuzzy c-means (FCM) fuzzy clustering Fuzzy logic Fuzzy set theory geometric progressive fuzzy c-means (GOFCM) minimum sample estimate random fuzzy c-means (MSERFCM) multinomial proportion online fuzzy c-means (OFCM) Optimization Partitioning algorithms Partitions progressive sampling random sampling plus extension fuzzy c-means (rseFCM) Runtime Samples sampling scalable single-pass fuzzy c-means (SPFCM) Statistical analysis Statistical methods stopping criterion rsefcm scalable progressive sampling sampling fuzzy c-means multinomial proportion accelerated effcm fcm mserfcm ofcm fuzzy clustering gofcm stopping criterion spfcm
ISSN:	1063-6706, 1941-0034
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!