A local search approximation algorithm for \(k\)-means clustering (Q598232): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.comgeo.2004.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4236385439 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q105988026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accounting for boundary effects in nearest-neighbor searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search heuristic for k-median and facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Implications of Interactive Graphic Computer Systems for Data Analysis and Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centroidal Voronoi Tessellations: Applications and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4271995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Groups in Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organization and associative memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate geometric \(k\)-clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time bounds for approximate clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-linear algorithm for the planar 2-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229604 / rank
 
Normal rank

Latest revision as of 19:11, 6 June 2024

scientific article
Language Label Description Also known as
English
A local search approximation algorithm for \(k\)-means clustering
scientific article

    Statements

    A local search approximation algorithm for \(k\)-means clustering (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    Clustering
    0 references
    \(k\)-means
    0 references
    Approximation algorithms
    0 references
    Local search
    0 references
    Computational geometry
    0 references
    0 references
    0 references