Grassmann Clustering
Grassmann Clustering
Grassmann Clustering
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
n(t)<br />
s(t) �<br />
A<br />
F. Theis<br />
x(t)<br />
• samples<br />
• distance measure<br />
• algorithm:<br />
• fix number of<br />
clusters k<br />
• initialize centroids<br />
randomly<br />
• update-rule:<br />
batch or sequential<br />
I. Introduction<br />
k-means<br />
Zuweisung<br />
batch k-means<br />
9<br />
Apr 6, 2006 :: Tübingen