Skip to main content Accessibility help
×
    Show more authors
  • You may already have access via personal or institutional login
  • Select format
  • Publisher:
    Cambridge University Press
    Publication date:
    01 February 2018
    08 February 2018
    ISBN:
    9781108377423
    9781108441988
    Dimensions:
    Weight & Pages:
    Dimensions:
    (228 x 152 mm)
    Weight & Pages:
    0.29kg, 184 Pages
You may already have access via personal or institutional login
  • Selected: Digital
    Add to cart View cart Buy from Cambridge.org

    Book description

    Markov chains and hidden Markov chains have applications in many areas of engineering and genomics. This book provides a basic introduction to the subject by first developing the theory of Markov processes in an elementary discrete time, finite state framework suitable for senior undergraduates and graduates. The authors then introduce semi-Markov chains and hidden semi-Markov chains, before developing related estimation and filtering results. Genomics applications are modelled by discrete observations of these hidden semi-Markov chains. This book contains new results and previously unpublished material not available elsewhere. The approach is rigorous and focused on applications.

    Reviews

    '… this book is of interest to researchers attracted by hidden Markov and semi-Markov models. It covers probabilistic and statistical treatments of the considered topics, and introduces the reader … to possible applications, mainly in genomics. Hence, Ph.D. students and specialists in the area of hidden Markov processes are invited to consider this book as a reference in their activities.'

    Antonio Di Crescenzo Source: MathSciNet

    ‘… dedicated mostly to graduate students and providing a rigorous and rather complete mathematical introduction to the theory of hidden Markov models as well as hidden semi-Markov models under main assumption that the hidden process is a finite state Markov chain. The semi-Markov models appear when the assumption that the length of time the chain spends in any state is geometrically distributed is relaxed. The authors carefully construct these processes on the canonical probability space and then derive filters and smoother, as well as the Viterbi estimates. The central role plays the EM Algorithm.’

    Jerzy Ombach Source: ZB Math Reviews

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    ×

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.