ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1202.3663
  4. Cited By
Guaranteed clustering and biclustering via semidefinite programming
v1v2v3v4v5v6 (latest)

Guaranteed clustering and biclustering via semidefinite programming

16 February 2012
Brendan P. W. Ames
ArXiv (abs)PDFHTML

Papers citing "Guaranteed clustering and biclustering via semidefinite programming"

23 / 23 papers shown
Title
A Worker-Task Specialization Model for Crowdsourcing: Efficient
  Inference and Fundamental Limits
A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental Limits
Doyeon Kim
Jeonghwa Lee
Hye Won Chung
114
3
0
19 Nov 2021
Reducibility and Statistical-Computational Gaps from Secret Leakage
Reducibility and Statistical-Computational Gaps from Secret Leakage
Matthew Brennan
Guy Bresler
99
91
0
16 May 2020
Learning with Semi-Definite Programming: new statistical bounds based on
  fixed point analysis and excess risk curvature
Learning with Semi-Definite Programming: new statistical bounds based on fixed point analysis and excess risk curvature
Stéphane Chrétien
Ning Zhang
Guillaume Lecué
Lucie Neirac
38
5
0
04 Apr 2020
Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE
Robust Hypergraph Clustering via Convex Relaxation of Truncated MLE
Jeonghwa Lee
Daesung Kim
Hye Won Chung
95
14
0
23 Mar 2020
Crowdsourced Labeling for Worker-Task Specialization Model
Crowdsourced Labeling for Worker-Task Specialization Model
Doyeon Kim
Hye Won Chung
FedML
58
1
0
21 Mar 2020
Unified $\ell_{2\rightarrow\infty}$ Eigenspace Perturbation Theory for
  Symmetric Random Matrices
Unified ℓ2→∞\ell_{2\rightarrow\infty}ℓ2→∞​ Eigenspace Perturbation Theory for Symmetric Random Matrices
Lihua Lei
66
9
0
11 Sep 2019
Goodness-of-fit Test for Latent Block Models
Goodness-of-fit Test for Latent Block Models
C. Watanabe
Taiji Suzuki
83
5
0
10 Jun 2019
Convex optimization for the densest subgraph and densest submatrix
  problems
Convex optimization for the densest subgraph and densest submatrix problems
Polina Bombina
Brendan P. W. Ames
69
9
0
05 Apr 2019
Community structure: A comparative evaluation of community detection
  methods
Community structure: A comparative evaluation of community detection methods
Vinh-Loc Dao
Cécile Bothorel
P. Lenca
84
62
0
14 Dec 2018
Exact Recovery in the Hypergraph Stochastic Block Model: a Spectral
  Algorithm
Exact Recovery in the Hypergraph Stochastic Block Model: a Spectral Algorithm
Sam Cole
Yizhe Zhu
68
27
0
16 Nov 2018
Convex Relaxation Methods for Community Detection
Convex Relaxation Methods for Community Detection
Xiaodong Li
Yudong Chen
Jiaming Xu
133
51
0
30 Sep 2018
Efficient, Certifiably Optimal Clustering with Applications to Latent
  Variable Graphical Models
Efficient, Certifiably Optimal Clustering with Applications to Latent Variable Graphical Models
Carson Eisenach
Han Liu
24
4
0
01 Jun 2018
Evaluating Overfit and Underfit in Models of Network Community Structure
Evaluating Overfit and Underfit in Models of Network Community Structure
Amir Ghasemian
Homa Hosseinmardi
A. Clauset
107
142
0
28 Feb 2018
Exponential error rates of SDP for block models: Beyond Grothendieck's
  inequality
Exponential error rates of SDP for block models: Beyond Grothendieck's inequality
Yingjie Fei
Yudong Chen
320
35
0
23 May 2017
Size Matters: Cardinality-Constrained Clustering and Outlier Detection
  via Conic Optimization
Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization
Napat Rujeerapaiboon
Kilian Schindler
Daniel Kuhn
W. Wiesemann
34
29
0
22 May 2017
Exact Clustering of Weighted Graphs via Semidefinite Programming
Exact Clustering of Weighted Graphs via Semidefinite Programming
Aleksis Pirinen
Brendan P. W. Ames
103
4
0
16 Mar 2016
Learning Communities in the Presence of Errors
Learning Communities in the Presence of Errors
K. Makarychev
Yury Makarychev
Aravindan Vijayaraghavan
194
33
0
10 Nov 2015
Information Limits for Recovering a Hidden Community
Information Limits for Recovering a Hidden Community
Bruce Hajek
Yihong Wu
Jiaming Xu
85
76
0
25 Sep 2015
Relax, no need to round: integrality of clustering formulations
Relax, no need to round: integrality of clustering formulations
Pranjal Awasthi
Afonso S. Bandeira
Moses Charikar
Ravishankar Krishnaswamy
Soledad Villar
Rachel A. Ward
181
114
0
18 Aug 2014
Robust and computationally feasible community detection in the presence
  of arbitrary outlier nodes
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
T. Tony Cai
Xiaodong Li
241
141
0
23 Apr 2014
Statistical-Computational Tradeoffs in Planted Problems and Submatrix
  Localization with a Growing Number of Clusters and Submatrices
Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
Yudong Chen
Jiaming Xu
298
216
0
06 Feb 2014
Recovery guarantees for exemplar-based clustering
Recovery guarantees for exemplar-based clustering
Abhinav Nellore
Rachel A. Ward
148
36
0
12 Sep 2013
Improved Graph Clustering
Improved Graph Clustering
Yudong Chen
Sujay Sanghavi
Huan Xu
241
190
0
11 Oct 2012
1