Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE

23 March 2020

Papers citing "Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE"

11 / 11 papers shown

Title
Community Detection for Hypergraph Networks via Regularized Tensor Power Iteration Z. Ke Feng Shi Dong Xia 39 75 0 14 Sep 2019
Ultra Fast Medoid Identification via Correlated Sequential Halving Tavor Z. Baharav David Tse FedML 34 23 0 11 Jun 2019
Community detection in the sparse hypergraph stochastic block model Soumik Pal Yizhe Zhu 48 35 0 11 Apr 2019
Stochastic Block Model for Hypergraphs: Statistical limits and a semidefinite programming approach Chiheon Kim Afonso S. Bandeira M. Goemans 59 55 0 08 Jul 2018
Exponential error rates of SDP for block models: Beyond Grothendieck's inequality Yingjie Fei Yudong Chen 295 35 0 23 May 2017
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes T. Tony Cai Xiaodong Li 211 141 0 23 Apr 2014
Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices Yudong Chen Jiaming Xu 235 216 0 06 Feb 2014
Consistency of spectral clustering in stochastic block models Jing Lei Alessandro Rinaldo 185 607 0 07 Dec 2013
Improved Graph Clustering Yudong Chen Sujay Sanghavi Huan Xu 194 190 0 11 Oct 2012
Finding Dense Clusters via "Low Rank + Sparse" Decomposition Samet Oymak B. Hassibi GNN 157 57 0 27 Apr 2011
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization Benjamin Recht Maryam Fazel P. Parrilo 416 3,768 0 28 Jun 2007