scholarly journals A copula-based multivariate hidden Markov model for modelling momentum in football

2021 ◽  
Author(s):  
Marius Ötting ◽  
Roland Langrock ◽  
Antonello Maruotti
Keyword(s):  
Markov Model ◽  
Hidden Markov Models ◽  
Markov Models ◽  
Hidden Markov ◽  
State Dependence ◽  
Change Points ◽  
Sports Fans ◽  
Modelling Framework ◽  
State Dependent ◽  
Different Levels

AbstractWe investigate the potential occurrence of change points—commonly referred to as “momentum shifts”—in the dynamics of football matches. For that purpose, we model minute-by-minute in-game statistics of Bundesliga matches using hidden Markov models (HMMs). To allow for within-state dependence of the variables, we formulate multivariate state-dependent distributions using copulas. For the Bundesliga data considered, we find that the fitted HMMs comprise states which can be interpreted as a team showing different levels of control over a match. Our modelling framework enables inference related to causes of momentum shifts and team tactics, which is of much interest to managers, bookmakers, and sports fans.

scholarly journals The Application of Baum-Welch Algorithm in Multistep Attack

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yanxue Zhang ◽  
Dongmei Zhao ◽  
Jinxing Liu
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Viterbi Algorithm ◽  
Markov Models ◽  
Hidden Markov ◽  
Simulation Experiments ◽  
Forward Algorithm ◽  
Better Than

The biggest difficulty of hidden Markov model applied to multistep attack is the determination of observations. Now the research of the determination of observations is still lacking, and it shows a certain degree of subjectivity. In this regard, we integrate the attack intentions and hidden Markov model (HMM) and support a method to forecasting multistep attack based on hidden Markov model. Firstly, we train the existing hidden Markov model(s) by the Baum-Welch algorithm of HMM. Then we recognize the alert belonging to attack scenarios with the Forward algorithm of HMM. Finally, we forecast the next possible attack sequence with the Viterbi algorithm of HMM. The results of simulation experiments show that the hidden Markov models which have been trained are better than the untrained in recognition and prediction.

scholarly journals Utilizing Gaze Behavior for Inferring Task Transitions Using Abstract Hidden Markov Models

2016 ◽  
Vol 19 (58) ◽  
pp. 1
Author(s):  
Daniel Fernando Tello Gamarra
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Markov Models ◽  
Hidden Markov ◽  
Hand Movement ◽  
Gaze Behavior ◽  
Improved Method ◽  
The Relationship

We demonstrate an improved method for utilizing observed gaze behavior and show that it is useful in inferring hand movement intent during goal directed tasks. The task dynamics and the relationship between hand and gaze behavior are learned using an Abstract Hidden Markov Model (AHMM). We show that the predicted hand movement transitions occur consistently earlier in AHMM models with gaze than those models that do not include gaze observations.

scholarly journals A Hidden Markov Model for the Linguistic Analysis of the Voynich Manuscript

2019 ◽  
Vol 24 (1) ◽  
pp. 14 ◽  
Author(s):  
Luis Acedo
Keyword(s):  
Time Series ◽  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Markov Models ◽  
Hidden Markov ◽  
Mathematical Linguistics ◽  
Underlying Structure ◽  
Internal States ◽  
Consonant Sounds

Hidden Markov models are a very useful tool in the modeling of time series and any sequence of data. In particular, they have been successfully applied to the field of mathematical linguistics. In this paper, we apply a hidden Markov model to analyze the underlying structure of an ancient and complex manuscript, known as the Voynich manuscript, which remains undeciphered. By assuming a certain number of internal states representations for the symbols of the manuscripts, we train the network by means of the α and β -pass algorithms to optimize the model. By this procedure, we are able to obtain the so-called transition and observation matrices to compare with known languages concerning the frequency of consonant andvowel sounds. From this analysis, we conclude that transitions occur between the two states with similar frequencies to other languages. Moreover, the identification of the vowel and consonant sounds matches some previous tentative bottom-up approaches to decode the manuscript.

Hidden Markov model interpretations of neural networks

2000 ◽  
Vol 23 (4) ◽  
pp. 494-495
Author(s):  
Ingmar Visser
Keyword(s):  
Neural Networks ◽  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Markov Models ◽  
Hidden Markov ◽  
Distributed Representations ◽  
Hidden Layer

Page's manifesto makes a case for localist representations in neural networks, one of the advantages being ease of interpretation. However, even localist networks can be hard to interpret, especially when at some hidden layer of the network distributed representations are employed, as is often the case. Hidden Markov models can be used to provide useful interpretable representations.

