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.
|ホスト出版物のタイトル||Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009|
|出版ステータス||Published - 2009|
|イベント||25th Conference on Uncertainty in Artificial Intelligence, UAI 2009 - Montreal, QC, Canada|
継続期間: 2009 6月 18 → 2009 6月 21
|Other||25th Conference on Uncertainty in Artificial Intelligence, UAI 2009|
|Period||09/6/18 → 09/6/21|
ASJC Scopus subject areas