A QUBO Formulation of the k-Medoids Problem
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.
- Published in:
LWDA/KDML Lernen. Wissen. Daten. Analysen. (LWDA) - Type:
Inproceedings - Authors:
C. Bauckhage, N. Piatkowski, R. Sifa, D. Hecker, S. Wrobel - Year:
2019
Citation information
C. Bauckhage, N. Piatkowski, R. Sifa, D. Hecker, S. Wrobel: A QUBO Formulation of the k-Medoids Problem, Lernen. Wissen. Daten. Analysen. (LWDA), LWDA/KDML, 2019, https://www.researchgate.net/publication/335611387_A_QUBO_Formulation_of_the_k-Medoids_Problem, Bauckhage.etal.2019,
@Inproceedings{Bauckhage.etal.2019,
author={C. Bauckhage, N. Piatkowski, R. Sifa, D. Hecker, S. Wrobel},
title={A QUBO Formulation of the k-Medoids Problem},
booktitle={Lernen. Wissen. Daten. Analysen. (LWDA)},
journal={LWDA/KDML},
url={https://www.researchgate.net/publication/335611387_A_QUBO_Formulation_of_the_k-Medoids_Problem},
year={2019},
abstract={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...}}