Backward Algorithm

The Backward Algorithm is a dynamic programming method used in the context of Hidden Markov Models that computes the probability of observing the remaining sequence of events from a given time step onward, conditioned on being in a particular hidden state at that time, by recursively propagating backward through the sequence.

358

Publications

44.6K

Citations

859

Authors

455

Institutions

Publications per year

2017–2026

92

Variants

Backward Procedure

Authors

859

  1. NH
    Nguyen Huy Tuan

    Ton Duc Thang University, Vietnam

    8 publications · 227 citations

    7

    h-index

  2. TW
    Ting Wei

    Lanzhou University, China

    6 publications · 388 citations

    6

    h-index

  3. NJ
    Nicholas J. Higham

    University of Manchester, United Kingdom

    6 publications · 419 citations

    6

    h-index

  4. YZ
    Yong Zhou

    Xiangtan University, China

    4 publications · 122 citations

    4

    h-index

  5. JW
    Jungang Wang

    Northwestern Polytechnical University, China

    4 publications · 282 citations

    4

    h-index

1–5 of 859

Venues

  1. SIAM Journal on Matrix Analysis and Applications

    13 publications · 707 citations

    13

    h-index

  2. SIAM Journal on Scientific Computing

    8 publications · 280 citations

    8

    h-index

  3. Mathematics of Computation

    MCOM · 5 publications · 83 citations

    5

    h-index

  4. IEEE Transactions on Automatic Control

    5 publications · 167 citations

    5

    h-index

  5. Applied Optics

    5 publications · 145 citations

    5

    h-index

1–5