Please use this identifier to cite or link to this item:
|Title:||Gradient computation in linear-chain conditional random fields using the entropy message passing algorithm||Authors:||Ilić, Velimir
|Issue Date:||1-Oct-2012||Journal:||Pattern Recognition Letters||Abstract:||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. © 2012 Elsevier B.V. All rights reserved.||URI:||https://open.ni.ac.rs/handle/123456789/6146||ISSN:||01678655||DOI:||10.1016/j.patrec.2012.05.017|
|Appears in Collections:||Naučne i umetničke publikacije|
Show full item record
checked on Sep 5, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.