- Tytuł:
- Constrained spectral clustering via multi-layer graph embeddings on a Grassmann manifold
- Autorzy:
-
Trokicić, Aleksandar
Todorović, Branimir - Powiązania:
- https://bibliotekanauki.pl/articles/329780.pdf
- Data publikacji:
- 2019
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
spectral clustering
constrained clustering
multilayer graph
Grassmann manifold
Nyström method
Laplacian matrix
grupowanie widmowe
graf wielowarstwowy
metoda Nyströma
macierz Laplaciana - Opis:
- We present two algorithms in which constrained spectral clustering is implemented as unconstrained spectral clustering on a multi-layer graph where constraints are represented as graph layers. By using the Nystrom approximation in one of the algorithms, we obtain time and memory complexities which are linear in the number of data points regardless of the number of constraints. Our algorithms achieve superior or comparative accuracy on real world data sets, compared with the existing state-of-the-art solutions. However, the complexity of these algorithms is squared with the number of vertices, while our technique, based on the Nyström approximation method, has linear time complexity. The proposed algorithms efficiently use both soft and hard constraints since the time complexity of the algorithms does not depend on the size of the set of constraints.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2019, 29, 1; 125-137
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł