Convex programming based spectral clustering
From MaRDI portal
Publication:2051294
DOI10.1007/s10994-020-05940-1OpenAlexW2800411455MaRDI QIDQ2051294
Publication date: 24 November 2021
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.04246
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral clustering and the high-dimensional stochastic blockmodel
- Sparsest cuts and bottlenecks in graphs
- Minimum-volume enclosing ellipsoids and core sets
- NP-hardness of Euclidean sum-of-squares clustering
- Spectral concentration and greedy \(k\)-clustering
- Consistency of spectral clustering in stochastic block models
- Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separation
- Introduction to Information Retrieval
- On clusterings
- The Planar k-Means Problem is NP-Hard
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- How to Round Subspaces: A New Spectral Clustering Algorithm
- A Note On Spectral Clustering
- Least squares quantization in PCM
- Rounding of Polytopes in the Real Number Model of Computation
- Partitioning into Expanders
- The effectiveness of lloyd-type methods for the k-means problem
- Computing a nonnegative matrix factorization -- provably
- Multi-way spectral partitioning and higher-order cheeger inequalities
- Improved Cheeger's inequality
- Lower Bounds for the Partitioning of Graphs
- Partitioning Well-Clustered Graphs: Spectral Clustering Works!
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication: Convex programming based spectral clustering