Book Image

Hands-On Markov Models with Python

By : Ankur Ankan, Abinash Panda
Book Image

Hands-On Markov Models with Python

By: Ankur Ankan, Abinash Panda

Overview of this book

Hidden Markov Model (HMM) is a statistical model based on the Markov chain concept. Hands-On Markov Models with Python helps you get to grips with HMMs and different inference algorithms by working on real-world problems. The hands-on examples explored in the book help you simplify the process flow in machine learning by using Markov model concepts, thereby making it accessible to everyone. Once you’ve covered the basic concepts of Markov chains, you’ll get insights into Markov processes, models, and types with the help of practical examples. After grasping these fundamentals, you’ll move on to learning about the different algorithms used in inferences and applying them in state and parameter inference. In addition to this, you’ll explore the Bayesian approach of inference and learn how to apply it in HMMs. In further chapters, you’ll discover how to use HMMs in time series analysis and natural language processing (NLP) using Python. You’ll also learn to apply HMM to image processing using 2D-HMM to segment images. Finally, you’ll understand how to apply HMM for reinforcement learning (RL) with the help of Q-Learning, and use this technique for single-stock and multi-stock algorithmic trading. By the end of this book, you will have grasped how to build your own Markov and hidden Markov models on complex datasets in order to apply them to projects.

Related Content you might be interested in

Current Title:

Small book image
Hands-On Markov Models with Python
Ankur Ankan | Abinash Panda
Sep, 2018 | 178 pages
Small book image
Mastering Machine Learning Algorithms
Giuseppe Bonaccorso
May, 2018 | 576 pages
Small book image
Hands-On Reinforcement Learning with R
Giuseppe Ciaburro
Dec, 2019 | 362 pages
Small book image
A Handbook of Mathematical Models with Python
Dr Ranja Sarkar
Aug, 2023 | 144 pages
Table of Contents (11 chapters)
Preface
Preface
Who this book is for
What this book covers
To get the most out of this book
Get in touch
Free Chapter
1
Introduction to the Markov Process
Introduction to the Markov Process
Random variables
Random processes
Markov processes
Installing Python and packages
Markov chains or discrete-time Markov processes
Continuous-time Markov chains
Summary
2
Hidden Markov Models
Hidden Markov Models
Markov models
The HMM
Evaluation of an HMM
Extensions of HMM
Summary
3
State Inference - Predicting the States
State Inference - Predicting the States
State inference in HMM
Dynamic programming
Forward algorithm
Backward algorithm
Forward-backward algorithm (smoothing)
The Viterbi algorithm
Summary
4
Parameter Learning Using Maximum Likelihood
Parameter Learning Using Maximum Likelihood
Maximum likelihood learning
MLE for HMMs
Summary
5
Parameter Inference Using the Bayesian Approach
Parameter Inference Using the Bayesian Approach
Bayesian learning
Bayesian learning in HMM
Code
Summary
6
Time Series Predicting
Time Series Predicting
Stock price prediction using HMM
Summary
7
Natural Language Processing
Natural Language Processing
Part-of-speech tagging
Speech recognition
Summary
8
2D HMM for Image Processing
2D HMM for Image Processing
Recap of 1D HMM
2D HMMs
Summary
9
Markov Decision Process
Markov Decision Process
Reinforcement learning
The Markov reward process
Code example
Summary
10
Other Books You May Enjoy
Other Books You May Enjoy
Leave a review - let other readers know what you think

Dynamic programming

Dynamic programming is a programming paradigm in which we divide a complex problem into smaller sub-problems. We solve these sub-problems and store the results. Whenever we need to recompute the same sub-problem again, we just used our stored results, thus saving us computation time at the expense of using storage space. This technique of caching the results of sub-problems is known as memoization. Therefore, using dynamic programming allows us to speed up our computations by using memoization, and in some cases, it can bring the computational complexity from exponential to linear, as we will see in the following example.

One of the simplest examples of optimization using dynamic programming is computing the nth member of the Fibonacci sequence. Any term in a Fibonacci sequence is the sum of the last two terms, which can be formally defined as follows:

fib...

Previous Section
End of Section 3
Next Section