We are concerned with k-medoids clustering and propose a quadratic unconstrained binary optimization (QUBO) formulation of the problem of identifying k medoids among n data points without having to cluster the data. Given our QUBO formulation of this NP-hard problem, it should be possible to solve it on adiabatic quantum computers.
A QUBO Formulation of the k-Medoids Problem
Type: Inproceedings
Author: C. Bauckhage, N. Piatkowski, R. Sifa, D. Hecker, S. Wrobel
Journal: LWDA/KDML
Year: 2019
Citation information
C. Bauckhage, N. Piatkowski, R. Sifa, D. Hecker, S. Wrobel:
A QUBO Formulation of the k-Medoids Problem.
LWDA/KDML,
2019,
https://www.researchgate.net/publication/335611387_A_QUBO_Formulation_of_the_k-Medoids_Problem