prikaz prve stranice dokumenta Kompleksnost skrivenih Markovljevih modela
  Download
PDF 2.46 MB
master's thesis
Kompleksnost skrivenih Markovljevih modela
Zagreb: University of Zagreb, Faculty of Science, 2018. urn:nbn:hr:217:619343
Horvatek, Tea
University of Zagreb
Faculty of Science
Department of Mathematics

Institutional repository: Repository of the Faculty of Science

Cite this document

Horvatek, T. (2018). Kompleksnost skrivenih Markovljevih modela (Master's thesis). Zagreb: University of Zagreb, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:217:619343

Horvatek, Tea. "Kompleksnost skrivenih Markovljevih modela." Master's thesis, University of Zagreb, Faculty of Science, 2018. https://urn.nsk.hr/urn:nbn:hr:217:619343

Horvatek, Tea. "Kompleksnost skrivenih Markovljevih modela." Master's thesis, University of Zagreb, Faculty of Science, 2018. https://urn.nsk.hr/urn:nbn:hr:217:619343

Horvatek, T. (2018). 'Kompleksnost skrivenih Markovljevih modela', Master's thesis, University of Zagreb, Faculty of Science, accessed 03 November 2024, https://urn.nsk.hr/urn:nbn:hr:217:619343

Horvatek T. Kompleksnost skrivenih Markovljevih modela [Master's thesis]. Zagreb: University of Zagreb, Faculty of Science; 2018 [cited 2024 November 03] Available at: https://urn.nsk.hr/urn:nbn:hr:217:619343

T. Horvatek, "Kompleksnost skrivenih Markovljevih modela", Master's thesis, University of Zagreb, Faculty of Science, Zagreb, 2018. Available at: https://urn.nsk.hr/urn:nbn:hr:217:619343

Metadata
TitleKompleksnost skrivenih Markovljevih modela
AuthorTea Horvatek
MentorPavle Goldstein (mentor)
Committee memberPavle Goldstein (predsjednik povjerenstva)
Committee memberZoran Vondraček (član povjerenstva)
Committee memberŽeljka Milin-Šipuš (član povjerenstva)
Committee memberSonja Štimac (član povjerenstva)
GranterUniversity of Zagreb
Faculty of Science
(Department of Mathematics)
Zagreb
Defense date and country2018-02-01, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Abstract
U ovom diplomskom radu bavili smo se analizom skrivenih Markovljevih modela. Dana je njihova formalna definicija te opisani neki algoritmi za njihovu analizu. Algoritme smo implementirali u programskom jeziku Python te primijenili na modelu nepoštene kockarnice s 32-stranim ``kockama". Prikazano je nekoliko poznatih statističkih metoda za odabir najboljeg modela, međutim, nijedna nije dala zadovoljavajući rezultat pri primjeni na procjenu kompleksnosti skrivenih Markovljevih modela. Zato u radu predlažemo novi kriterij, koji daje bolje rezultate.
Abstract (english)
This thesis is concerned with analysis of hidden Markov models. We give a formal definition of an HMM and describe several algorithms used in their analysis. We implement these algorithms in Python and show their application on an occasionally dishonest casino model with 32-sided “cubes”. We describe several known statistical methods for choosing the best model. However, none give satisfying results when used to assess the complexity of given hidden Markov model. Therefore, we propose a new criterion which gives better results.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:217:619343
Study programmeTitle: Finance and Business Mathematics
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 on2018-11-23 14:00:59