Guaranteed clustering and biclustering via semidefinite programming

16 February 2012

Papers citing "Guaranteed clustering and biclustering via semidefinite programming"

11 / 11 papers shown

Title
A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental Limits Doyeon Kim Jeonghwa Lee Hye Won Chung 58 3 0 19 Nov 2021
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 38 86 0 16 May 2020
Goodness-of-fit Test for Latent Block Models C. Watanabe Taiji Suzuki 47 5 0 10 Jun 2019
Convex optimization for the densest subgraph and densest submatrix problems Polina Bombina Brendan P. W. Ames 44 9 0 05 Apr 2019
Exact Recovery in the Hypergraph Stochastic Block Model: a Spectral Algorithm Sam Cole Yizhe Zhu 14 27 0 16 Nov 2018
Evaluating Overfit and Underfit in Models of Network Community Structure Amir Ghasemian Homa Hosseinmardi A. Clauset 42 142 0 28 Feb 2018
Exponential error rates of SDP for block models: Beyond Grothendieck's inequality Yingjie Fei Yudong Chen 35 35 0 23 May 2017
Learning Communities in the Presence of Errors K. Makarychev Yury Makarychev Aravindan Vijayaraghavan 27 32 0 10 Nov 2015
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes T. Tony Cai Xiaodong Li 61 139 0 23 Apr 2014
Recovery guarantees for exemplar-based clustering Abhinav Nellore Rachel A. Ward 77 36 0 12 Sep 2013
Improved Graph Clustering Yudong Chen Sujay Sanghavi Huan Xu 94 191 0 11 Oct 2012