14.02.2013 Views

Grassmann Clustering

Grassmann Clustering

Grassmann Clustering

SHOW MORE
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 />

if A={ a1, ..., aT } constrained non-linear opt. problem<br />

minimize<br />

subject to<br />

with centroid locations C := {c1, . . . , ck }<br />

and partition matrix W := (wit)<br />

14<br />

Apr 6, 2006 :: Tübingen

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!