Clustering in a 2-dimensional Pareto Front: the p-median and p-center problems are polynomially solvable.

Nicolas Dupin El-Ghazali Talbi

Published in: CoRR (2018)

Keyphrases

np complete
multi objective
polynomially solvable
clustering algorithm
self organizing maps
cost function
k means
special case
data mining tasks
neural network
similarity measure
unsupervised learning
high dimensionality
document clustering
data clustering
processing times