Bounded Asymmetric Gaussian Mixture-Based Hidden Markov Models

DOI10.1007/978-3-030-99142-5_2MaRDI QIDQ5050119zbMATH OpenOpenAlexFDO

Authors

Publication date 15 November 2022

Published in Unsupervised and Semi-Supervised Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-99142-5_2

zbMATH Keywords

activity recognitionbounded asymmetric Gaussian mixture modelexpectation maximization (EM)maximum likelihood (ML)occupancy estimation

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05)

Cites work

• A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
• A soft computing model based on asymmetric Gaussian mixtures and Bayesian inference
• An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
• An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition
• Bayesian learning of finite generalized Gaussian mixture models on images
• Bounded generalized Gaussian mixture model
• Dynamic selection of generative-discriminative ensembles for off-line signature verification
• Multivariate bounded asymmetric Gaussian mixture model
• Pattern recognition and machine learning.
• Statistical Inference for Probabilistic Functions of Finite State Markov Chains

Describes a project that uses

Uses Software

• DRAGON

This page was built for publication: Bounded Asymmetric Gaussian Mixture-Based Hidden Markov Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050119)