Finding Dense Clusters via "Low Rank + Sparse" Decomposition

R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins, “Extracting large-scale knowledge bases from the web.” In VLDB, 1999

1999

Earlier work this paper cites.

R.O. Duda, P.E. Hart and D.G. Stork, “Pattern Classification, 2nd ed.” John Wiley & Sons, Inc., New York, NY, USA, 2001

2001

Earlier work this paper cites.

P. Domingos and M. Richardson, “Mining the network value of customers.” KDD, pages 57�66, 2001

2001

Earlier work this paper cites.

N. Alon, M. Krivelevichy and V. H. Vu, “On the concentration of eigenvalues of random symmetric matrices.” Israel J. Math. 131 (2002), 259-267

2002

Cited alongside, same era.

V. H. Vu, “Spectral Norm of Random Matrices.” in Proc. of STOC, pages 423�430, 2005

2005

Cited alongside, same era.

S. E. Schaeffer. “Graph Clustering.” Computer Science Review 1(1): 27-64, 2007

2007

Cited alongside, same era.

E. J. Candès, J. Romberg and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information.” IEEE Trans. Inform. Theory, 52 489-509

Cited in the paper.

B. Ames and S. Vavasis, “Nuclear norm minimization for the planted clique and biclique problems.” arXiv:0901.3348v1

Original

Cited in the paper.

B. Ames and S. Vavasis, “Convex optimization for the planted k-disjoint-clique problem.” arXiv:1008.2814v2

Original

Cited in the paper.

E. J. Candes, X. Li, Y. Ma and J. Wright, “Robust Principal Component Analysis?” arXiv:0912.3599v1

Original

Cited in the paper.

V. Chandrasekaran, S. Sanghavi, P. A. Parrilo and A. S. Willsky, “Rank-Sparsity Incoherence for Matrix Decomposition.” arXiv:0906.2220v1

Original

Cited in the paper.

H. Xu, C. Caramanis and S. Sanghavi, “Robust PCA via Outlier Pursuit.” arXiv:1010.4237v2

Original

Cited in the paper.

A. Ganesh, J. Wright, X. Li, E. J. Candes and Y. Ma, “Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit.” arXiv:1001.2362v2

Original

Cited in the paper.

V. Chandrasekaran, P. A. Parrilo and A. S. Willsky, “Latent Variable Graphical Model Selection via Convex Optimization.” arXiv:1008.1290v1

Original

Cited in the paper.

E. J. Candès and J. Romberg, “Quantitative robust uncertainty principles and optimally sparse decompositions.” Found. of Comput. Math., 6 227-254

Cited in the paper.

N. Mishra, R. Schreiber, I. Stanton and R.E. Tarjan, “Clustering Social Networks.” in Proc. WAW, 2007, pp.56-67

2007

Later among the works it cites.

E. J. Candes and B. Recht, “Exact matrix completion via convex optimization.” Foundations of Computational Mathematics, 2009

2009

Later among the works it cites.