Self-Organizing Maps, Principal Components and Non-negative ...
Self-Organizing Maps, Principal Components and Non-negative ...
Self-Organizing Maps, Principal Components and Non-negative ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Self</strong> <strong>Organizing</strong> <strong>Maps</strong><br />
<strong>Principal</strong> <strong>Components</strong>, Curves <strong>and</strong> Surfaces<br />
<strong>Non</strong>-<strong>negative</strong> Matrix Factorization<br />
<strong>Principal</strong> <strong>Components</strong><br />
<strong>Principal</strong> Curves<br />
Spectral Clustering<br />
=⇒ graph-partition problem (we identify connected<br />
components with clusters)<br />
Partition of the graph, such that edges between different<br />
groups have low weight und within a group have high weight.<br />
idea: construction of similarity graphs that represent the local<br />
neighborhood relationships between the observations.<br />
Karoline Geissler <strong>Self</strong>-<strong>Organizing</strong> <strong>Maps</strong>, <strong>Principal</strong> <strong>Components</strong> <strong>and</strong> <strong>Non</strong>-<strong>negative</strong> M
Change language