Good (K-means) clusterings are unique (up to small perturbations) (Q2274925): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q278551
Created claim: Wikidata QID (P12): Q128421992, #quickstatements; #temporary_batch_1723507444692
 
(4 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Denis Nikolaevich Sidorov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jmva.2018.12.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2916659903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering under approximation stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Endogenously Formed Communities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sober Look at Clustering Stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Stable Instances Easy? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588236 / 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: Local equivalences of distances between clusterings -- a geometric perspective / 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: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Well-Clustered Graphs: Spectral Clustering Works! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral algorithm for learning mixture models / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128421992 / rank
 
Normal rank

Latest revision as of 10:14, 13 August 2024

scientific article
Language Label Description Also known as
English
Good (K-means) clusterings are unique (up to small perturbations)
scientific article

    Statements

    Good (K-means) clusterings are unique (up to small perturbations) (English)
    0 references
    0 references
    1 October 2019
    0 references
    Under the assumption that clustering with small K-means distortion is close to the optimal clustering, this paper reports that the distance \(d(X, X_{opt})\), for any K-clustering \(X\) whose cost is sufficiently low, can be bounded above by a value that depends only on known quantities.
    0 references
    K-means clustering
    0 references
    spectral clustering
    0 references
    cluster validation
    0 references
    model free
    0 references
    clusterability
    0 references

    Identifiers