Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A hybrid approach of NN and HMM for facial emotion classification
Pattern Recognition Letters
Improving speaker identification in noise by subband processing and decision fusion
Pattern Recognition Letters - Special issue: Audio- and video-based biometric person authentication (AVBPA 2001)
Causal architecture, complexity and self-organization in time series and cellular automata
Causal architecture, complexity and self-organization in time series and cellular automata
Hidden Markov Models Combining Discrete Symbols and Continuous Attributes in Handwriting Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improved Gait Recognition by Gait Dynamics Normalization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multicue HMM-UKF for Real-Time Contour Tracking
IEEE Transactions on Pattern Analysis and Machine Intelligence
Lexicon reduction using dots for off-line Farsi/Arabic handwritten word recognition
Pattern Recognition Letters
Inference in Hidden Markov Models
Inference in Hidden Markov Models
A Maximum Likelihood Approach to Continuous Speech Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Human action learning via hidden Markov model
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Botnet traffic detection using hidden Markov models
Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research
P2P hierarchical botnet traffic detection using hidden Markov models
Proceedings of the 2012 Workshop on Learning from Authoritative Security Experiment Results
Hi-index | 0.10 |
Hidden Markov models (HMMs) are widely used in pattern recognition. HMM construction requires an initial model structure that is used as a starting point to estimate the model's parameters. To construct a HMM without a priori knowledge of the structure, we use an approach developed by Crutchfield and Shalizi that requires only a sequence of observations and a maximum data window size. Values of the maximum data window size that are too small result in incorrect models being constructed. Values that are too large reduce the number of data samples that can be considered and exponentially increase the algorithm's computational complexity. In this paper, we present a method for automatically inferring this parameter directly from training data as part of the model construction process. We present theoretical and experimental results that confirm the utility of the proposed extension.