Exact enumeration of local minima for kmedoids clustering in a 2D Pareto Front - Réseaux & Optimisation Combinatoire et Stochastique
Communication Dans Un Congrès Année : 2022

Exact enumeration of local minima for kmedoids clustering in a 2D Pareto Front

Résumé

K-medoids clustering is solvable by dynamic programming in O(N 3) time for a 2D Pareto Front (PF). A key element is a interval clustering optimality. This paper proves this property holds also for local minima for k-medoids. It allows to enumerate the local minima of k-medoids with the same complexity than the computation of global optima for k=2 ou k=3. A pseudo-polynomial enumeration scheme is designed, for small values of k. This allows to understand results obtained by local search approaches in a 2D PF.
Fichier principal
Vignette du fichier
HUGO2022.pdf (232.57 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03695180 , version 1 (14-06-2022)

Identifiants

  • HAL Id : hal-03695180 , version 1

Citer

Nicolas Dupin. Exact enumeration of local minima for kmedoids clustering in a 2D Pareto Front. HUGO 2022 - XV. Workshop on Global Optimization, Sep 2022, Szeged, Hungary. ⟨hal-03695180⟩
67 Consultations
56 Téléchargements

Partager

More