Breaking the Small Cluster Barrier of Graph Clustering

@inproceedings{Ailon2013BreakingTS,
  title={Breaking the Small Cluster Barrier of Graph Clustering},
  author={Nir Ailon and Yudong Chen and Huan Xu},
  booktitle={ICML},
  year={2013}
}
This paper investigates graph clustering in the planted cluster model in the presence of small clusters. Traditional results dictate that for an algorithm to provably correctly recover the clusters, all clusters must be sufficiently large (in particular, Ω̃( √ n) where n is the number of nodes of the graph). We show that this is not really a restriction: by a more refined analysis of the trace-norm based matrix recovery approach proposed in Jalali et al. [2011] and Chen et al. [2012], we prove… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…