| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ilić, Velimir | en |
| dc.contributor.author | Stanković, Miomir | en |
| dc.contributor.author | Todorović, Branimir | en |
| dc.date.accessioned | 2020-04-27T10:55:14Z | - |
| dc.date.available | 2020-04-27T10:55:14Z | - |
| dc.date.issued | 2011-01-01 | en |
| dc.identifier.issn | 0018-9448 | en |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/869 | - |
| dc.description.abstract | The paper proposes a new message passing algorithm for cycle-free factor graphs. The proposed "entropy message passing" (EMP) algorithm may be viewed as sum-product message passing over the entropy semiring, which has previously appeared in automata theory. The primary use of EMP is to compute the entropy of a model. However, EMP can also be used to compute expressions that appear in expectation maximization and in gradient-descent algorithms. | en |
| dc.publisher | IEEE | - |
| dc.relation.ispartof | IEEE Transactions on Information Theory | en |
| dc.subject | Commutative semiring | entropy | expectation maximization | factor graphs | gradient methods | graphical models | sum-product message passing | en |
| dc.title | Entropy message passing | en |
| dc.type | Article | en |
| dc.identifier.doi | 10.1109/TIT.2010.2090235 | en |
| dc.identifier.scopus | 2-s2.0-78650916697 | en |
| dc.relation.firstpage | 375 | en |
| dc.relation.lastpage | 380 | en |
| dc.relation.issue | 1 | en |
| dc.relation.volume | 57 | en |
| dc.description.rank | M21a | - |
| item.fulltext | No Fulltext | - |
| item.openairetype | Article | - |
| item.grantfulltext | none | - |
| item.cerifentitytype | Publications | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| crisitem.author.orcid | 0000-0002-4705-5856 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.