Bauckhage, ChristianChristianBauckhagePiatkowski, NicoNicoPiatkowskiSifa, RafetRafetSifaHecker, DirkDirkHeckerWrobel, StefanStefanWrobel2022-03-142022-03-142019https://publica.fraunhofer.de/handle/publica/405469We 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.en005006629conference paper