Pages that link to "Item:Q463740"

The following pages link to Guaranteed clustering and biclustering via semidefinite programming (Q463740):

Displaying 19 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← links)
• Goodness-of-fit test for latent block models (Q829718) (← links)
• Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
• Recovery guarantees for exemplar-based clustering (Q897656) (← links)
• A simple spectral algorithm for recovering planted partitions (Q1678989) (← links)
• Recovering nonuniform planted partitions via iterated projection (Q2002551) (← links)
• Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (Q2010139) (← links)
• Convex relaxation methods for community detection (Q2038282) (← links)
• Profile likelihood biclustering (Q2293724) (← links)
• Exact recovery in the hypergraph stochastic block model: a spectral algorithm (Q2310389) (← links)
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes (Q2352734) (← links)
• Efficient, certifiably optimal clustering with applications to latent variable graphical models (Q2425167) (← links)
• Exact Clustering of Weighted Graphs via Semidefinite Programming (Q4633040) (← links)
• Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization (Q4634103) (← links)
• (Q5053241) (← links)
• Finding the Largest Low-Rank Clusters With Ky Fan $2$-$k$-Norm and $\ell_1$-Norm (Q5743612) (← links)
• \(k\)-median: exact recovery in the extended stochastic ball model (Q6044983) (← links)
• Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate (Q6601549) (← links)