✦ LIBER ✦

Fast, fuzzy c-means clustering of data sets with many features

✍ Scribed by Bjørn K. Alsberg

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 611 KB
Volume: 16
Category: Article
ISSN: 0192-8651
DOI: 10.1002/jcc.540160404

No coin nor oath required. For personal study only.

✦ Synopsis

A fuzzy c-means clustering algorithm is presented which is much faster than the traditional algorithm for data sets in which the number of features is significantly larger than the number of feature vectors. The algorithm is constructed by utilizing the covariance structure of feature vectors and cluster centers. By using results from a previous clustering, modified versions of the new algorithm achieve additional reductions in floating point operations.

📜 SIMILAR VOLUMES

Clustering of 29Si NMR data of aluminosi

Clustering of 29Si NMR data of aluminosilicate glasses using, k-means and fuzzy c-means — a comparison

✍ Frank Ehrentreich; Marianne Nofz; Hans-Georg Bartel 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 947 KB

Approximate fuzzy C-means (AFCM) cluster

Approximate fuzzy C-means (AFCM) cluster analysis of medical Magnetic Resonance Image (MRI) data

✍ Paul J. Chang; Robert L. DeLaPaz; Ralph Bernstein; Jetendra V. Dave 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Computationally intensive parameter sele

Computationally intensive parameter selection for clustering algorithms: The case of fuzzy c-means with tolerance

✍ Vicenç Torra; Yasunori Endo; Sadaaki Miyamoto 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

Parameter selection is a well-known problem in the fuzzy clustering community. In this paper, we propose to tackle this problem using a computationally intensive approach. We apply this approach to a new method for clustering recently introduced in the literature. It is the fuzzy c-means with tolera