Effective Heuristic Techniques for Combined Robust Clustering Problem

DOI10.1142/S0217595922400097MaRDI QIDQ6053497zbMATH OpenOpenAlexWikidataFDO

Authors Chenchen Wu, Ling Gai, Lu Han

Publication date 19 October 2023

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0217595922400097

zbMATH Keywords

\(k\)-meansapproximation algorithmlocal search schemerobust clustering problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Recommendations

• A review of robust clustering methods
• A robust fuzzy clustering method
• Integrating robust clustering techniques in S-PLUS
• An improved heuristic for consistent biclustering problems
• A robust method for cluster analysis
• Heuristic methods for large centroid clustering problems

Cites work

• scientific article; zbMATH DE number 7650294 (Why is no real title available?)
• A bi-criteria approximation algorithm for \(k\)-means
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means
• A constant-factor approximation algorithm for the k-median problem
• A local search approximation algorithm for \(k\)-means clustering
• A local search approximation algorithm for the \(k\)-means problem with penalties
• Algorithms for facility location problems with outliers. (Extended abstract)
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
• An improved approximation algorithm for the \(k\)-means problem with penalties
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Approximation schemes for clustering with outliers
• Concept decompositions for large sparse text data using clustering
• Constant approximation for k-median and k-means with outliers via iterative rounding
• Effectiveness of local search for geometric optimization
• Improved approximation algorithm for universal facility location problem with linear penalties
• Least squares quantization in PCM
• Local Search Heuristics for k-Median and Facility Location Problems
• Local search algorithm for universal facility location problem with linear penalties
• NP-hardness of Euclidean sum-of-squares clustering
• On approximate geometric \(k\)-clustering
• The Planar k-Means Problem is NP-Hard
• The seeding algorithm for k-means problem with penalties
• Tight analysis of a multiple-swap heuristic for budgeted red-blue median

Cited in

(1)

• Robustification of the k-means clustering problem and tailored decomposition methods: when more conservative means more accurate

This page was built for publication: Effective Heuristic Techniques for Combined Robust Clustering Problem

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