Grassmann Clustering
Grassmann Clustering
Grassmann Clustering
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
n(t)<br />
s(t) �<br />
A<br />
F. Theis<br />
x(t)<br />
II. Partitional <strong>Clustering</strong><br />
minimize this!<br />
batch k-means<br />
cluster assignment: for each at<br />
determine an index i(t) such that<br />
cluster update: within each cluster<br />
determine the centroid ci by minimizing<br />
may be<br />
difficult<br />
15<br />
Apr 6, 2006 :: Tübingen
Change language