A Comprehensive Guide to HSMM
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Mathematics and Science Textbooks > Mathematics > Probability and statistics > A Comprehensive Guide to HSMM
A Comprehensive Guide to HSMM

A Comprehensive Guide to HSMM


     0     
5
4
3
2
1



International Edition


X
About the Book

Hidden Semi-Markov Models (HSMMs) have been extensively used for diverse applications where the objective is to analyze time series whose dynamics can be explained by a hidden process.

A Comprehensive Guide to HSMM offers an accessible introduction to the framework of HSMM, covering the main methods and theoretical results for maximum likelihood estimation in HSMM. It also includes a unique review of existing R and Python software for HSMM estimation. The book then introduces less classical related topics, such as multi-chain HSMM and controlled HSMM, with an emphasis on the challenges related to computational complexity.

This book is primarily intended for master's and PhD students, researchers and academic faculty in the fields of statistics, applied probability, graphical models, computer science and connected domains. It is also meant to be accessible to practitioners involved in modeling, analysis or control of time series in the fields of reliability, theoretical ecology, signal processing, finance, medicine and epidemiology.



Table of Contents:

Introduction xi
Benoîte DESAPORTA, Jean-Baptiste DURAND, Alain FRANC and Nathalie PEYRARD

Chapter 1. Monochain HSMM 1
Jean-Baptiste DURAND, Alain FRANC, Nathalie PEYRARD, Nicolas VERGNE and Irene VOTSI

1.1. Introduction 1

1.2. HSMM framework 2

1.3. Inferential topics for HSMMs 11

1.4. Two toy examples reappearing throughout the book 22

1.5. Reliability 24

1.6. Introducing mixed effects into HSMMs 27

1.7. Conclusion/discussion 38

1.8. Notations 39

1.9. Acknowledgments 40

1.10. Appendix: EM algorithm for a monochain HMM 40

1.11. References 43

Chapter 2. Review of HSMM Rand Python Softwares 47
Caroline BÉRARD, Marie-Josée CROS, Jean-Baptiste DURAND, Corentin LOTHODÉ, Sandra PLANCADE, Ronan TRÉPOS and Nicolas VERGNE

2.1. Introduction 47

2.2. Software around HSMMs: state of the art 48

2.3. Comparative overview: Rand Python packages for HSMM. 62

2.4. Illustration of the use of two packages for the toy examples 66

2.5. Conclusion 75

2.6.References 75

Chapter 3. Multichain HMM 79
Hanna BACAVE, Jean-Baptiste DURAND, Alain FRANC, Nathalie PEYRARD, Sandra PLANCADE and Régis SABBADIN

3.1. Introduction 79

3.2. Different concepts of MHMM 81

3.3. Examples of models of class 1to1-MHMM-CI 90

3.4. Metapopulation dynamics and MHMM 96

3.5. Parameter inference in MHMMs with the EM algorithm 98

3.6. Approximate inference in MHMMs 106

3.7. Discussion and conclusion. 111

3.8. Notations 113

3.9. References. 114

Chapter 4. Multichain HSMM 117
Jean-Baptiste DURAND, Nathalie PEYRARD, Sandra PLANCADE and Régis SABBADIN

4.1. Multichain HSMM in literature 117

4.2. Formalization of an explicit duration coupled semi-Markov model with interaction at jump events 118

4.3. Definition of coupled SMM classes based on a time-indexed representation 122

4.4. Extension of some MHMM classes to semi-Markov framework 133

4.5. Discussion and conclusion 136

4.6. Notations 136

4.7. Appendix: proof of proposition 1 138

4.8. References 142

Chapter 5. The Forward-backward Algorithm with Matrix Calculus 143
Alain FRANC

5.1. Introduction 144

5.2. UHMDs, with elimination and marginalization algorithms 145

5.3. Complements on the complexity of elimination and marginalization algorithms for an UHMD 150

5.4. Hidden Markov model 154

5.5. Multichain hidden Markov models 159

5.6. Hidden semi-Markov models 166

5.7. Multichain HSMM 172

5.8. Conclusions and perspectives 176

5.9. Notations 178

5.10. Acknowledgments 179

5.11. Appendix: Viterbi algorithm and most likely state 179

5.12. References 184

Chapter 6. Controlled Hidden Semi-Markov Models 185
Alice CLEYNEN, Benoîte DESAPORTA, Orlane ROSSINI, Régis SABBADIN and Amélie VERNAY

6.1. Introduction 185

6.2. Markov decision processes 186

6.3. Piecewise deterministic Markov processes 200

6.4. Controlled PDMPs as members of the MDP family 215

6.5. Concluding remarks and open questions 222

6.6. Notations 223

6.7. Acknowledgments 225

6.8. References 226

List of Authors 231

Index 233



About the Author :

Nathalie Peyrard is Senior Scientist at INRAE, Toulouse, France. Her research includes computational statistics in models with latent variables, with applications in ecology.

Benoîte de Saporta is Professor of Applied Mathematics at the University of Montpellier, France. Her research includes applied probability (Markov processes, optimal stochastic control) and statistics (inference for partially hidden processes).


Best Sellers


Product Details
  • ISBN-13: 9781836690351
  • Publisher: ISTE Ltd
  • Publisher Imprint: ISTE Ltd
  • ISBN-10: 1836690355
  • Publisher Date: 19 Dec 2025


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
A Comprehensive Guide to HSMM
ISTE Ltd -
A Comprehensive Guide to HSMM
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

A Comprehensive Guide to HSMM

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!