A spark-based parallel distributed posterior decoding algorithm for big data hidden Markov models decoding problem

نویسندگان

چکیده

<span lang="EN-US">Hidden </span><span lang="IN">M</span><span lang="EN-US">arkov models (HMMs) are one of machine learning algorithms which have been widely used and demonstrated their efficiency in many conventional applications. This paper proposes a modified posterior decoding algorithm to solve hidden Markov problem based on MapReduce paradigm spark’s resilient distributed dataset (RDDs) concept, for large-scale data processing. The objective this work is improve the performances HMM deal with big challenges. proposed shows great improvement reducing time complexity provides good results terms running time, speedup, parallelization large amount data, i.e., states number sequences number.</span>

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The posterior-Viterbi: a new decoding algorithm for hidden Markov models

Background: Hidden Markov models (HMM) are powerful machine learning tools successfully applied to problems of computational Molecular Biology. In a predictive task, the HMM is endowed with a decoding algorithm in order to assign the most probable state path, and in turn the class labeling, to an unknown sequence. The Viterbi and the posterior decoding algorithms are the most common. The former...

متن کامل

Turbo Decoding of Hidden Markov

We describe techniques for joint source-channel coding of hidden Markov sources using a modiied turbo decoding algorithm. This avoids the need to perform any explicit source coding prior to transmission, and instead allows the decoder to utilize the a priori structure due to the hidden Markov source. In addition, we present methods that allow the decoder to estimate the parameters of the Markov...

متن کامل

Approximate Viterbi decoding for 2D-hidden Markov models

While one-dimensional Hidden Markov Models have been very successfully applied to numerous problems, their extension to two dimensions has been shown to be exponentially complex, and this has very much restricted their usage for problems such as image analysis. In this paper we propose a novel algorithm which is able to approximate the search for the best state path (Viterbi decoding) in a 2D H...

متن کامل

On Ef cient Viterbi Decoding for Hidden semi-Markov Models

We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as that of finding the longest path between specific pairs of nodes. We consider fully connected models as well as restrictive topologies and state duration conditions, and show that performance improves by a significant f...

متن کامل

Bridging Viterbi and posterior decoding: a generalized risk approach to hidden path inference based on hidden Markov models

Motivated by the unceasing interest in hidden Markov models (HMMs), this paper reexamines hidden path inference in these models, using primarily a risk-based framework. While the most common maximum a posteriori (MAP), or Viterbi, path estimator and the minimum error, or Posterior Decoder (PD) have long been around, other path estimators, or decoders, have been either only hinted at or applied ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IAES International Journal of Artificial Intelligence

سال: 2021

ISSN: ['2089-4872', '2252-8938']

DOI: https://doi.org/10.11591/ijai.v10.i3.pp789-800