A unified framework for spectral clustering in sparse graphs.
Lorenzo Dall'AmicoRomain CouilletNicolas TremblayPublished in: CoRR (2020)
Keyphrases
- spectral clustering
- graph partitioning
- graph clustering
- graph construction
- spectral methods
- laplacian matrix
- low rank approximation
- similarity matrix
- data clustering
- eigenvalue decomposition
- clustering method
- pairwise
- similarity graph
- affinity matrix
- eigendecomposition
- low rank representation
- constrained spectral clustering
- clustering algorithm
- high dimensional
- evolutionary clustering
- k means
- directed graph
- nonnegative matrix factorization
- image segmentation
- graph matching
- normalized cut
- graph kernels
- graph laplacian
- sparse representation
- bipartite graph
- pairwise constraints
- negative matrix factorization
- graph structure
- semi supervised
- graph mining
- computer vision