For the obtained model, called a Partially-Hidden Markov Model (PHMM), the training algorithm is based on the Evidential Expectation-Maximisation (E2M) algorithm.This is a preview of subscription content, log in to check access.References 1. Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in statistical analysis of probabilistic functions of markov chains.
Ann. Math. Stat. 41, 164171 (1970) MathSciNet zbMATH CrossRef Google Scholar 2. Bishop, C.: Pattern Recognition and Machine Learning. Springer (2006) Google Scholar 3. Cme, E., Oukhellou, L., Denoeux, T., Aknin, P.: Learning from partially supervised data using mixture models and belief functions. Pattern Recognition 42, 334348 (2009) zbMATH CrossRef Google Scholar 4. Dempster, A.: Upper and lower probabilities induced by multiple valued mappings. Annals of Mathematical Statistics 38, 325339 (1967) MathSciNet zbMATH CrossRef Google Scholar 5. Denoeux, T.: Maximum likelihood estimation from uncertain data in the belief function framework. IEEE Transactions on Knowledge and Data Engineering (2011), doi:10.1109TKDE.2011.201 Google Scholar 6. Dong, M., He, D.: A segmental hidden semi-markov model (hsmm)-based diagnostics and prognostics framework and methodology. Mechanical Systems and Signal Processing 21, 22482266 (2007) CrossRef Google Scholar 7. Forney, G.: The viterbi algorithm. In: IEEE Workshop on Machine Learning and Signal Processing, Grenoble, France, pp. Google Scholar 11. Saporta, G., Youness, G.: Comparing two partitions: Some proposals and experiments. Automatic Control and Micro-Mechatronic Systems Department FEMTO-ST Institute, UMR CNRS 6174 - UFC ENSMM UTBM Besanon France 2. In: Denoeux T., Masson MH. Belief Functions: Theory and Applications.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |