Options
2019
Conference Paper
Title
A QUBO Formulation of the k-Medoids Problem
Abstract
We are concerned with k-medoids clustering and propose aquadratic 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.
Author(s)