This article explains how to apply the deterministic annealing (DA) and simulated annealing (SA) methods to fuzzy entropy based fuzzy c-means clustering. By regularizing the fuzzy c-means method with fuzzy entropy, a membership function similar to the Fermi-Dirac distribution function, well known in statistical mechanics, is obtained, and, while optimizing its parameters by SA, the minimum of t...

Part I of this paper proposes a definition of the adaptive resonance theory (ART) class of constructive unsupervised on-line learning clustering networks. Class ART generalizes several well-known clustering models, e.g., ART 1, improved ART 1, adaptive Hamming net (AHN), and Fuzzy ART, which are optimized in terms of memory storage and/or computation time. Next, the symmetric Fuzzy ART (S-Fuzzy...

While focusing on document clustering, this work presents a fuzzy semi-supervised clustering algorithm called fuzzy semi-Kmeans. The fuzzy semi-Kmeans is an extension of K-means clustering model, and it is inspired by an EM algorithm and a Gaussian mixture model. Additionally, the fuzzy semi-Kmeans provides the flexibility to employ different fuzzy membership functions to measure the distance b...

Clustering algorithms have been utilized in a wide variety of application areas. One of these algorithms is the Fuzzy C-Means algorithm (FCM). One of the problems with these algorithms is the time needed to converge. In this paper, a Fast Fuzzy C-Means algorithm (FFCM) is proposed based on experimentations, for improving fuzzy clustering. The algorithm is based on decreasing the number of dista...

Aimed at fuzzy clustering based on the generalized entropy, an image segmentation algorithm by joining space information of image is presented in this paper. For solving the optimization problem with generalized entropy’s fuzzy clustering, both Hopfield neural network and multi-synapse neural network are used in order to obtain cluster centers and fuzzy membership degrees. In addition, to impro...

Fuzzy C-Mean (FCM) is an unsupervised clustering algorithm based on fuzzy set theory that allows an element to belong to more than one cluster. Where fuzzy means “unclear” or “not defined” and c denotes “clustering”. In FCM the number of cluster are randomly selected. [15] FCM is the advanced version of K-means clustering algorithm and doing more work than K-means. K-Means just needs to do a di...

Relational clustering is an extension of clustering for relational data. Fuzzy c-Medoids (FCMdd) based linear fuzzy clustering extracts intrinsic local linear substructures from relational data. However this linear clustering was affected by noise or outliers because of using Euclidean distance. Alternative Fuzzy c-Means (AFCM) is an extension of Fuzzy c-means, in which a modified distance meas...