A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
A QUBO Formulation of the k-Medoids Problem
2019
Lernen, Wissen, Daten, Analysen
Preserved Fulltext
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