Near-optimal large-scale k-medoids clustering
type: Item
instance of: scholarly article
title: Near-optimal large-scale k-medoids clustering
zbMATH Open document ID: 1475.62196
published in: Information Sciences
publication date: 2021-11-30T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 62-08
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 7436244
zbMATH Keywords: parallel computing
zbMATH Keywords: distributed computing
zbMATH Keywords: k-medoids clustering
zbMATH Keywords: nearest neighbors
zbMATH Keywords: p-median problem
zbMATH Keywords: MPI
zbMATH Keywords: CLARA
author: Anton Vladimirovich Ushakov
author: Igor' Leonidovich Vasilyev
describes a project that uses: apcluster
describes a project that uses: VGGFace2
describes a project that uses: MPI
describes a project that uses: APCluster
describes a project that uses: Clara
MaRDI profile type: Publication
full work available at URL: j.ins.2020.08.121
OpenAlex ID: W3083628579
cites work: Local Search Heuristics for k-Median and Facility Location Problems
cites work: An aggregation heuristic for large scale p-median problem
cites work: An effective heuristic for large-scale capacitated facility location problems
cites work: Q5708526
cites work: Computational study of large-scale \(p\)-median problems
cites work: Relax, No Need to Round
cites work: Lagrangean heuristics for location problems
cites work: Clustering by Passing Messages Between Data Points
cites work: Solving large \(p\)-median problems with a radius formulation
cites work: The parallel variable neighborhood search for the \(p\)-median problem
cites work: Q4178782
cites work: Variable neighborhood search for the p-median
cites work: An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Introduction to Information Retrieval
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: The \(p\)-median problem: a survey of metaheuristic approaches
cites work: A parallelized lagrangean relaxation approach for the discrete ordered median problem
DOI: 10.1016/J.INS.2020.08.121
description: scientific article; zbMATH DE number 7436244