Published in: OASIcs, Volume 28, 2012 Imperial College Computing Student Workshop
Tiberiu S. Chis and Peter G. Harrison. Incremental HMM with an improved Baum-Welch Algorithm. In 2012 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 28, pp. 29-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{chis_et_al:OASIcs.ICCSW.2012.29, author = {Chis, Tiberiu S. and Harrison, Peter G.}, title = {{Incremental HMM with an improved Baum-Welch Algorithm}}, booktitle = {2012 Imperial College Computing Student Workshop}, pages = {29--34}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-48-4}, ISSN = {2190-6807}, year = {2012}, volume = {28}, editor = {Jones, Andrew V.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2012.29}, URN = {urn:nbn:de:0030-drops-37613}, doi = {10.4230/OASIcs.ICCSW.2012.29}, annote = {Keywords: hidden Markov model, Baum-Welch algorithm, Backward algorithm, discrete Markov arrival process, incremental workload model} }
Feedback for Dagstuhl Publishing