Clustering Large Graphs via the Singular Value Decomposition.
We consider the problem of partitioning a set of m points in the n-dimensional Euclidean space into k clusters (usually m and n are variable, while k is fixed), so as to minimize the sum of squared distances between each point and its cluster center. This formulation is usually the objective of the...
| Veröffentlicht in: | Machine learning. 56, 1-3 (2004). |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | English |
| Schlagworte: |