Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering.
Lorenzo OrecchiaKonstantinos AmeranisCharalampos E. TsourakakisKunal TalwarPublished in: ICML (2022)
Keyphrases
- approximation algorithms
- graph clustering
- worst case
- np hard
- special case
- vertex cover
- minimum cost
- network analysis
- bipartite graph
- weighted graph
- community detection
- lower bound
- constant factor
- clustering method
- randomized algorithms
- undirected graph
- approximation ratio
- greedy algorithm
- clustering algorithm
- k means
- pairwise
- link prediction
- constant factor approximation
- normalized cut
- biological networks
- machine learning
- upper bound
- objective function
- training data
- image processing