Clustering partially observed graphs via convex optimization

zbMATH Open1319.62123MaRDI QIDQ2934076FDOQ2934076

Authors: Yudong Chen, Ali A. Jalali, Sujay Sanghavi, Huan Xu 

Publication date: 8 December 2014

Full work available at URL: http://jmlr.csail.mit.edu/papers/v15/chen14a.html

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

zbMATH Keywords

graph clusteringconvex optimizationsparse and low-rank decomposition

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25)

Cited In (18)

• Certifiably optimal sparse principal component analysis
• Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
• Title not available (Why is that?)
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
• Convex optimization for the planted \(k\)-disjoint-clique problem
• Convex relaxation methods for community detection
• Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
• Clustering heterogeneous financial networks
• Using side information to reliably learn low-rank matrices from missing and corrupted observations
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
• Iterative and active graph clustering using trace norm minimization without cluster size constraints
• Title not available (Why is that?)
• Exact clustering of weighted graphs via semidefinite programming
• Convex optimization for the densest subgraph and densest submatrix problems
• \(k\)-median: exact recovery in the extended stochastic ball model
• Guaranteed clustering and biclustering via semidefinite programming
• 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)