Scalable Bayesian Inference for Coupled Hidden Markov and Semi-Markov Models
Bayesian inference for coupled hidden Markov models frequently relies on data augmentation techniques for imputation of the hidden state processes. Considerable progress has been made on developing such techniques, mainly using Markov chain Monte Carlo (MCMC) methods. However, as the dimensionality...
Saved in:
| Published in: | Journal of computational and graphical statistics Vol. 29; no. 2; pp. 238 - 249 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
Taylor & Francis
02.04.2020
Taylor & Francis Ltd |
| Subjects: | |
| ISSN: | 1061-8600, 1537-2715 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Bayesian inference for coupled hidden Markov models frequently relies on data augmentation techniques for imputation of the hidden state processes. Considerable progress has been made on developing such techniques, mainly using Markov chain Monte Carlo (MCMC) methods. However, as the dimensionality and complexity of the hidden processes increase some of these methods become inefficient, either because they produce MCMC chains with high autocorrelation or because they become computationally intractable. Motivated by this fact we developed a novel MCMC algorithm, which is a modification of the forward filtering backward sampling algorithm, that achieves a good balance between computation and mixing properties, and thus can be used to analyze models with large numbers of hidden chains. Even though our approach is developed under the assumption of a Markovian model, we show how this assumption can be relaxed leading to minor modifications in the algorithm. Our approach is particularly well suited to epidemic models, where the hidden Markov chains represent the infection status of an individual through time. The performance of our method is assessed on simulated data on epidemic models for the spread of Escherichia coli O157:H7 in cattle.
Supplementary materials
for this article are available online. |
|---|---|
| AbstractList | Bayesian inference for coupled hidden Markov models frequently relies on data augmentation techniques for imputation of the hidden state processes. Considerable progress has been made on developing such techniques, mainly using Markov chain Monte Carlo (MCMC) methods. However, as the dimensionality and complexity of the hidden processes increase some of these methods become inefficient, either because they produce MCMC chains with high autocorrelation or because they become computationally intractable. Motivated by this fact we developed a novel MCMC algorithm, which is a modification of the forward filtering backward sampling algorithm, that achieves a good balance between computation and mixing properties, and thus can be used to analyze models with large numbers of hidden chains. Even though our approach is developed under the assumption of a Markovian model, we show how this assumption can be relaxed leading to minor modifications in the algorithm. Our approach is particularly well suited to epidemic models, where the hidden Markov chains represent the infection status of an individual through time. The performance of our method is assessed on simulated data on epidemic models for the spread of Escherichia coli O157:H7 in cattle. Supplementary materials for this article are available online. Bayesian inference for coupled hidden Markov models frequently relies on data augmentation techniques for imputation of the hidden state processes. Considerable progress has been made on developing such techniques, mainly using Markov chain Monte Carlo (MCMC) methods. However, as the dimensionality and complexity of the hidden processes increase some of these methods become inefficient, either because they produce MCMC chains with high autocorrelation or because they become computationally intractable. Motivated by this fact we developed a novel MCMC algorithm, which is a modification of the forward filtering backward sampling algorithm, that achieves a good balance between computation and mixing properties, and thus can be used to analyze models with large numbers of hidden chains. Even though our approach is developed under the assumption of a Markovian model, we show how this assumption can be relaxed leading to minor modifications in the algorithm. Our approach is particularly well suited to epidemic models, where the hidden Markov chains represent the infection status of an individual through time. The performance of our method is assessed on simulated data on epidemic models for the spread of Escherichia coli O157:H7 in cattle. Supplementary materials for this article are available online. Bayesian inference for coupled hidden Markov models frequently relies on data augmentation techniques for imputation of the hidden state processes. Considerable progress has been made on developing such techniques, mainly using Markov chain Monte Carlo (MCMC) methods. However, as the dimensionality and complexity of the hidden processes increase some of these methods become inefficient, either because they produce MCMC chains with high autocorrelation or because they become computationally intractable. Motivated by this fact we developed a novel MCMC algorithm, which is a modification of the forward filtering backward sampling algorithm, that achieves a good balance between computation and mixing properties, and thus can be used to analyze models with large numbers of hidden chains. Even though our approach is developed under the assumption of a Markovian model, we show how this assumption can be relaxed leading to minor modifications in the algorithm. Our approach is particularly well suited to epidemic models, where the hidden Markov chains represent the infection status of an individual through time. The performance of our method is assessed on simulated data on epidemic models for the spread of Escherichia coli O157:H7 in cattle. Supplementary materials for this article are available online.Bayesian inference for coupled hidden Markov models frequently relies on data augmentation techniques for imputation of the hidden state processes. Considerable progress has been made on developing such techniques, mainly using Markov chain Monte Carlo (MCMC) methods. However, as the dimensionality and complexity of the hidden processes increase some of these methods become inefficient, either because they produce MCMC chains with high autocorrelation or because they become computationally intractable. Motivated by this fact we developed a novel MCMC algorithm, which is a modification of the forward filtering backward sampling algorithm, that achieves a good balance between computation and mixing properties, and thus can be used to analyze models with large numbers of hidden chains. Even though our approach is developed under the assumption of a Markovian model, we show how this assumption can be relaxed leading to minor modifications in the algorithm. Our approach is particularly well suited to epidemic models, where the hidden Markov chains represent the infection status of an individual through time. The performance of our method is assessed on simulated data on epidemic models for the spread of Escherichia coli O157:H7 in cattle. Supplementary materials for this article are available online. Bayesian inference for coupled hidden Markov models frequently relies on data augmentation techniques for imputation of the hidden state processes. Considerable progress has been made on developing such techniques, mainly using Markov chain Monte Carlo (MCMC) methods. However, as the dimensionality and complexity of the hidden processes increase some of these methods become inefficient, either because they produce MCMC chains with high autocorrelation or because they become computationally intractable. Motivated by this fact we developed a novel MCMC algorithm, which is a modification of the forward filtering backward sampling algorithm, that achieves a good balance between computation and mixing properties, and thus can be used to analyze models with large numbers of hidden chains. Even though our approach is developed under the assumption of a Markovian model, we show how this assumption can be relaxed leading to minor modifications in the algorithm. Our approach is particularly well suited to epidemic models, where the hidden Markov chains represent the infection status of an individual through time. The performance of our method is assessed on simulated data on epidemic models for the spread of O157:H7 in cattle. Supplementary materials for this article are available online. |
| Author | Spencer, Simon E. F. Touloupou, Panayiota Finkenstädt, Bärbel |
| Author_xml | – sequence: 1 givenname: Panayiota surname: Touloupou fullname: Touloupou, Panayiota email: P.Touloupou.1@warwick.ac.uk organization: Department of Statistics, University of Warwick – sequence: 2 givenname: Bärbel surname: Finkenstädt fullname: Finkenstädt, Bärbel organization: Department of Statistics, University of Warwick – sequence: 3 givenname: Simon E. F. surname: Spencer fullname: Spencer, Simon E. F. organization: Department of Statistics, University of Warwick |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/32939192$$D View this record in MEDLINE/PubMed |
| BookMark | eNqFkUtvEzEUhS1URB_wE0AjsWEzwY8ZP4SEgAhopVQsCmvLY98BF4-d2pOi_HscJa2gC1jZ1v3O0T0-p-gopggIPSd4QbDErwnmRHKMFxQTtSC876TEj9AJ6ZloqSD9Ub1Xpt1Bx-i0lGuMMeFKPEHHjCqmiKInaHVlTTBDgOaD2ULxJjYXcYQM0UIzptws02YdwDXn3jmIzaXJP9NtY6JrrmDy7eF9mRyE8hQ9Hk0o8OxwnqFvnz5-XZ63qy-fL5bvV63tFJ_bHhwRio-UgZRjZ1wnlBu4ZBK7oWdsUJJRQil03EpquB1G4Uw3MF7DOT6yM_R277veDBM4C3HOJuh19pPJW52M139Pov-hv6dbLbq-xz2vBq8OBjndbKDMevLFQggmQtoUTbuOSaGkIBV9-QC9Tpsca7xKEaWIYEpV6sWfG92vcvfRFej3gM2plAzjPUKw3hWq7wrVu0L1odCqe_NAZ_1sZp92wXz4r_rdXu1j7XIyv1IOTs9mG1Ies4nWF83-bfEb7WS3tg |
| CitedBy_id | crossref_primary_10_1016_j_iswa_2023_200277 crossref_primary_10_1016_j_epidem_2022_100547 crossref_primary_10_1111_ele_13610 crossref_primary_10_1007_s11222_025_10584_z crossref_primary_10_1109_TAI_2022_3227222 crossref_primary_10_1111_rssc_12547 crossref_primary_10_1371_journal_pcbi_1012592 crossref_primary_10_1007_s42113_022_00147_0 crossref_primary_10_1016_j_jmp_2024_102884 crossref_primary_10_3389_fevo_2021_623731 crossref_primary_10_1109_TPAMI_2023_3244130 crossref_primary_10_1214_25_AOAS2048 crossref_primary_10_1177_1471082X20956423 |
| Cites_doi | 10.1198/016214502753479464 10.1214/11-AAP806 10.1201/b10905-6 10.1111/1467-985X.00125 10.1093/biomet/81.3.541 10.1128/AEM.01742-06 10.1023/A:1007649326333 10.1007/978-3-319-24277-4 10.1016/0304-4076(95)01770-4 10.2307/1426145 10.1093/oso/9780198545996.001.0001 10.1080/10618600.2017.1328365 10.1109/CVPR.1997.609450 10.1109/IJCNN.2002.1007657 10.1111/rssc.12015 10.1098/rsif.2015.0446 10.1093/imammb/15.1.19 |
| ContentType | Journal Article |
| Copyright | 2019 The Author(s). Published with license by Taylor & Francis Group, LLC 2019 2019 The Author(s). Published with license by Taylor & Francis Group, LLC. 2019 The Author(s). Published with license by Taylor & Francis Group, LLC. This work is licensed under the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. 2019 The Author(s). Published with license by Taylor & Francis Group, LLC 2019 The Author(s) |
| Copyright_xml | – notice: 2019 The Author(s). Published with license by Taylor & Francis Group, LLC 2019 – notice: 2019 The Author(s). Published with license by Taylor & Francis Group, LLC. – notice: 2019 The Author(s). Published with license by Taylor & Francis Group, LLC. This work is licensed under the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. – notice: 2019 The Author(s). Published with license by Taylor & Francis Group, LLC 2019 The Author(s) |
| DBID | 0YH AAYXX CITATION NPM JQ2 7X8 5PM |
| DOI | 10.1080/10618600.2019.1654880 |
| DatabaseName | Taylor & Francis Open Access CrossRef PubMed ProQuest Computer Science Collection MEDLINE - Academic PubMed Central (Full Participant titles) |
| DatabaseTitle | CrossRef PubMed ProQuest Computer Science Collection MEDLINE - Academic |
| DatabaseTitleList | ProQuest Computer Science Collection MEDLINE - Academic PubMed |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 0YH name: Taylor & Francis Open Access url: https://www.tandfonline.com sourceTypes: Publisher – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Statistics Mathematics |
| DocumentTitleAlternate | P. Touloupou, B. Finkenstädt, and S. E. F. Spencer |
| EISSN | 1537-2715 |
| EndPage | 249 |
| ExternalDocumentID | PMC7455056 32939192 10_1080_10618600_2019_1654880 1654880 |
| Genre | Research Article Journal Article |
| GrantInformation_xml | – fundername: Medical Research Council grantid: MR/P026400/1 – fundername: ; grantid: MR/P026400/1 – fundername: ; ; grantid: OPP1152057; OPP1053230; OPP1156227 – fundername: ; ; grantid: EP/R018561/1 |
| GroupedDBID | -~X .4S .7F .DC .QJ 0BK 0R~ 0YH 30N 4.4 5GY AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFAN ABFIM ABJNI ABLIJ ABLJU ABPAQ ABPEM ABTAI ABXUL ABXYU ABYWD ACGFO ACGFS ACIWK ACMTB ACTIO ACTMH ADCVX ADGTB ADXHL AEGXH AELLO AENEX AEOZL AEPSL AEYOC AFRVT AFVYC AGDLA AGMYJ AHDZW AIAGR AIJEM AKBRZ AKBVH AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU AMVHM AQRUH AQTUD ARCSS AVBZW AWYRJ BLEHA CCCUG CS3 D0L DGEBU DKSSO DU5 EBS E~A E~B F5P GTTXZ H13 HF~ HZ~ H~P IPNFZ J.P JAA JMS KYCEM LJTGL M4Z MS~ NA5 NY~ O9- P2P PQQKQ RIG RNANH ROSJB RTWRZ RWL RXW S-T SNACF TAE TASJS TBQAZ TDBHL TEJ TFL TFT TFW TN5 TTHFI TUROJ TUS UT5 UU3 WZA XWC ZGOLN ~S~ AAYXX CITATION 07G 29K 2AX AAIKQ AAKBW AAWIL ABAWQ ABBHK ABQDR ABXSQ ACAGQ ACDIW ACGEE ACHJO ADODI ADULT ADYSH AEUMN AEUPB AGCQS AGLEN AGLNM AGROQ AHMOU AIHAF ALCKM ALRMG AMATQ AMEWO AMXXU BCCOT BPLKW C06 CRFIH D-I DMQIW DQDLB DSRWC DWIFK ECEWR EJD FEDTE GIFXF HGD HQ6 HVGLF IPSME IVXBP JAAYA JBMMH JBZCM JENOY JHFFW JKQEH JLEZI JLXEF JPL JST NPM NUSFT QCRFL RNS SA0 TAQ TFMCV TOXWX UB9 JQ2 7X8 5PM |
| ID | FETCH-LOGICAL-c496t-5ed1796f23e88f4ad479db68380db533b9832122e46c82a6cbf7da4b36153d6f3 |
| IEDL.DBID | TFW |
| ISICitedReferencesCount | 19 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000549330600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1061-8600 |
| IngestDate | Tue Nov 04 02:01:38 EST 2025 Thu Oct 02 05:19:02 EDT 2025 Mon Nov 10 02:59:11 EST 2025 Mon Jul 21 06:04:55 EDT 2025 Sat Nov 29 03:24:17 EST 2025 Tue Nov 18 21:39:54 EST 2025 Mon Oct 20 23:47:06 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Epidemics Data augmentation Coupled hidden Markov model Markov chain Monte Carlo methods Forward–backward algorithm |
| Language | English |
| License | open-access: http://creativecommons.org/licenses/by/4.0/: This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.: http://creativecommons.org/licenses/by/4.0 2019 The Author(s). Published with license by Taylor & Francis Group, LLC. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c496t-5ed1796f23e88f4ad479db68380db533b9832122e46c82a6cbf7da4b36153d6f3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 Color versions of one or more of the figures in the article can be found online at www.tandfonline.com/r/JCGS. Supplementary materials for this article are available online. Please go to www.tandfonline.com/r/JCGS. |
| OpenAccessLink | https://www.tandfonline.com/doi/abs/10.1080/10618600.2019.1654880 |
| PMID | 32939192 |
| PQID | 2419917399 |
| PQPubID | 29738 |
| PageCount | 12 |
| ParticipantIDs | proquest_journals_2419917399 proquest_miscellaneous_2443879871 crossref_primary_10_1080_10618600_2019_1654880 pubmed_primary_32939192 informaworld_taylorfrancis_310_1080_10618600_2019_1654880 crossref_citationtrail_10_1080_10618600_2019_1654880 pubmedcentral_primary_oai_pubmedcentral_nih_gov_7455056 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-04-02 |
| PublicationDateYYYYMMDD | 2020-04-02 |
| PublicationDate_xml | – month: 04 year: 2020 text: 2020-04-02 day: 02 |
| PublicationDecade | 2020 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States – name: Alexandria |
| PublicationTitle | Journal of computational and graphical statistics |
| PublicationTitleAlternate | J Comput Graph Stat |
| PublicationYear | 2020 |
| Publisher | Taylor & Francis Taylor & Francis Ltd |
| Publisher_xml | – name: Taylor & Francis – name: Taylor & Francis Ltd |
| References | Chimisov C. (CIT0007) 2018 CIT0010 Microsoft Corporation (CIT0014) 2018 R Core Team (CIT0018) 2016 CIT0012 Dong W. (CIT0009) 2012 CIT0011 Anderson R. M. (CIT0001) 1991 Neuts M. F. (CIT0016) 1975 CIT0015 CIT0017 CIT0019 CIT0021 CIT0020 CIT0023 CIT0022 Microsoft Corporation (CIT0013) 2017 CIT0003 CIT0025 CIT0002 CIT0024 CIT0005 CIT0004 CIT0006 CIT0008 |
| References_xml | – start-page: 227 volume-title: Proceedings of the Conference on Uncertainty in Artificial Intelligence year: 2012 ident: CIT0009 – ident: CIT0020 doi: 10.1198/016214502753479464 – year: 2018 ident: CIT0007 publication-title: arXiv no. 1801.09299 – volume-title: R: A Language and Environment for Statistical Computing year: 2016 ident: CIT0018 – ident: CIT0012 doi: 10.1214/11-AAP806 – year: 2018 ident: CIT0014 publication-title: R Package Version 1.0.14 – ident: CIT0015 doi: 10.1201/b10905-6 – ident: CIT0017 doi: 10.1111/1467-985X.00125 – ident: CIT0023 – ident: CIT0005 doi: 10.1093/biomet/81.3.541 – ident: CIT0008 doi: 10.1128/AEM.01742-06 – year: 2017 ident: CIT0013 publication-title: R Package Version 1.4.4 – ident: CIT0019 doi: 10.1023/A:1007649326333 – ident: CIT0024 doi: 10.1007/978-3-319-24277-4 – ident: CIT0006 doi: 10.1016/0304-4076(95)01770-4 – ident: CIT0002 doi: 10.2307/1426145 – start-page: 173 volume-title: Liber amicorum Professor Emeritus Dr. H. Florin year: 1975 ident: CIT0016 – volume-title: Infectious Diseases of Humans: Dynamics and Control year: 1991 ident: CIT0001 doi: 10.1093/oso/9780198545996.001.0001 – ident: CIT0010 doi: 10.1080/10618600.2017.1328365 – ident: CIT0004 doi: 10.1109/CVPR.1997.609450 – ident: CIT0003 – ident: CIT0025 doi: 10.1109/IJCNN.2002.1007657 – ident: CIT0021 doi: 10.1111/rssc.12015 – ident: CIT0022 doi: 10.1098/rsif.2015.0446 – ident: CIT0011 doi: 10.1093/imammb/15.1.19 |
| SSID | ssj0001697 |
| Score | 2.44964 |
| Snippet | Bayesian inference for coupled hidden Markov models frequently relies on data augmentation techniques for imputation of the hidden state processes.... |
| SourceID | pubmedcentral proquest pubmed crossref informaworld |
| SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 238 |
| SubjectTerms | Algorithms Bayesian analysis Computer simulation Coupled hidden Markov model Data augmentation E coli Epidemics Forward-backward algorithm Markov analysis Markov chain Monte Carlo methods Markov chains Monte Carlo simulation Scalable and Efficient Computation Statistical inference |
| Title | Scalable Bayesian Inference for Coupled Hidden Markov and Semi-Markov Models |
| URI | https://www.tandfonline.com/doi/abs/10.1080/10618600.2019.1654880 https://www.ncbi.nlm.nih.gov/pubmed/32939192 https://www.proquest.com/docview/2419917399 https://www.proquest.com/docview/2443879871 https://pubmed.ncbi.nlm.nih.gov/PMC7455056 |
| Volume | 29 |
| WOSCitedRecordID | wos000549330600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAWR databaseName: Taylor & Francis Journals Complete customDbUrl: eissn: 1537-2715 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001697 issn: 1061-8600 databaseCode: TFW dateStart: 19920301 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwEB5BxaEcCpRHA6UyEleX3dj14wgVq0UqFVILLKfIdhxRaZutmt1K_ffMJE7URa16gEukyJ7Ij7HnszPzDcD7gEYVFSlyG7TnMtcj7hDp8lEVqkprr0Kb7u3HkT4-NrOZ_Za8CZvkVkln6Kojimj3alrczje9R9wHOsUYNNTkmGX3KRwHlRB3YTT9lMPgdPJz2IvHKb0KSnAS6WN47vrKmnVa4y69DYH-7Uh5wzJNnvyHPj2FrQRL2cdOj57Bg1hvw-OvA6drsw2bhEs7WufncHSCc0tRV-yTu44UiMm-9KGDDLvDDheri3ks2ZQoSmpGIUGLK4bNYyfx_Iynd8rENm9ewPfJ59PDKU-JGXiQVi35QSxxHasqF9GYSrpSalt6ZYQZlR7xo7eU_yjPo1TB5E4FX-nSSS8IXZaqEi9ho17UcQeYHjtpZMyFdkpqoT3iJTwSRa2DGLtQZiD7CSlCYi2n5BnzYpzITfuRK2jkijRyGewPYhcdbcd9AvbmbBfL9r6k6pKbFOIe2d1eNYq0AzQFIiOE3hrxXwbvhmJcu_RDxtVxsaI6Uhht8cyawatOk4bWCsRhFuF3BnpNx4YKxAu-XlKf_W75wTVFqh-o1__QpTewmdPFArko5buwsbxcxbfwKFyhnl3uwcPRryk-9czstevtDyeWIbA |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LTxsxEB4VWgl66AMo3UKpkbgakrVj7x4BgYIIuUArOFlery2Q0g0iCRL_npl9KamoOLTHlXdWfny2P3tnvgHYc7ipIpA8T53OuIx1h1tkurwTXAhaZ8qV6d5-DfRwmFxfp_OxMORWSWfoUAlFlGs1TW66jG5c4g7oGJPgTk2eWek-xeMgCpfgbY8yZyOmOzf9djXu1glW0ISTTRPF87fPLOxPC-qlL3HQP10p5_am04__o1Wf4EPNTNlhBaXP8MYXa_D-opV1nazBKlHTStl5HQaXOLwUeMWO7JOnWEx21kQPMmwPOx7P7kc-Z31SKSkYRQWNHxnWj13633e8fqZkbKPJBvw8Pbk67vM6NwN3MlVT3vM5TmUVYuGTJEibS53mmUpE0skzpJBZSimQ4thL5ZLYKpcFnVuZCSKYuQriCywX48J_Baa7VibSx0JbJbXQGVImPBV5rZ3oWpdHIJsRMa4WLqf8GSPTrfVNm54z1HOm7rkI9luz-0q54zWDdH64zbS8MglVfhMjXrHdbrBh6kVgYpAcIfvWSAEj2G2LcfrSPxlb-PGM3pECUYvH1gg2Kyi1tRVIxVJk4BHoBZC1L5A0-GJJcXdbSoRrClbvqW__0KQfsNK_uhiYwdnwfAtWY7pnII-leBuWpw8z_x3euUfE3MNOOeGeAXZrI8U |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwEB5BQagceBRoAwWMxDXtbuzazhEKq1Ysq0ot0Jvl-CEqLdlVd7cS_56ZxIm6CNQDHCNnIj9m7G-cmW8A3jo8VFGRQl46VeWiUIPcItLNB9HFqFQlXVPu7etYTSb6_Lw8SdGEixRWST50bIkimr2ajHvuYxcRt09ejMaDmgKzyj1Kx0ElvA13EDpL8r_ORt_6zXiY6qugSE4yXRLP3z6zdjytkZf-CYL-Hkl57WgaPfwPg3oEDxIuZe9aRXoMt0K9Bfc_96Suiy3YJGDa8jo_gfEpLi6lXbH39megTEx23OUOMhwOO5yt5tPg2RFxlNSMcoJmVwy7x07Dj4s8PVMptuniKXwZfTw7PMpTZYbciVIu84Pg0ZBlLHjQOgrrhSp9JTXXA18hgKxKKoBUFEFIpwsrXRWVt6LiBC-9jPwZbNSzOuwAU0MrtAgFV1YKxVWFgAl9oqCU40PrfAaiWxDjEm05Vc-YmmFiN-1mztDMmTRzGez1YvOWt-MmgfL6aptlc2ES2-omht8gu9uphklbwMIgNELsrRAAZvCmb0bjpT8ytg6zFb0juFYlOq0ZbLea1PeWIxArEX9noNZ0rH-BiMHXW-qL7w1BuKJU9QP5_B-G9BrunXwYmfHx5NML2CzokoHClYpd2FhersJLuOuuUOUuXzXm9gs82CKy |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Scalable+Bayesian+Inference+for+Coupled+Hidden+Markov+and+Semi-Markov+Models&rft.jtitle=Journal+of+computational+and+graphical+statistics&rft.au=Touloupou%2C+Panayiota&rft.au=Finkenst%C3%A4dt%2C+B%C3%A4rbel&rft.au=Spencer%2C+Simon+E+F&rft.date=2020-04-02&rft.issn=1061-8600&rft.volume=29&rft.issue=2&rft.spage=238&rft_id=info:doi/10.1080%2F10618600.2019.1654880&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1061-8600&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1061-8600&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1061-8600&client=summon |