K-Medoids Clustering Is Solvable in Polynomial Time for a 2d Pareto Front.
Nicolas DupinFrank NielsenEl-Ghazali TalbiPublished in: WCGO (2019)
Keyphrases
- multi objective
- np complete
- clustering algorithm
- clustering method
- k means
- special case
- cluster analysis
- unsupervised learning
- hierarchical clustering
- spectral clustering
- graph theoretic
- data points
- multiobjective optimization
- data mining tasks
- multi objective optimization
- similar objects
- self organizing maps
- swarm intelligence
- document clustering
- high dimensional data
- data streams
- similarity measure