Clustering from Sparse Pairwise Measurements

H. Kesten and B. P. Stigum, “A limit theorem for multidimensional galton-watson processes,” The Annals of Mathematical Statistics , vol. 37, no. 5, pp. 1211–1223, 1966

1966

Earlier work this paper cites.

——, “Additional limit theorems for indecomposable multidimensional galton-watson processes,” Ann. Math. Statist. , vol. 37, no. 6, pp. 1463–1481, 12 1966

1966

Earlier work this paper cites.

D. Achlioptas and F. McSherry, “Fast computation of low rank matrix approximations,” in Proceedings of the thirty-third annual ACM symposium on Theory of computing . ACM, 2001, pp. 611–618

2001

Earlier work this paper cites.

J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Bethe free energy, kikuchi approximations, and belief propagation algorithms,” Advances in neural information processing systems , vol. 13, 2001

2001

Earlier work this paper cites.

M. Mézard and A. Montanari, “Reconstruction on trees and spin glass transition,” Journal of statistical physics , vol. 124, no. 6, pp. 1317–1350, 2006

2006

Earlier work this paper cites.

U. Luxburg, “A tutorial on spectral clustering,” Statistics and Computing , vol. 17, no. 4, p. 395, 2007

2007

Earlier work this paper cites.

R. G. Gomes, P. Welinder, A. Krause, and P. Perona, “Crowdclustering,” in Advances in neural information processing systems , 2011, p. 558

2011

Earlier work this paper cites.

A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, “Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications,” Phys. Rev. E , vol. 84, no. 6, p. 066106, 2011

2011

Earlier work this paper cites.

S. Heimlicher, M. Lelarge, and L. Massoulié, “Community detection in the labelled stochastic block model,” 09 2012. [Online]. Available: http://arxiv.org/abs/1209.2910

Original

2012

Cited alongside, same era.

J. Yi, R. Jin, A. K. Jain, and S. Jain, “Crowdclustering with sparse pairwise labels: A matrix completion approach,” in AAAI Workshop on Human Computation , vol. 2, 2012

2012

Cited alongside, same era.

E. Mossel, J. Neeman, and A. Sly, “Stochastic block models and reconstruction,” arXiv preprint arXiv:1202.1499 , 2012

Original

2012

Cited alongside, same era.

M. Lelarge, L. Massoulie, and J. Xu, “Reconstruction in the labeled stochastic block model,” in Information Theory Workshop (ITW), 2013 IEEE , Sept 2013, pp. 1–5

2013

Cited alongside, same era.

L. Massoulie, “Community detection thresholds and the weak ramanujan property,” arXiv preprint arXiv:1311.3085 , 2013

E. Abbe, A. S. Bandeira, A. Bracher, and A. Singer, “Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery,” arXiv:1404.4749 , 2014

Original

2014

Later among the works it cites.

A. Saade, F. Krzakala, and L. Zdeborová, “Spectral clustering of graphs with the bethe hessian,” in Advances in Neural Information Processing Systems , 2014, pp. 406–414

2014

Later among the works it cites.

V. Jog and P.-L. Loh, “Information-theoretic bounds for exact recovery in weighted stochastic block models using the renyi divergence,” arXiv preprint arXiv:1509.06418 , 2015

Original

2015

Later among the works it cites.

Y. Chen, C. Suh, and A. Goldsmith, “Information recovery from pairwise measurements: A shannon-theoretic approach,” in Information Theory, 2015 IEEE International Symposium on , 2015, p. 2336

2015

Later among the works it cites.