Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1411.2021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Algorithms for Unique Games and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549617 / 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: Center-based clustering under perturbation stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof of a theorem of Johnson and Lindenstrauss / 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: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note On Spectral Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Cheeger's inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-way spectral partitioning and higher-order cheeger inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many sparse cuts via higher eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting noisy data with partial information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsest cuts and bottlenecks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effectiveness of lloyd-type methods for the k-means problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning into Expanders / 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: Q4358811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the multicommodity flow barrier for o(√log n)-approximations to sparsest cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sparsification by Effective Resistances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Sparsification of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple SVD Algorithm for Finding Hidden Partitions / rank
 
Normal rank

Latest revision as of 22:18, 13 July 2024

scientific article; zbMATH DE number 6724221
Language Label Description Also known as
English
Partitioning Well-Clustered Graphs: Spectral Clustering Works!
scientific article; zbMATH DE number 6724221

    Statements

    Partitioning Well-Clustered Graphs: Spectral Clustering Works! (English)
    0 references
    0 references
    0 references
    0 references
    30 May 2017
    0 references
    graph partitioning
    0 references
    spectral clustering
    0 references
    \(k\)-means
    0 references
    heat kernel
    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
    0 references
    0 references