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.
CITATION STYLE
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). AUAI Press.
Mendeley helps you to discover research relevant for your work.