Quantum annealing for clustering

Kenichi Kurihara, Shu Tanaka, Seiji Miyashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 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
Title of host publicationProceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009
Pages321-328
Number of pages8
Publication statusPublished - 2009
Externally publishedYes
Event25th Conference on Uncertainty in Artificial Intelligence, UAI 2009 - Montreal, QC, Canada
Duration: 2009 Jun 182009 Jun 21

Other

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

Fingerprint

Annealing
Clustering
Simulated annealing
Simulated Annealing
Schedule
Assignment
Experiment
Experiments

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics

Cite this

Kurihara, K., Tanaka, S., & Miyashita, S. (2009). Quantum annealing for clustering. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009 (pp. 321-328)

Quantum annealing for clustering. / Kurihara, Kenichi; Tanaka, Shu; Miyashita, Seiji.

Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009. 2009. p. 321-328.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kurihara, K, Tanaka, S & Miyashita, S 2009, Quantum annealing for clustering. in Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009. pp. 321-328, 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009, Montreal, QC, Canada, 09/6/18.
Kurihara K, Tanaka S, Miyashita S. Quantum annealing for clustering. In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009. 2009. p. 321-328
Kurihara, Kenichi ; Tanaka, Shu ; Miyashita, Seiji. / Quantum annealing for clustering. Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009. 2009. pp. 321-328
@inproceedings{391a461745d54e77ab1a46fc8c6c5238,
title = "Quantum annealing for clustering",
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.",
author = "Kenichi Kurihara and Shu Tanaka and Seiji Miyashita",
year = "2009",
language = "English",
pages = "321--328",
booktitle = "Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009",

}

TY - GEN

T1 - Quantum annealing for clustering

AU - Kurihara, Kenichi

AU - Tanaka, Shu

AU - Miyashita, Seiji

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80053142047&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80053142047&partnerID=8YFLogxK

M3 - Conference contribution

SP - 321

EP - 328

BT - Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

ER -