Noisy, Greedy and Not so Greedy k-Means++ (Q5874485): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Adaptive Sampling for k-Means Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms / 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: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bound instances for \(k\)-means++ in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bad instance for \texttt{k-means++} / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for approximating and clustering data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Yields a PTAS for $k$-Means in Doubling Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search approximation algorithm for \(k\)-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved and simplified inapproximability for \(k\)-means / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noisy, Greedy and Not so Greedy k-Means++ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar k-Means Problem is NP-Hard / rank
 
Normal rank

Latest revision as of 11:07, 31 July 2024

scientific article; zbMATH DE number 7651157
Language Label Description Also known as
English
Noisy, Greedy and Not so Greedy k-Means++
scientific article; zbMATH DE number 7651157

    Statements

    Identifiers