Grassmann Clustering
Grassmann Clustering
Grassmann Clustering
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 />
IV. <strong>Grassmann</strong> <strong>Clustering</strong><br />
Comparison<br />
• why? because NMF has<br />
high indeterminacy<br />
• minimality criterion<br />
seems to be a good<br />
idea<br />
• related:<br />
• [Cutler, Archetypal<br />
analysis, 1994]<br />
• [Theis, how to make<br />
NMF unique,in prep]<br />
Crosserror<br />
1.6<br />
1.4<br />
1.2<br />
1<br />
0.8<br />
0.6<br />
0.4<br />
0.2<br />
0<br />
10 1<br />
10 1<br />
10 2<br />
10 2<br />
10 3<br />
NMF (Mean Square Error)<br />
<strong>Grassmann</strong> clustering<br />
10 3<br />
Number of samples<br />
10 4<br />
10 4<br />
10 5<br />
10 5<br />
38<br />
1.6<br />
1.4<br />
1.2<br />
0.8<br />
0.6<br />
0.4<br />
0.2<br />
Apr 6, 2006 :: Tübingen<br />
1<br />
0
Change language