Efficient Parallel Learning of Hidden Markov Chain Models on SMPs
スポンサーリンク
概要
- 論文の詳細を見る
Quad-core cpus have been a common desktop configuration for todays office. The increasing number of processors on a single chip opens new opportunity for parallel computing. Our goal is to make use of the multi-core as well as multi-processor architectures to speed up large-scale data mining algorithms. In this paper, we present a general parallel learning framework, Cut-And-Stitch, for training hidden Markov chain models. Particularly, we propose two model-specific variants, CAS-LDS for learning linear dynamical systems (LDS) and CAS-HMM for learning hidden Markov models (HMM). Our main contribution is a novel method to handle the data dependencies due to the chain structure of hidden variables, so as to parallelize the EM-based parameter learning algorithm. We implement CAS-LDS and CAS-HMM using OpenMP on two supercomputers and a quad-core commercial desktop. The experimental results show that parallel algorithms using Cut-And-Stitch achieve comparable accuracy and almost linear speedups over the traditional serial version.
著者
-
LI Lei
Computer Science Department of Carnegie Mellon University
-
FU Bin
Computer Science Department of Carnegie Mellon University
-
FALOUTSOS Christos
Computer Science Department of Carnegie Mellon University
関連論文
- Efficient Parallel Learning of Hidden Markov Chain Models on SMPs
- Efficient Parallel Learning of Hidden Markov Chain Models on SMPs