K-Medoids Clustering Is Solvable in Polynomial Time for a 2d Pareto Front
- 15 June 2019
- book chapter
- Published by Springer Nature
- p. 790-799
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Hypervolume Subset Selection in Two Dimensions: Formulations and AlgorithmsEvolutionary Computation, 2016
- Introduction to HPC with MPI for Data Science2016
- Two-dimensional subset selection for hypervolume and epsilon-indicator2014
- Data clustering: 50 years beyond K-meansPattern Recognition Letters, 2010
- Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences2009
- NP-hardness of Euclidean sum-of-squares clusteringMachine Learning, 2009
- Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications2003
- Output-sensitive peeling of convex and maximal layersInformation Processing Letters, 1996
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- Easy and hard bottleneck location problemsDiscrete Applied Mathematics, 1979