Pass-Efficient Algorithms for Graph Spectral Clustering (Student Abstract).
Boshen YanGuihong WanHaim SchweitzerZoltan MaligaSara KhattabKun-Hsing YuPeter K. SorgerYevgeniy R. SemenovPublished in: AAAI (2024)
Keyphrases
- spectral clustering
- graph laplacian
- graph partitioning
- graph construction
- normalized cut
- similarity matrix
- laplacian matrix
- graph clustering
- label propagation
- similarity graph
- data clustering
- spectral methods
- pairwise
- clustering method
- k means
- constrained spectral clustering
- affinity matrix
- pairwise similarities
- image segmentation
- graph representation
- clustering algorithm
- evolutionary clustering
- adjacency matrix
- learning process
- random walk
- directed graph
- co occurrence
- eigendecomposition
- alternative clusterings
- weighted graph
- graph structure
- graph model
- learning algorithm
- training data
- constrained clustering
- graph structures
- manifold structure
- maximum likelihood
- pairwise constraints
- mean shift