Fetching the paper…
Reading the bibliography…
This paper considers the problem of clustering a partially observed unweighted graph---i.e., one where for some node pairs we know there is an edge between them, for some others we know there is no edge, and for the remaining we do not know whether or not there is an edge.
An efficient heuristic procedure for partitioning graphs
B. W. Kernighan and S. Lin · 1970
Earlier work this paper cites.
Stochastic blockmodels: Some first steps
P. W. Holland, K. B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
Eigenvalues and graph bisection: An average-case analysis
R. B. Boppana · 1987
Earlier work this paper cites.
A database interface for clustering in large spatial databases
M. Ester, H. Kriegel, and X. Xu · 1995
Earlier work this paper cites.
Finding a large hidden clique in a random graph
N. Alon, M. Krivelevich, and B. Sudakov · 1998
Earlier work this paper cites.
The metropolis algorithm for graph bisection
M. Jerrum and G. B. Sorkin · 1998
Earlier work this paper cites.
Information-theoretic determination of minimax rates of convergence
Y. Yang and A. Barron · 1999
Earlier work this paper cites.
Hill-climbing finds random planted bisections
T. Carson and R. Impagliazzo · 2001
Earlier work this paper cites.
Algorithms for graph partitioning on the planted partition model
A. Condon and R. M. Karp · 2001
Earlier work this paper cites.
Heuristics for semirandom graph problems
U. Feige and J. Kilian · 2001
Earlier work this paper cites.
Spectral partitioning of random graphs
F. McSherry · 2001
Earlier work this paper cites.
Correlation clustering
N. Bansal, A. Blum, and S. Chawla · 2002
Earlier work this paper cites.
Matrix Rank Minimization with Applications
M. Fazel · 2002
Earlier work this paper cites.
Clustering with qualitative information
M. Charikar, V. Guruswami, and A. Wirth · 2003
Earlier work this paper cites.
Correlation clustering with partial information
E. D. Demaine and N. Immorlica · 2003
Earlier work this paper cites.
Correlation clustering minimizing disagreements on arbitrary weighted graphs
D. Emmanuel and A. Fiat · 2003
Earlier work this paper cites.
Max cut for random graphs with a planted partition
B. Bollobás and A. D. Scott · 2004
Cited alongside, same era.
Correlation clustering: maximizing agreements via semidefinite programming
C. Swamy · 2004
Cited alongside, same era.
Reconstructing many partitions using spectral techniques
J. Giesen and D. Mitsche · 2005
Cited alongside, same era.
Correlation clustering in general weighted graphs
E. D. Demaine, D. Emanuel, A. Fiat, and N. Immorlica · 2006
Cited alongside, same era.
Clustering social networks
N. Mishra, I. Stanton R. Schreiber, and R. E. Tarjan · 2007
Cited alongside, same era.
Improved algorithms for the random cluster graph model
R. Shamir and D. Tsur · 2007
Cited alongside, same era.
Nuclear norm minimization for the planted clique and biclique problems
B. Ames and S. Vavasis · 2011
Closest in time.
Robust principal component analysis?
E. Candès, X. Li, Y. Ma, and J. Wright · 2011
Closest in time.
Rank-sparsity incoherence for matrix decomposition
V. Chandrasekaran, S. Sanghavi, P. Parrilo, and A. Willsky · 2011
Closest in time.
Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová · 2011
Closest in time.
B. Eriksson, G. Dasarathy, A. Singh, and R. Nowak · 2011
Closest in time.
Recovering low-rank matrices from few coefficients in any basis
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
U. von Luxburg · 2007
Cited alongside, same era.
Exact matrix completion via convex optimization
E. Candès and B. Recht · 2009
Cited alongside, same era.
The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices
Z. Lin, M. Chen, L. Wu, and Y. Ma · 2009
Cited alongside, same era.
Graph partitioning
Yahoo!-Inc · 2009
Cited alongside, same era.
Robust hierarchical clustering
M. F. Balcan and P. Gupta · 2010
Cited alongside, same era.
Spectral clustering with compressed, incomplete and inaccurate measurements
B. Hunter and T. Strohmer · 2010
Cited alongside, same era.
D. Gross · 2011
Closest in time.
Robust matrix decomposition with sparse corruptions
D. Hsu, S. M. Kakade, and T. Zhang · 2011
Closest in time.
Finding dense clusters via low rank + sparse decomposition
S. Oymak and B. Hassibi · 2011
Closest in time.
Spectral clustering and the high-dimensional stochastic blockmodel
K. Rohe, S. Chatterjee, and B. Yu · 2011
Closest in time.
Spectral clustering on a budget
O. Shamir and N. Tishby · 2011
Closest in time.
Spectral clustering of graphs with general degrees in the extended planted partition model
K. Chaudhuri, F. Chung, and A. Tsiatas · 2012
Closest in time.
Efficient active algorithms for hierarchical clustering
A. Krishnamurthy, S. Balakrishnan, M. Xu, and A. Singh · 2012
Closest in time.
User-friendly tail bounds for sums of random matrices
J. A. Tropp · 2012
Closest in time.
Low-rank matrix recovery from errors and erasures
Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis · 2013
Closest in time.
Compressed sensing and matrix completion with constant proportion of corruptions
X. Li · 2013
Closest in time.