A QUBO Formulation of the k-Medoids Problem

Christian Bauckhage, Nico Piatkowski, Rafet Sifa, Dirk Hecker, Stefan Wrobel
2019 Lernen, Wissen, Daten, Analysen  
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.
dblp:conf/lwa/BauckhagePSHW19 fatcat:632dcolk5rflzlrctejsqrw2e4