Expectation maximization as message passing Export

@article{citeulike:3392578, abstract = {Based on prior work by Eckford, it is shown how expectation maximization (EM) may be viewed, and used, as a message passing algorithm in factor graphs.}, archivePrefix = {arXiv}, author = {Dauwels, J. and Korl, S. and Loeliger, H. A.}, citeulike-article-id = {3392578}, citeulike-linkout-0 = {http://arxiv.org/abs/cs/0508027v1}, citeulike-linkout-1 = {http://arxiv.org/pdf/cs/0508027v1}, day = {3}, eprint = {cs/0508027v1}, keywords = {em, factor-graph}, month = {Aug}, posted-at = {2008-10-10 08:50:59}, priority = {2}, title = {Expectation maximization as message passing}, url = {http://arxiv.org/abs/cs/0508027v1}, year = {2005} }

TY - JOUR ID - citeulike:3392578 L3 - citeulike-article-id:3392578 N2 - Based on prior work by Eckford, it is shown how expectation maximization (EM) may be viewed, and used, as a message passing algorithm in factor graphs. TI - Expectation maximization as message passing KW - em KW - factor-graph AU - Dauwels, J AU - Korl, S AU - Loeliger, HA PY - 2005/Aug/03/ UR - http://arxiv.org/abs/cs/0508027v1 ER -