Now showing 1 - 3 of 3
  • Publication
    A QUBO Formulation of the k-Medoids Problem
    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.
  • Publication
    Max-Sum Dispersion via Quantum Annealing
    We devise an Ising model for the max-sum dispersion problem which occurs in contexts such as Web search or text summarization. Given this Ising model, max-sum dispersion can be solved on adiabatic quantum computers; in proof of concept simulations, we solve the corresponding Schrödinger equations and observe our approach to work well.
  • Publication
    Visit potential: A common vocabulary for the analysis of entity-location interactions in mobility applications
    A growing number of companies and public institutions use mobility data in their day-to-day business. One type of usage is the analysis of spatio-temporal interactions between mobile entities and geographic locations. In practice the employed measures depend on application demands and use context-specific terminology. Thus, a patchwork of measures has evolved which is not suitable for methodological research and interdisciplinary ex-change of ideas. The measures lack a systematic formalization and a uni-form terminology. In this paper we therefore systematically define meas-ures for entity-location interactions which we name visit potential. We provide a common vocabulary that can be applied for an entire class of mobility applications. We present two real-world scenarios which apply entity-location interaction measures and demonstrate how the employed measures can be precisely defined in terms of visit potential.