Clustering partially observed graphs via convex optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6781370
- Iterative and active graph clustering using trace norm minimization without cluster size constraints
- Convex optimization for the planted \(k\)-disjoint-clique problem
- Exact clustering of weighted graphs via semidefinite programming
- Reconstruction and estimation in the planted partition model
Cited in
(21)- Convex optimization for the densest subgraph and densest submatrix problems
- Convex relaxation methods for community detection
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
- Certifiably optimal sparse principal component analysis
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Convex optimization for the planted \(k\)-disjoint-clique problem
- Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
- Using side information to reliably learn low-rank matrices from missing and corrupted observations
- Exact clustering of weighted graphs via semidefinite programming
- Guaranteed clustering and biclustering via semidefinite programming
- scientific article; zbMATH DE number 7306912 (Why is no real title available?)
- scientific article; zbMATH DE number 7164697 (Why is no real title available?)
- Iterative and active graph clustering using trace norm minimization without cluster size constraints
- k-median: exact recovery in the extended stochastic ball model
- Clustering heterogeneous financial networks
- The Lovász theta function for recovering planted clique covers and graph colorings
- Co-Factor Analysis of Citation Networks
- Fair community detection and structure learning in heterogeneous graphical models
- Community detection in sparse networks via Grothendieck's inequality
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation
This page was built for publication: Clustering partially observed graphs via convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934076)
