Near-optimal large-scale k-medoids clustering

DOI10.1016/j.ins.2020.08.121zbMath1475.62196OpenAlexW3083628579MaRDI QIDQ2054038

Anton Vladimirovich Ushakov, Igor' Leonidovich Vasilyev

Publication date: 30 November 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2020.08.121

zbMATH Keywords

MPIparallel computingdistributed computingnearest neighborsp-median problemCLARAk-medoids clustering

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Parallel numerical computation (65Y05)

Related Items

Discrete facility location in machine learning, Multi-objective soft subspace clustering in the composite kernel space, Robust subspace clustering based on automatic weighted multiple kernel learning, A novel method for optimizing spectral rotation embedding \(K\)-means with coordinate descent, Bounds and convex heuristics for bi-objective optimal experiment design in water networks, An efficient Benders decomposition for the \(p\)-median problem, K-means clustering via a nonconvex optimization approach

Uses Software

• MPI
• apcluster
• APCluster
• Clara
• VGGFace2

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering by Passing Messages Between Data Points
• A parallelized lagrangean relaxation approach for the discrete ordered median problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• Computational study of large-scale \(p\)-median problems
• An effective heuristic for large-scale capacitated facility location problems
• An aggregation heuristic for large scale p-median problem
• Lagrangean heuristics for location problems
• The parallel variable neighborhood search for the \(p\)-median problem
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• Solving Large p-Median Problems with a Radius Formulation
• Relax, No Need to Round
• On the Complexity of Some Common Geometric Location Problems
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Introduction to Information Retrieval
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Variable neighborhood search for the p-median
• Local Search Heuristics for k-Median and Facility Location Problems