02073nam 2200217 n 450 001001100000049001300011100004000024200009300064300006100157328004500218330126000263336000801523689003201531689005401563700002501617801001801642856017401660997000701834FMT000701841FOR000701848TD13053000 aTDMAGDIG a20190501d2010------k--ita-50----ba 1 aPartial exchangeability and change detection for hidden Markov modelsbTesi di dottorato aIn relazione con http://paduaresearch.cab.unipd.it/3162/ 0btesi di dottoratocING-INF/04 Automatica aThe thesis focuses on Hidden Markov Models (HMMs). They are very popular models, because they have a more versatile structure than independent identically distributed sequences or Markov chains, but they are still tractable. It is thus of interest to look for properties of i.i.d. sequences that hold true also for HHMs, and this is the object of the thesis. In the first part we concentrate on a probabilistic problem. In particular we focus on exchangeable and partially exchangeable sequences, and we find conditions to realize them as HHMs. For a special class of binary exchangeable sequences we also give a realization algorithm. In the second part we consider the problem of detecting changes in the statistical pattern of a hidden Markov process. Adapting to HHMs the so-called cumulative sum (CUSUM) algorithm, first introduced for independent observations, we are led to the study of the CUSUM statistics with L-mixing input sequence. We establish a loss of memory property of the CUSUM statistics when there is no change, first in the easier case of a i.i.d. input sequence, (with negative expectation, and finite exponential moments of some positive order), and then, under some technical conditions, for bounded and L-mixing input sequence. apdf0 aING-INF/04bAutomaticacTDR0 aMAT/06bProbabilitÃ e statistica matematicacTDR 0aProsdocimi , Cecilia 3aITbIT-FI00984 uhttp://memoria.depositolegale.it/*/http://paduaresearch.cab.unipd.it/3162/1/prosdocimi_phd_thesis.pdf2http://paduaresearch.cab.unipd.it/3162/1/prosdocimi_phd_thesis.pdf aCF aTD aTD