Further Reading Clustering algorithms Decompositional (top-down) Agglomerative (bottom-up) Decompositional algorithms are almost always based on vector space (only terms in which to see high-level structure.) Any decompositional clustering algorithm can be made hierarchical by recursive application. K-means algorithm K-means-cluster (in S : set of vectors : k : integer) { let C[1] ... C[k] be a random partition of S into k parts; repeat { for i := 1 to k { X[i] := centroid of C[i]; C[i] := empty } for j := 1 to N { X[q] := the closest to S[j] of X[1] ...
Read full article from Lecture 7: Clustering Algorithms
No comments:
Post a Comment