SENTENCE LIPREADING USING HIDDEN MARKOV MODEL WITH INTEGRATED GRAMMAR

2001 ◽  
Vol 15 (01) ◽  
pp. 161-176 ◽  
Author(s):  
KEREN YU ◽  
XIAOYI JIANG ◽  
HORST BUNKE
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Systematic Approach ◽  
Markov Models ◽  
Hidden Markov ◽  
E Mail

In this paper, we describe a systematic approach to the lipreading of whole sentences. A vocabulary of elementary words is considered. Based on the vocabulary, we define a grammar that generates a set of legal sentences. Our lipreading approach is based on a combination of the grammar with hidden Markov models (HMMs). Two different experiments were conducted. In the first experiment a set of e-mail commands is considered, while the set of sentences in the second experiment is given by all English integer numbers up to one million. Both experiments showed promising results, regarding the difficulty of the considered task.

scholarly journals Fuzzy Hidden Markov Models for Indonesian Speech Classification

2012 ◽  
Vol 16 (3) ◽  
pp. 381-387 ◽  
Author(s):  
Intan Nurma Yulita Houw Liong The ◽  
◽  
Adiwijaya ◽  
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Speech Signal ◽  
Markov Models ◽  
Hidden Markov ◽  
New Combination ◽  
Speech Classification ◽  
Different Characteristics ◽  
Better Than

Indonesia has many tribes, so that there are many dialects. Speech classification is difficult if the database uses speech signals from various people who have different characteristics because of gender and dialect. The different characteristics will influence frequency, intonation, amplitude, and period of the speech. It makes the system must be trained for the various templates reference of speech signal. Therefore, this study has been developed for Indonesian speech classification. The solution is a new combination of fuzzy on hidden Markov models. The result shows a new version of fuzzy hiddenMarkovmodels is better than hidden Markov model.

Equivalence of Linear Boltzmann Chains and Hidden Markov Models

1996 ◽  
Vol 8 (1) ◽  
pp. 178-181 ◽  
Author(s):  
David J. C. MacKay
Keyword(s):  
Probability Distribution ◽  
Markov Model ◽  
Hidden Markov Models ◽  
State Transition ◽  
Markov Models ◽  
Hidden Markov ◽  
Simple Condition ◽  
Transition Energies ◽  
State Sequence ◽  
The Relationship

Several authors have studied the relationship between hidden Markov models and “Boltzmann chains” with a linear or “time-sliced” architecture. Boltzmann chains model sequences of states by defining state-state transition energies instead of probabilities. In this note I demonstrate that under the simple condition that the state sequence has a mandatory end state, the probability distribution assigned by a strictly linear Boltzmann chain is identical to that assigned by a hidden Markov model.

Metal Label Pressed Protuberant Characters Recognition Based on Hidden Markov Model

2011 ◽  
Vol 187 ◽  
pp. 667-671
Author(s):  
Wei Chen
Keyword(s):  
Neural Network ◽  
Markov Model ◽  
Hidden Markov Models ◽  
State Transition ◽  
Markov Models ◽  
Hidden Markov ◽  
Shape Index ◽  
Surface Curvature ◽  
Word Choice ◽  
Recognition Method

A recognition method of pressed protuberant characters based on Hidden Markov models and Neural Network is applied, which the surface curvature properties and the relation of metal label characters are analyzed in detail. The shape index of the characters is extracted. A neural network is used to estimate probabilities for the characters depended on the surface curvature properties, then deriving the best word choice from a sequence of state transition. It is shown in test that the proposed method can be used to recognize the pressed protuberant on metal label.

scholarly journals Map representation using hidden markov models for mobile robot localization

2018 ◽  
Vol 161 ◽  
pp. 03011
Author(s):  
Jesus Savage ◽  
Oscar Fuentes ◽  
Luis Contreras ◽  
Marco Negrete
Keyword(s):  
Mobile Robot ◽  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Viterbi Algorithm ◽  
Markov Models ◽  
Hidden Markov ◽  
Robot Localization ◽  
Localization System ◽  
Mobile Robot Localization

This paper describes a map representation and localization system for a mobile robot based on Hidden Markov Models. These models are used not only to find a region where a mobile robot is, but also they find the orientation that it has. It is shown that an estimation of the region where the robot is located can be found using the Viterbi algorithm with quantized laser readings, i.e. symbol observations, of a Hidden Markov Model.

Sign in / Sign up

Export Citation Format

Share Document