Near-optimal large-scale k-medoids clustering

DOI10.1016/J.INS.2020.08.121MaRDI QIDQ2054038zbMATH OpenOpenAlexFDO

Authors 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

CLARAdistributed computingk-medoids clusteringMPInearest neighborsp-median problemparallel computing

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)

Recommendations

• An improved parallel K-Medoids algorithm based on MapReduce
• Near-optimal clustering in the \(k\)-machine model
• Heuristic methods for large centroid clustering problems
• The effective BRKGA algorithm for the k-medoids clustering problem
• Optimal time bounds for approximate clustering

Cites work

• A parallelized lagrangean relaxation approach for the discrete ordered median problem
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems
• An aggregation heuristic for large scale p-median problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An effective heuristic for large-scale capacitated facility location problems
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Clustering by passing messages between data points
• Computational study of large-scale p-median problems
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 2230234 (Why is no real title available?)
• Introduction to Information Retrieval
• Lagrangean heuristics for location problems
• Local Search Heuristics for k-Median and Facility Location Problems
• On the Complexity of Some Common Geometric Location Problems
• Relax, no need to round: integrality of clustering formulations
• Solving large p-median problems with a radius formulation
• The \(p\)-median problem: a survey of metaheuristic approaches
• The parallel variable neighborhood search for the \(p\)-median problem
• Variable neighborhood search for the p-median

Cited in

(16)

• K-bMOM: A robust Lloyd-type clustering algorithm based on bootstrap median-of-means
• K-means clustering via a nonconvex optimization approach
• A fast and recursive algorithm for clustering large datasets with \(k\)-medians
• scientific article; zbMATH DE number 1945789 (Why is no real title available?)
• Large-scale fuzzy multiple-medoid clustering method
• Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering
• Discrete facility location in machine learning
• The effective BRKGA algorithm for the k-medoids clustering problem
• An improved parallel K-Medoids algorithm based on MapReduce
• 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
• A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
• Mahalanobis-distance-based clustering via DC optimization approach

Describes a project that uses

Uses Software

• apcluster
• VGGFace2
• MPI
• APCluster
• Clara

This page was built for publication: Near-optimal large-scale k-medoids clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2054038)