Abstract
In this paper, a new algorithm based on the Baum-Welch algorithm for estimating the parameters of a hidden Markov model (HMM) is presented. It allows each state to be observed using a different set of features rather than relying on a common feature set. Each feature set is chosen to be a sufficient statistic for discrimination of the given state from a common white-noise state. Comparison of likelihood values is possible through the use of likelihood ratios. The new algorithm is the same in theory as the algorithm based on a common feature set, but without the necessity of estimating high-dimensional probability density functions (PDFs). A simulated data example is provided showing superior performance over the conventional HMM.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
