کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
535790 | 870379 | 2012 | 9 صفحه PDF | دانلود رایگان |
The paper proposes a numerically stable recursive algorithm for the exact computation of the linear-chain conditional random field gradient. It operates as a forward algorithm over the log-domain expectation semiring and has the purpose of enhancing memory efficiency when applied to long observation sequences. Unlike the traditional algorithm based on the forward–backward recursions, the memory complexity of our algorithm does not depend on the sequence length. The experiments on real data show that it can be useful for the problems which deal with long sequences.
► The memory complexity of the EMP algorithm does not depend on the sequence length.
► The EMP computational complexity is the same as the standard algorithm.
► The algorithm is useful in the long sequence labeling tasks.
Journal: Pattern Recognition Letters - Volume 33, Issue 13, 1 October 2012, Pages 1776–1784