Refining a k-nearest neighbor graph for a computationally efficient spectral clustering.
Mashaan A. AlshammariJohn StavrakakisMasahiro TakatsukaPublished in: Pattern Recognit. (2021)
Keyphrases
- spectral clustering
- computationally efficient
- pairwise
- clustering method
- data clustering
- k means
- constrained spectral clustering
- graph laplacian
- similarity matrix
- image segmentation
- graph partitioning
- clustering quality
- negative matrix factorization
- eigendecomposition
- spectral methods
- alternative clusterings
- data mining
- normalized cut
- graph clustering
- label propagation
- constrained clustering
- affinity matrix
- evolutionary clustering
- co occurrence
- computational complexity
- computer vision