Quantum annealing for clustering

Kenichi Kurihara, Shu Tanaka, Seiji Miyashita

Research output: Contribution to conferencePaperpeer-review

7 Citations (Scopus)

Abstract

This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in practice. Experiments show the proposed QA algorithm finds better clustering assignments than SA. Furthermore, QA is as easy as SA to implement.

Original languageEnglish
Pages321-328
Number of pages8
Publication statusPublished - 2009 Dec 1
Externally publishedYes
Event25th Conference on Uncertainty in Artificial Intelligence, UAI 2009 - Montreal, QC, Canada
Duration: 2009 Jun 182009 Jun 21

Conference

Conference25th Conference on Uncertainty in Artificial Intelligence, UAI 2009
CountryCanada
CityMontreal, QC
Period09/6/1809/6/21

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Quantum annealing for clustering'. Together they form a unique fingerprint.

Cite this