Sharp performance bounds for graph clustering via convex optimization.
Ramya Korlakai VinayakSamet OymakBabak HassibiPublished in: ICASSP (2014)
Keyphrases
- convex optimization
- graph clustering
- clustering method
- bipartite graph
- network analysis
- community detection
- total variation
- lower bound
- convex optimization problems
- weighted graph
- spectral clustering
- clustering algorithm
- link prediction
- worst case
- biological networks
- normalized cut
- image restoration
- graph partitioning
- edge weights
- image processing