Achieving exact cluster recovery threshold via semidefinite programming under the stochastic block model
暂无分享,去创建一个
Bruce E. Hajek | Jiaming Xu | Yihong Wu | B. Hajek | Yihong Wu | Jiaming Xu
[1] Babak Hassibi,et al. Sharp performance bounds for graph clustering via convex optimization , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[2] Roman Vershynin,et al. Community detection in sparse networks via Grothendieck’s inequality , 2014, Probability Theory and Related Fields.
[3] Yudong Chen,et al. Clustering Partially Observed Graphs via Convex Optimization , 2011, ICML.
[4] Emmanuel Abbe,et al. Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms , 2015, ArXiv.
[5] Elchanan Mossel,et al. Reconstruction and estimation in the planted partition model , 2012, Probability Theory and Related Fields.
[6] Frank McSherry,et al. Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[7] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[8] Elizaveta Levina,et al. On semidefinite relaxations for the block model , 2014, ArXiv.
[9] Uriel Feige,et al. Heuristics for Semirandom Graph Problems , 2001, J. Comput. Syst. Sci..
[10] Alexander S. Wein,et al. A semidefinite program for unbalanced multisection in the stochastic block model , 2017, 2017 International Conference on Sampling Theory and Applications (SampTA).
[11] Bruce E. Hajek,et al. Achieving exact cluster recovery threshold via semidefinite programming , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[12] Bruce E. Hajek,et al. Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions , 2015, IEEE Transactions on Information Theory.
[13] Alexandra Kolla,et al. Multisection in the Stochastic Block Model using Semidefinite Programming , 2015, ArXiv.
[14] Alexandre Proutière,et al. Accurate Community Detection in the Stochastic Block Model via Spectral Algorithms , 2014, ArXiv.
[15] Babak Hassibi,et al. Finding Dense Clusters via "Low Rank + Sparse" Decomposition , 2011, ArXiv.
[16] Amit Singer,et al. Decoding Binary Node Labels from Censored Edge Measurements: Phase Transition and Efficient Recovery , 2014, IEEE Transactions on Network Science and Engineering.
[17] Cristopher Moore,et al. Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.
[18] Yudong Chen,et al. Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices , 2014, J. Mach. Learn. Res..
[19] Richard M. Karp,et al. Algorithms for graph partitioning on the planted partition model , 2001, Random Struct. Algorithms.
[20] R. Srikant,et al. Jointly clustering rows and columns of binary matrices: algorithms and trade-offs , 2013, SIGMETRICS '14.
[21] Andrea Montanari,et al. Semidefinite Programs on Sparse Random Graphs , 2015, ArXiv.
[22] Stephen A. Vavasis,et al. Convex optimization for the planted k-disjoint-clique problem , 2010, Math. Program..
[23] Xiaodong Li,et al. Robust and Computationally Feasible Community Detection in the Presence of Arbitrary Outlier Nodes , 2014, ArXiv.
[24] Laurent Massoulié,et al. Community detection thresholds and the weak Ramanujan property , 2013, STOC.
[25] Kathryn B. Laskey,et al. Stochastic blockmodels: First steps , 1983 .
[26] Alan M. Frieze,et al. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.
[27] Stephen A. Vavasis,et al. Nuclear norm minimization for the planted clique and biclique problems , 2009, Math. Program..
[28] Emmanuel Abbe,et al. Exact Recovery in the Stochastic Block Model , 2014, IEEE Transactions on Information Theory.
[29] Babak Hassibi,et al. Graph Clustering With Missing Data: Convex Algorithms and Analysis , 2014, NIPS.