Fetching the paper…
Reading the bibliography…
Identifying clusters of similar objects in data plays a significant role in a wide range of applications.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1962
Earlier work this paper cites.
A limit theorem for the norm of random matrices
S. Geman · 1980
Earlier work this paper cites.
The eigenvalues of random symmetric matrices
Z. Füredi and J. Komlós · 1981
Earlier work this paper cites.
On the douglas—rachford splitting method and the proximal point algorithm for maximal monotone operators
Jonathan Eckstein and Dimitri P Bertsekas · 1992
Earlier work this paper cites.
Matrix computations
G. Golub and C. Van Loan · 1996
Earlier work this paper cites.
Convex analysis
R.T. Rockafellar · 1997
Earlier work this paper cites.
Nonmonotone spectral projected gradient methods on convex sets
E. Birgin, J. Martínez, and M. Raydan · 2000
Earlier work this paper cites.
On spectral clustering: Analysis and an algorithm
A. Ng, M. Jordan, and Y. Weiss · 2002
Earlier work this paper cites.
Improved algorithms for the random cluster graph model
R. Shamir and D. Tsur · 2002
Earlier work this paper cites.
Correlation clustering
N. Bansal, A. Blum, and S. Chawla · 2004
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
On clusterings: Good, bad and spectral
R. Kannan, S. Vempala, and A. Vetta · 2004
Earlier work this paper cites.
Decoding by linear programming
E. Candès and T. Tao · 2005
Earlier work this paper cites.
Survey of clustering data mining techniques
P. Berkhin · 2006
Earlier work this paper cites.
Stable signal recovery from incomplete and inaccurate measurements
E. Candès, J. Romberg, and T. Tao · 2006
Earlier work this paper cites.
Compressed sensing
D. Donoho · 2006
Cited alongside, same era.
The effectiveness of Lloyd-type methods for the k-means problem
R. Ostrovsky, Y. Rabani, L. Schulman, and C. Swamy · 2006
Cited alongside, same era.
Approximating k-means-type clustering via semidefinite programming
J. Peng and Y. Wei · 2007
Cited alongside, same era.
Biclustering in data mining
S. Busygin, O. Prokopyev, and P. Pardalos · 2008
Cited alongside, same era.
Probing the pareto frontier for basis pursuit solutions
E. Van Den Berg and M. Friedlander · 2008
Cited alongside, same era.
Clusterability: A theoretical study
M. Ackerman and S. Ben-David · 2009
Cited alongside, same era.
Np-hardness of euclidean sum-of-squares clustering
Ensemble clustering using semidefinite programming with applications
V. Singh, L. Mukherjee, J. Peng, and J. Xu · 2010
Later among the works it cites.
Polyhedral and semidefinite programming methods in combinatorial optimization
L. Tunçel · 2010
Later among the works it cites.
Nuclear norm minimization for the planted clique and biclique problems
B. Ames and S. Vavasis · 2011
Later among the works it cites.
Noise thresholds for spectral clustering
S. Balakrishnan, M. Xu, A. Krishnamurthy, and A. Singh · 2011
Later among the works it cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein · 2011
Later among the works it cites.
Recovering low-rank matrices from few coefficients in any basis
D. Gross · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Aloise, A. Deshpande, P. Hansen, and P. Popat · 2009
Cited alongside, same era.
Exact matrix completion via convex optimization
E. Candès and B. Recht · 2009
Cited alongside, same era.
Convex optimization for the planted k-disjoint-clique problem
B. Ames and S. Vavasis · 2010
Cited alongside, same era.
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
E. Candès and Y. Plan · 2010
Cited alongside, same era.
Recent advances of data biclustering with application in computational neuroscience
N. Fan, N. Boyko, and P. Pardalos · 2010
Cited alongside, same era.
Penalty decomposition methods for rank minimization
Z. Lu and Y. Zhang · 2010
Cited alongside, same era.
Later among the works it cites.
Clustering partially observed graphs via convex optimization
A. Jalali, Y. Chen, S. Sanghavi, and H. Xu · 2011
Later among the works it cites.
Minimax localization of structural information in large noisy matrices
M. Kolar, S. Balakrishnan, A. Rinaldo, and A. Singh · 2011
Later among the works it cites.
Finding dense clusters via “low rank + sparse” decomposition
S. Oymak and B. Hassibi · 2011
Later among the works it cites.
A simplified approach to recovery conditions for low rank matrices
S. Oymak, K. Mohan, M. Fazel, and B. Hassibi · 2011
Later among the works it cites.
A simpler approach to matrix completion
B. Recht · 2011
Later among the works it cites.
Spectral clustering and the high-dimensional stochastic blockmodel
K. Rohe, S. Chatterjee, and B. Yu · 2011
Later among the works it cites.
Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
N. Fan and P. Pardalos · 2012
Closest in time.
C. Flynn and P. Perry · 2012
Closest in time.
Co-clustering for directed graphs; the stochastic co-blockmodel and a spectral algorithm
K. Rohe and B. Yu · 2012
Closest in time.