Breaking the Small Cluster Barrier of Graph Clustering

v1v2 (latest)

Breaking the Small Cluster Barrier of Graph Clustering

19 February 2013

ArXiv (abs)PDF HTML

Papers citing "Breaking the Small Cluster Barrier of Graph Clustering"

11 / 11 papers shown

Title
Near-Optimal Joint Object Matching via Convex Relaxation Yuxin Chen Leonidas Guibas Qi-Xing Huang 201 142 0 06 Feb 2014
Improved Graph Clustering Yudong Chen Sujay Sanghavi Huan Xu 197 190 0 11 Oct 2012
Efficient Active Algorithms for Hierarchical Clustering A. Krishnamurthy Sivaraman Balakrishnan Min Xu Aarti Singh 83 88 0 18 Jun 2012
Clustering using Max-norm Constrained Optimization A. Jalali Nathan Srebro 77 32 0 25 Feb 2012
Active Learning Using Smooth Relative Regret Approximations with Applications Nir Ailon Ron Begleiter Esther Ezra 107 24 0 10 Oct 2011
Finding Dense Clusters via "Low Rank + Sparse" Decomposition Samet Oymak B. Hassibi GNN 157 57 0 27 Apr 2011
Clustering Partially Observed Graphs via Convex Optimization Yudong Chen A. Jalali Sujay Sanghavi Huan Xu 149 179 0 25 Apr 2011
Active Clustering: Robust and Efficient Hierarchical Clustering using Adaptively Selected Similarities Brian Eriksson Gautam Dasarathy Aarti Singh Robert D. Nowak 90 72 0 18 Feb 2011
Robust PCA via Outlier Pursuit Huan Xu Constantine Caramanis Sujay Sanghavi 104 768 0 20 Oct 2010
Spectral clustering and the high-dimensional stochastic blockmodel Karl Rohe S. Chatterjee Bin Yu 261 936 0 09 Jul 2010
Rank-Sparsity Incoherence for Matrix Decomposition V. Chandrasekaran Sujay Sanghavi P. Parrilo A. Willsky CML 250 1,111 0 11 Jun 2009

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.