A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering.

Vincent Cohen-Addad Tommaso d'Orsi Aida Mousavifar

Published in: CoRR (2024)

Keyphrases

worst case
graph clustering
np hard
learning algorithm
k means
approximation algorithms
clustering method
objective function
lower bound
computational complexity
special case
probabilistic model
expectation maximization
itemsets
segmentation method
euclidean space