prikaz prve stranice dokumenta Kompleksnost skrivenih Markovljevih modela
  Download
PDF 560.44 KB
master's thesis
Kompleksnost skrivenih Markovljevih modela
Zagreb: University of Zagreb, Faculty of Science, 2015. urn:nbn:hr:217:827216
Tepić, Martina
University of Zagreb
Faculty of Science
Department of Mathematics

Institutional repository: Repository of the Faculty of Science

Cite this document

Tepić, M. (2015). Kompleksnost skrivenih Markovljevih modela (Master's thesis). Zagreb: University of Zagreb, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:217:827216

Tepić, Martina. "Kompleksnost skrivenih Markovljevih modela." Master's thesis, University of Zagreb, Faculty of Science, 2015. https://urn.nsk.hr/urn:nbn:hr:217:827216

Tepić, Martina. "Kompleksnost skrivenih Markovljevih modela." Master's thesis, University of Zagreb, Faculty of Science, 2015. https://urn.nsk.hr/urn:nbn:hr:217:827216

Tepić, M. (2015). 'Kompleksnost skrivenih Markovljevih modela', Master's thesis, University of Zagreb, Faculty of Science, accessed 23 December 2024, https://urn.nsk.hr/urn:nbn:hr:217:827216

Tepić M. Kompleksnost skrivenih Markovljevih modela [Master's thesis]. Zagreb: University of Zagreb, Faculty of Science; 2015 [cited 2024 December 23] Available at: https://urn.nsk.hr/urn:nbn:hr:217:827216

M. Tepić, "Kompleksnost skrivenih Markovljevih modela", Master's thesis, University of Zagreb, Faculty of Science, Zagreb, 2015. Available at: https://urn.nsk.hr/urn:nbn:hr:217:827216

Metadata
TitleKompleksnost skrivenih Markovljevih modela
AuthorMartina Tepić
MentorPavle Goldstein (mentor)
Committee memberPavle Goldstein (predsjednik povjerenstva)
Committee memberZvonimir Bujanović (član povjerenstva)
Committee memberMladen Vuković (član povjerenstva)
Committee memberZrinka Franušić (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Science
(Department of Mathematics)
Zagreb
Defense date and country2015-02-26, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
U ovom diplomskom radu smo se bavili skrivenim Markovljevim modelima, moćnim statističkim alatom koji je namijenjen modeliranju nizova koje generira neki skriveni proces. Dali smo formalnu definiciju skrivenog Markovljevog modela, opisali varijante algoritma koje koristimo i implementirali ih u programskom jeziku Python. Na primjeru dvije nesimetrične kocke konstruirali smo Markovljev model i za procjenu parametara i povećanje vjerodostojnosti iskoristili Viterbijevo treniranje sa i bez determinističkog kaljenja. Uočili smo da nam Viterbijevo treniranje sa determinističkim kaljenjem radi bolje od treniranja bez kaljenja.
Abstract (english)
This thesis is concerned with a statistical model called hidden Markov model (HMM), powerful statistical tool designed for modelling sequences generated by hidden processes. We gave a formal definition of the hidden Markov model, described various algorithms and implemented them in Python. Using the example of two asymmetric dies, we designed an HMM and used Viterbi training with and without deterministic annealing to optimize the parameters. We have noticed that Viterbi training with deterministic annealing works better than the one without annealing.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:217:827216
Study programmeTitle: Mathematical Statistics
Study programme type: university
Study level: graduate
Academic / professional title: magistar/magistra matematike (magistar/magistra matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2019-02-15 08:04:31