scientific article
From MaRDI portal
Publication:2934076
zbMath1319.62123MaRDI QIDQ2934076
Yudong Chen, Ali A. Jalali, Huan Xu, Sujay Sanghavi
Publication date: 8 December 2014
Full work available at URL: http://jmlr.csail.mit.edu/papers/v15/chen14a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25)
Related Items
Unnamed Item, \(k\)-median: exact recovery in the extended stochastic ball model, Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation, Clustering heterogeneous financial networks, Convex optimization for the planted \(k\)-disjoint-clique problem, Guaranteed clustering and biclustering via semidefinite programming, Convex relaxation methods for community detection, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Convex optimization for the densest subgraph and densest submatrix problems, Community detection in sparse networks via Grothendieck's inequality, Certifiably optimal sparse principal component analysis, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Exact Clustering of Weighted Graphs via Semidefinite Programming, Unnamed Item, Unnamed Item, Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
