Description: How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
- [cure] - CURE cluster algorithm based on represen
- [Cluster111111] - cluster counting on the formation of com
- [cluster.tar] - this algorithm codes, I felt that good,
- [track3_jian] - DM642 realize the moving target detectio
- [dbscan] - DBSCAN is a density-based clustering alg
- [kmeansren] - k-means clustering algorithm for the dyn
- [K_Average] - K-means algorithm for support vector mac
- [cluster-2.9] - ClustanGraphics clustering analysis tool
File list (Check if you may need any files):
Download