Refining a k-nearest neighbor graph for a computationally efficient spectral clustering.
Mashaan A. AlshammariJohn StavrakakisMasahiro TakatsukaPublished in: CoRR (2023)
Keyphrases
- spectral clustering
- computationally efficient
- data clustering
- clustering method
- pairwise
- k means
- image segmentation
- evolutionary clustering
- clustering algorithm
- similarity matrix
- eigendecomposition
- graph laplacian
- pairwise constraints
- affinity matrix
- computational complexity
- negative matrix factorization
- nonnegative matrix factorization
- normalized cut
- graph partitioning
- spectral methods
- clustering quality