Expectation maximization as message passing

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005-January, Issue , 2005, Pages

  Dauwels, Justin ^a   Korl, Sascha ^a   Loeliger, Hans Andrea ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; INFORMATION THEORY; MAXIMUM PRINCIPLE;

EXPECTATION - MAXIMIZATIONS; EXPECTATION MAXIMIZATION; FACTOR GRAPHS; MESSAGE PASSING ALGORITHM;

MESSAGE PASSING;

EID: 85114320855     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523402     Document Type: Conference Paper

References (10)

1. M. I. Jordan and T.J. Sejnowski, eds., Graphical Models: Foundations of Neural Computation. MIT Press, 2001.
2. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Trans. Information Theory, vol. 47, pp. 498-519, Feb. 2001.
3. H.-A. Loeliger, “An introduction to factor graphs,” IEEE Signal Proc. Mag., Jan. 2004, pp. 28-41.
4. H.-A. Loeliger, J. Dauwels, V. M. Koch, and S. Korl, “Signal processing with factor graphs: examples,” Proc. First Int. Symp. on Control, Communications and Signal Processing, March 21-24, Hammamet, Tunisia, pp. 571-574.
5. A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Journal of the Royal Statistical Society, vol. 39, Series B, pp. 1-38, 1977.
6. P. Stoica and Y. Selén, “Cyclic minimizers, majorization techniques, and the expectation-maximization algorithm: a refresher,” IEEE Signal Proc. Mag., January 2004, pp. 112-114.
7. S. Lauritzen, “The EM algorithm for graphical association models with missing data,” Computational Statistics and Data Analysis, vol. 19, pp. 191-201, 1995.
8. Z. Ghahramani, “Unsupervised Learning,” in Advanced Lectures on Machine Learning, Bousquet et al., Eds., Springer Verlag 2004.
9. A. W. Eckford and S. Pasupathy, “Iterative multiuser detection with graphical modeling,” IEEE Int. Conf. on Personal Wireless Communications, Hyderabad, India, 2000.
10. A. W. Eckford, “Channel estimation in block fading channels using the factor graph EM algorithm,” 22nd Biennial Symposium on Communications, Kingston, Ontario, Canada, May 31 - June 3, 2004. http://www.comm.toronto.edu/ eckford/pubs/index.html