The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties (Q6092504): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1111/itor.12808 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Adaptive Sampling for k-Means Clustering / 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: An output‐oriented classification of multiple attribute decision‐making techniques based on fuzzy <i>c</i>‐means clustering method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good Clusterings Have Large Volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse $k$-Means with $\ell_{\infty}/\ell_0$ Penalty for High-Dimensional Data Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering large graphs via the singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the \(k\)-means problem with penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / 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: K-means method for rough classification of R&amp;D employees' performance evaluation / 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: The Parallel Seeding Algorithm for k-Means Problem with Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The seeding algorithm for \(k\)-means problem with penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3132643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search approximation algorithms for the \(k\)-means problem with penalties / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1111/ITOR.12808 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:21, 30 December 2024

scientific article; zbMATH DE number 7769611
Language Label Description Also known as
English
The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties
scientific article; zbMATH DE number 7769611

    Statements

    The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties (English)
    0 references
    23 November 2023
    0 references
    approximation algorithm
    0 references
    \(k\)-means
    0 references
    \(k\)-means problem with penalties
    0 references
    parallel seeding algorithm
    0 references

    Identifiers