Near-optimal large-scale k-medoids clustering (Q2054038): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.ins.2020.08.121 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3083628579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An aggregation heuristic for large scale p-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic for large-scale capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of large-scale \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relax, No Need to Round / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering by Passing Messages Between Data Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large <i>p</i>-Median Problems with a Radius Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel variable neighborhood search for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the p-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems / 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: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-median problem: a survey of metaheuristic approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallelized lagrangean relaxation approach for the discrete ordered median problem / rank
 
Normal rank

Latest revision as of 08:22, 27 July 2024

scientific article
Language Label Description Also known as
English
Near-optimal large-scale k-medoids clustering
scientific article

    Statements

    Near-optimal large-scale k-medoids clustering (English)
    0 references
    30 November 2021
    0 references
    parallel computing
    0 references
    distributed computing
    0 references
    k-medoids clustering
    0 references
    nearest neighbors
    0 references
    p-median problem
    0 references
    MPI
    0 references
    CLARA
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers