Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1806.11429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community Detection and Stochastic Block Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Recovery in the Stochastic Block Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite relaxations for the block model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relax, No Need to Round / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Spectral-Norm Bounds for Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Laplacian matrices and convex relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diffusion maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rotation of Eigenvectors by a Perturbation. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probably certifiably correct \(k\)-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of spectral clustering in stochastic block models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4595047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When do birds of a feather flock together? \(k\)-means, proximity, and conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar k-Means Problem is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering subgaussian mixtures by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating K‐means‐type Clustering via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral clustering and the high-dimensional stochastic blockmodel / rank
 
Normal rank
Property / cites work
 
Property / cites work: From graph to manifold Laplacian: the convergence rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral convergence of the connection Laplacian from random samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4614130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variational approach to the consistency of spectral clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: User-friendly tail bounds for sums of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of spectral clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838091 / rank
 
Normal rank

Latest revision as of 22:02, 22 July 2024

scientific article
Language Label Description Also known as
English
Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
scientific article

    Statements

    Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (English)
    0 references
    0 references
    0 references
    15 June 2020
    0 references
    semidefinite programming
    0 references
    graph partition
    0 references
    unsupervised learning
    0 references
    spectral clustering
    0 references
    community detection
    0 references
    graph Laplacian
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references