
Fuzzy k means 1.0 File ID: 81035 


 Fuzzy k means 1.0 License: Shareware File Size: 20.5 KB Downloads: 943 User Rating:   (1 rating) 
Submit Rating: 



Fuzzy k means 1.0 Description 

Description: Codes for fuzzy k means clustering, including k means with extragrades, Gustafson Kessel algorithm, fuzzy linear discriminant analysis. Performance measure is also calculated.
License: Shareware Related: discriminant, Linear, Analysis, Performance, calculated, Measure, Algorithm, kessel, means, Fuzzy O/S:BSD, Linux, Solaris, Mac OS X File Size: 20.5 KB Downloads: 943


More Similar Code 

The kmeans algorithm is widely used in a number applications like speech processing and image compression.
This script implements the algorithm in a simple but general way. It performs four basic steps.
1. Define k arbitrary prototypes from the data samples. 2. Assign each sample to the nearest prototype. 3. Recalculate prototypes as arithmetic means. 4. If a prototype changes, repeat step (2).
Hard and soft kmeans implemented simply in python (with numpy). Quick and dirty, tested and works on large (10k+ observations, 210 features) realworld data.
FCMTHRESH Thresholding by 3class fuzzy cmeans clustering
[bw,level]=fcmthresh(IM,sw) outputs the binary image bw and threshold level of image IM using a 3class fuzzy cmeans clustering. It often works better than Otsu's methold...
Fuzzy knearest neighbors classifier that can work with training samples whose label info is fuzzified. The prototype is as follows.
[y,predict_class] = f_knn(tr,tr_memberships,te,k)
tr: training samples tr_memberships:...
An implementation of "kMeans Projective Clustering" by P. K. Agarwal and N. H. Mustafa.
This method of clustering is based on finding few subspaces such that each point is close to a subspace.
Kmeans image segmentation based on histogram to reduce memory usage which is constant for any image size.
This is a tool for Kmeans clustering. After trying several different ways to program, I got the conclusion that using simple loops to perform distance calculation and comparison is most efficient and accurate because of the JIT acceleration in...
[L, C, D] = FKMEANS(X, k) partitions the vectors in the nbyp matrix X into k (or, rarely, fewer) clusters by applying the well known batch Kmeans algorithm. Rows of X correspond to points, columns correspond to variables. The...
Usage: [means,c]=KNMCluster(k,indata)
KNMCluster is an implementation of the Kmeans clustering algorithm. It takes inputs k and indata. k is the initial guess of the number of clusters.
indata is the aggregate data that you...
Description DC is simple and effective which can outperform the Kmeans and AP algorithm. 
User Review for Fuzzy k means 
