Cargando…
Hidden Semi-Markov models : theory, algorithms and applications /
Hidden semi-Markov models (HSMMs) are among the most important models in the area of artificial intelligence / machine learning. Since the first HSMM was introduced in 1980 for machine recognition of speech, three other HSMMs have been proposed, with various definitions of duration and observation d...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam, Netherlands :
Elsevier,
[2016]
|
| Colección: | Computer science reviews and trends.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Ii 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn927103680 | ||
| 003 | OCoLC | ||
| 005 | 20231120112030.0 | ||
| 006 | m o d | ||
| 007 | cr cnu|||unuuu | ||
| 008 | 151028t20162016ne a ob 000 0 eng d | ||
| 010 | |a 2016499632 | ||
| 040 | |a N$T |b eng |e rda |e pn |c N$T |d N$T |d YDXCP |d CDX |d OCLCF |d UMI |d OPELS |d COO |d DEBBG |d VT2 |d VGM |d NRC |d U3W |d D6H |d CEF |d OCLCQ |d AU@ |d WYU |d TKN |d OCLCQ |d LQU |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 932322886 |a 988674515 |a 1008944558 |a 1066572101 |a 1103274034 |a 1105195444 |a 1105575051 |a 1129336690 |a 1151723321 | ||
| 020 | |a 9780128027714 |q (electronic bk.) | ||
| 020 | |a 0128027711 |q (electronic bk.) | ||
| 020 | |a 0128027673 | ||
| 020 | |a 9780128027677 | ||
| 020 | |z 9780128027677 | ||
| 035 | |a (OCoLC)927103680 |z (OCoLC)932322886 |z (OCoLC)988674515 |z (OCoLC)1008944558 |z (OCoLC)1066572101 |z (OCoLC)1103274034 |z (OCoLC)1105195444 |z (OCoLC)1105575051 |z (OCoLC)1129336690 |z (OCoLC)1151723321 | ||
| 050 | 4 | |a QA274.7 | |
| 072 | 7 | |a MAT |x 003000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 029000 |2 bisacsh | |
| 082 | 0 | 4 | |a 519.2/33 |2 23 |
| 100 | 1 | |a Yu, Shun-Zheng, |e author. | |
| 245 | 1 | 0 | |a Hidden Semi-Markov models : |b theory, algorithms and applications / |c Shun-Zheng Yu. |
| 264 | 4 | |c �2016 | |
| 264 | 1 | |a Amsterdam, Netherlands : |b Elsevier, |c [2016] | |
| 300 | |a 1 online resource : |b illustrations. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Computer science reviews and trends | |
| 504 | |a Includes bibliographical references. | ||
| 588 | 0 | |a Online resource; title from PDF title page (EBSCO, viewed October 29, 2015). | |
| 520 | |a Hidden semi-Markov models (HSMMs) are among the most important models in the area of artificial intelligence / machine learning. Since the first HSMM was introduced in 1980 for machine recognition of speech, three other HSMMs have been proposed, with various definitions of duration and observation distributions. Those models have different expressions, algorithms, computational complexities, and applicable areas, without explicitly interchangeable forms. Hidden Semi-Markov Models: Theory, Algorithms and Applications provides a unified and foundational approach to HSMMs, including various HSMMs (such as the explicit duration, variable transition, and residential time of HSMMs), inference and estimation algorithms, implementation methods and application instances. Learn new developments and state-of-the-art emerging topics as they relate to HSMMs, presented with examples drawn from medicine, engineering and computer science. | ||
| 505 | 0 | |a Machine generated contents note: ch. 1 Introduction -- 1.1. Markov Renewal Process and Semi-Markov Process -- 1.2. Hidden Markov Models -- 1.3. Dynamic Bayesian Networks -- 1.4. Conditional Random Fields -- 1.5. Hidden Semi-Markov Models -- 1.6. History of Hidden Semi-Markov Models -- ch. 2 General Hidden Semi-Markov Model -- 2.1.A General Definition of HSMM -- 2.2. Forward -- Backward Algorithm for HSMM -- 2.3. Matrix Expression of the Forward -- Backward Algorithm -- 2.4. Forward-Only Algorithm for HSMM -- 2.5. Viterbi Algorithm for HSMM -- 2.6. Constrained-Path Algorithm for HSMM -- ch. 3 Parameter Estimation of General HSMM -- 3.1. EM Algorithm and Maximum-Likelihood Estimation -- 3.2. Re-estimation Algorithms of Model Parameters -- 3.3. Order Estimation of HSMM -- 3.4. Online Update of Model Parameters -- ch. 4 Implementation of HSMM Algorithms -- 4.1. Heuristic Scaling -- 4.2. Posterior Notation -- 4.3. Logarithmic Form -- 4.4. Practical Issues in Implementation -- ch. 5 Conventional HSMMs. | |
| 505 | 0 | |a Note continued: 5.1. Explicit Duration HSMM -- 5.2. Variable Transition HSMM -- 5.3. Variable-Transition and Explicit-Duration Combined HSMM -- 5.4. Residual Time HSMM -- ch. 6 Various Duration Distributions -- 6.1. Exponential Family Distribution of Duration -- 6.2. Discrete Coxian Distribution of Duration -- 6.3. Duration Distributions for Viterbi HSMM Algorithms -- ch. 7 Various Observation Distributions -- 7.1. Typical Parametric Distributions of Observations -- 7.2.A Mixture of Distributions of Observations -- 7.3. Multispace Probability Distributions -- 7.4. Segmental Model -- 7.5. Event Sequence Model -- ch. 8 Variants of HSMMs -- 8.1. Switching HSMM -- 8.2. Adaptive Factor HSMM -- 8.3. Context-Dependent HSMM -- 8.4. Multichannel HSMM -- 8.5. Signal Model of HSMM -- 8.6. Infinite HSMM and HDP-HSMM -- 8.7. HSMM Versus HMM -- ch. 9 Applications of HSMMs -- 9.1. Speech Synthesis -- 9.2. Human Activity Recognition -- 9.3.Network Traffic Characterization and Anomaly Detection. | |
| 650 | 0 | |a Markov processes. | |
| 650 | 0 | |a Renewal theory. | |
| 650 | 6 | |a Processus de Markov. |0 (CaQQLa)201-0024070 | |
| 650 | 6 | |a Th�eorie du renouvellement. |0 (CaQQLa)201-0062133 | |
| 650 | 7 | |a MATHEMATICS |x Applied. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Probability & Statistics |x General. |2 bisacsh | |
| 650 | 7 | |a Markov processes |2 fast |0 (OCoLC)fst01010347 | |
| 650 | 7 | |a Renewal theory |2 fast |0 (OCoLC)fst01094620 | |
| 776 | 0 | 8 | |i Print version: |a Yu, Shun-Zheng. |t Hidden semi-markov models : theory, algorithms and applications. |d Amsterdam, [Netherlands] : Elsevier, �2016 |h ix, 195 pages |k Computer science reviews and trends. |z 9780128027677 |
| 830 | 0 | |a Computer science reviews and trends. | |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780128027677 |z Texto completo |