Quantum annealing for Dirichlet process mixture models with applications to network clustering

Issei Sato, Shu Tanaka, Kenichi Kurihara, Seiji Miyashita, Hiroshi Nakagawa

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

We developed a new quantum annealing (QA) algorithm for Dirichlet process mixture (DPM) models based on the Chinese restaurant process (CRP). QA is a parallelized extension of simulated annealing (SA), i.e., it is a parallel stochastic optimization technique. Existing approaches ( Kurihara et al. 2009 [12] and Sato et al. 2009 [20]) cannot be applied to the CRP because their QA framework is formulated using a fixed number of mixture components. The proposed QA algorithm can handle an unfixed number of classes in mixture models. We applied QA to a DPM model for clustering vertices in a network where a CRP seating arrangement indicates a network partition. A multi core processer was used for running QA in experiments, the results of which show that QA is better than SA, Markov chain Monte Carlo inference, and beam search at finding a maximum a posteriori estimation of a seating arrangement in the CRP. Since our QA algorithm is as easy as to implement the SA algorithm, it is suitable for a wide range of applications.

Original languageEnglish
Pages (from-to)523-531
Number of pages9
JournalNeurocomputing
Volume121
DOIs
Publication statusPublished - 2013 Dec 9
Externally publishedYes

Fingerprint

Restaurants
Cluster Analysis
Annealing
Simulated annealing
Markov Chains
Markov processes

Keywords

  • Bayesian nonparametrics
  • Dirichlet process
  • Maximum a posteriori estimation
  • Quantum annealing
  • Stochastic optimization

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Cognitive Neuroscience

Cite this

Quantum annealing for Dirichlet process mixture models with applications to network clustering. / Sato, Issei; Tanaka, Shu; Kurihara, Kenichi; Miyashita, Seiji; Nakagawa, Hiroshi.

In: Neurocomputing, Vol. 121, 09.12.2013, p. 523-531.

Research output: Contribution to journalArticle

Sato, Issei ; Tanaka, Shu ; Kurihara, Kenichi ; Miyashita, Seiji ; Nakagawa, Hiroshi. / Quantum annealing for Dirichlet process mixture models with applications to network clustering. In: Neurocomputing. 2013 ; Vol. 121. pp. 523-531.
@article{2e762ff03f1242b089e4389ed3803313,
title = "Quantum annealing for Dirichlet process mixture models with applications to network clustering",
abstract = "We developed a new quantum annealing (QA) algorithm for Dirichlet process mixture (DPM) models based on the Chinese restaurant process (CRP). QA is a parallelized extension of simulated annealing (SA), i.e., it is a parallel stochastic optimization technique. Existing approaches ( Kurihara et al. 2009 [12] and Sato et al. 2009 [20]) cannot be applied to the CRP because their QA framework is formulated using a fixed number of mixture components. The proposed QA algorithm can handle an unfixed number of classes in mixture models. We applied QA to a DPM model for clustering vertices in a network where a CRP seating arrangement indicates a network partition. A multi core processer was used for running QA in experiments, the results of which show that QA is better than SA, Markov chain Monte Carlo inference, and beam search at finding a maximum a posteriori estimation of a seating arrangement in the CRP. Since our QA algorithm is as easy as to implement the SA algorithm, it is suitable for a wide range of applications.",
keywords = "Bayesian nonparametrics, Dirichlet process, Maximum a posteriori estimation, Quantum annealing, Stochastic optimization",
author = "Issei Sato and Shu Tanaka and Kenichi Kurihara and Seiji Miyashita and Hiroshi Nakagawa",
year = "2013",
month = "12",
day = "9",
doi = "10.1016/j.neucom.2013.05.019",
language = "English",
volume = "121",
pages = "523--531",
journal = "Neurocomputing",
issn = "0925-2312",
publisher = "Elsevier",

}

TY - JOUR

T1 - Quantum annealing for Dirichlet process mixture models with applications to network clustering

AU - Sato, Issei

AU - Tanaka, Shu

AU - Kurihara, Kenichi

AU - Miyashita, Seiji

AU - Nakagawa, Hiroshi

PY - 2013/12/9

Y1 - 2013/12/9

N2 - We developed a new quantum annealing (QA) algorithm for Dirichlet process mixture (DPM) models based on the Chinese restaurant process (CRP). QA is a parallelized extension of simulated annealing (SA), i.e., it is a parallel stochastic optimization technique. Existing approaches ( Kurihara et al. 2009 [12] and Sato et al. 2009 [20]) cannot be applied to the CRP because their QA framework is formulated using a fixed number of mixture components. The proposed QA algorithm can handle an unfixed number of classes in mixture models. We applied QA to a DPM model for clustering vertices in a network where a CRP seating arrangement indicates a network partition. A multi core processer was used for running QA in experiments, the results of which show that QA is better than SA, Markov chain Monte Carlo inference, and beam search at finding a maximum a posteriori estimation of a seating arrangement in the CRP. Since our QA algorithm is as easy as to implement the SA algorithm, it is suitable for a wide range of applications.

AB - We developed a new quantum annealing (QA) algorithm for Dirichlet process mixture (DPM) models based on the Chinese restaurant process (CRP). QA is a parallelized extension of simulated annealing (SA), i.e., it is a parallel stochastic optimization technique. Existing approaches ( Kurihara et al. 2009 [12] and Sato et al. 2009 [20]) cannot be applied to the CRP because their QA framework is formulated using a fixed number of mixture components. The proposed QA algorithm can handle an unfixed number of classes in mixture models. We applied QA to a DPM model for clustering vertices in a network where a CRP seating arrangement indicates a network partition. A multi core processer was used for running QA in experiments, the results of which show that QA is better than SA, Markov chain Monte Carlo inference, and beam search at finding a maximum a posteriori estimation of a seating arrangement in the CRP. Since our QA algorithm is as easy as to implement the SA algorithm, it is suitable for a wide range of applications.

KW - Bayesian nonparametrics

KW - Dirichlet process

KW - Maximum a posteriori estimation

KW - Quantum annealing

KW - Stochastic optimization

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

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

U2 - 10.1016/j.neucom.2013.05.019

DO - 10.1016/j.neucom.2013.05.019

M3 - Article

AN - SCOPUS:84884144248

VL - 121

SP - 523

EP - 531

JO - Neurocomputing

JF - Neurocomputing

SN - 0925-2312

ER -