- Fuzzy clustering
Fuzzy clustering is a class of
algorithm incomputer science .Explanation of clustering
Data clustering is the process of dividing data elements into classes or clusters so that items in the same class are as similar as possible, and items in different classes are as dissimilar as possible. Depending on the nature of the data and the purpose for which clustering is being used, different measures of similarity may be used to place items into classes, where the similarity measure controls how the clusters are formed. Some examples of measures that can be used as in clustering include distance, connectivity, and intensity.In
hard clustering , data is divided into distinct clusters, where each data element belongs to exactly one cluster. In fuzzy clustering, data elements can belong to more than one cluster, and associated with each element is a set of membership levels. These indicate the strength of the association between that data element and a particular cluster. Fuzzy clustering is a process of assigning these membership levels, and then using them to assign data elements to one or more clusters.One of the most widely used fuzzy clustering algorithms is the Fuzzy C-Means (FCM) Algorithm(Bezdek 1981). The FCMalgorithm attempts to partition a finite collection of elementsX = {x1, . . . , xn} into a collection of c fuzzy clusters with respect to some given criterion.Given a finite set of data, the algorithm returns a list of c cluster centres C = {c1, . . . , cc} and a partition matrix U = ui, j �(0, 1), i = 1, . . . , n, j = 1, . . . , c, where each element tellsthe degree to which element xi belongs to cluster c j . Like the k-means algorithm, the FCMaims to minimize an objective function. The standard function is:
which differs from the k-means objective function by the addition of the membership valuesui j and the fuzzifier m. The fuzzifier m determines the level of cluster fuzziness. A largem results in smaller memberships ui j and hence, fuzzier clusters. In the limit m = 1, thememberships ui j converge to 0 or 1, which implies a crisp partitioning. In the absence ofexperimentation or domain knowledge, m is commonly set to 2. The basic FCM Algorithm,given n data points (x1, . . . , xn) to be clustered, a number of c clusters with (c1, . . . , cc) the center of the clusters, and m the level of cluster fuzziness with,
ee also
*
evolving classification function
*neuro-fuzzy techniques
*FLAME Clustering External links
* [http://ideas.repec.org/p/dgr/eureri/200050.html "Extended Fuzzy Clustering Algorithms" by Kaymak, U. and Setnes, M.]
* [http://citeseer.ist.psu.edu/krishnapuram01lowcomplexity.html "Low-Complexity Fuzzy Relational Clustering Algorithms for Web Mining" by Raghu Krishnapuram]
* [http://documents.wolfram.com/applications/fuzzylogic/Manual/12.html Wolfram Research]
* [http://www.ingentaconnect.com/content/klu/ququ/2002/00000036/00000003/00394837 "A Fuzzy Clustering Algorithm" by Erminio D. and Guerrisi F.]
* [http://cism.kingston.ac.uk/people/shihab/dissertation.pdf "Fuzzy Clustering Algorithms and their Application to Medical Image Analysis" PhD Thesis, 2001, by AI Shihab.]
* [http://home.dei.polimi.it/matteucc/Clustering/tutorial_html/index.html "A Tutorial on Clustering Algorithms"]
Wikimedia Foundation. 2010.
