Fetching the paper…
Reading the bibliography…
It is shown how expectation maximization (EM) may be viewed as a message passing algorithm in factor graphs.
L. E. Baum, T. Petrie, G. Soules, and N. Weiss, “A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains,” Ann. Math. Statist., vol. 41, no. 1, pp. 164–171, 1970
1970
Earlier work this paper cites.
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
1977
Earlier work this paper cites.
R. H. Shumway and D. S. Stoffer, “An approach to time series smoothing and forecasting using the EM algorithm,” J. Time Series Analysis, vol. 3, pp. 253–264, 1982
1982
Earlier work this paper cites.
S. Lauritzen, “The EM algorithm for graphical association models with missing data,” Computational Statistics and Data Analysis, vol. 19, pp. 191–201, 1995
1995
Earlier work this paper cites.
B. J. Frey, F. R. Kschischang, H.-A. Loeliger, and N. Wiberg, “Factor graphs and algorithms,” Proc. 35th Allerton Conf. on Communications, Control, and Computing, (Allerton House, Monticello, Illinois), Sept. 29 – Oct. 1, 1997, pp. 666–680
1997
Earlier work this paper cites.
G. J. McLachlan and T. Krishnan, The EM Algorithm and Extensions. New York: Wiley, 1997
1997
Earlier work this paper cites.
L. Ljung, System Identification: Theory for the User. Prentice-Hall, 1999
1999
Earlier work this paper cites.
S. Roweis and Z. Ghahramani, “A unifying review of linear Gaussian models,” Neural Computation, vol. 11, pp. 305–345, 1999
1999
Earlier work this paper cites.
A. W. Eckford and S. Pasupathy, “Iterative multiuser detection with graphical modeling,” IEEE Int. Conf. on Personal Wireless Communications, Hyderabad, India, 2000
2000
Earlier work this paper cites.
M. I. Jordan and T.J. Sejnowski, eds., Graphical Models: Foundations of Neural Computation. MIT Press, 2001
2001
Earlier work this paper cites.
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
2001
Earlier work this paper cites.
G. D. Forney, Jr., “Codes on graphs: normal realizations,” IEEE Trans. Information Theory, vol. 47, no. 2, pp. 520–548, 2001
2001
Earlier work this paper cites.
C. Herzet, V. Ramon, L. Vandendorpe, and M. Moeneclaey, “EM algorithm based timing synchronization in turbo receivers,” Proc. 2003 ICASSP
2003
Cited alongside, same era.
N. Noels, C. Herzet, A. Dejonghe, V. Lottici, H. Steendam, M. Moenclaey, M. Luise, and L. Vandendorpe, “Turbo synchronization: an EM algorithm interpretation,” IEEE International Conference on Communications
2003
Cited alongside, same era.
E. P. Xing, M. I. Jordan, and S. Russel, “A generalized mean field algorithm for variational inference in exponential families,” Proc. Uncertainty in Artificial Intelligence (UAI2003), Morgan Kaufmann Publishers, pp. 583–591, 2003
2003
Cited alongside, same era.
H.-A. Loeliger, “An introduction to factor graphs,” IEEE Signal Proc. Mag., Jan. 2004, pp. 28–41
2004
Cited alongside, same era.
J. Dauwels, S. Korl, and H.-A. Loeliger, “Expectation maximization as message passing,” Proc. 2005 IEEE Int. Symp. on Information Theory, Adelaide, Australia, Sept. 4–9, 2005, pp. 583–586
2005
Later among the works it cites.
J. A. O’Sullivan, “Message passing expectation-maximization algorithms,” Proc. 2005 IEEE/SP 13th Workshop on Statistical Signal Processing, Bordeaux, France, pp. 841–846, July 2005
2005
Later among the works it cites.
J. M. Winn and C. M. Bishop, “Variational message passing,” J. Machine Learning Res., vol. 6, pp. 661–694, 2005
2005
Later among the works it cites.
S. Korl, A Factor Graph Approach to Signal Modelling, System Identification and Filtering. PhD thesis at ETH Zurich No 16170, 2005
2005
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2004
Cited alongside, same era.
Z. Ghahramani, “Unsupervised Learning,” in Advanced Lectures on Machine Learning, Bousquet et al., Eds., Springer Verlag 2004
2004
Cited alongside, same era.
S.-H. Wu, U. Mitra, and C.-C. J. Kuo, “Graph representation for joint channel estimation and symbol detection,” in Proc. IEEE Globecom 2004, Dallas, TX, USA, Dec. 2004
2004
Cited alongside, same era.
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
2004
Cited alongside, same era.
J. M. Winn, Variational Message Passing and its Applications. PhD thesis, Univ. of Cambridge, 2004
2004
Cited alongside, same era.
M. Nissilä and S. Pasupathy, “Reduced-complexity turbo receivers for single and multi-antenna systems via variational inference in factor graphs,” Proc. 2004 IEEE Int. Conf. on Communications (ICC 2004), Paris, France, pp. 2767–2771, June 2004
2004
Cited alongside, same era.
F.-H. Chiu, S.-H. Wu, and C.-C. J. Kuo, “Robust joint channel estimation and symbol detection over MIMO channels using EM algorithm,” Proc. 2005 IEEE Vehicular Technology Conf., vol. 2, pp. 841–845
2005
Cited alongside, same era.
J. Dauwels, A. Eckford, S. Korl, and H.-A. Loeliger, “Expectation maximization as message passing—Part II: from hidden Markov models to independent factor analysis,” in preparation
Cited in the paper.
2005
Later among the works it cites.
H.-A. Loeliger, J. Dauwels, Junli Hu, S. Korl, Li Ping, and F. R. Kschischang, “The factor graph approach to model-based signal processing,” Proceedings of the IEEE, vol. 95, no. 6, pp. 1295–1322, June 2007
2007
Later among the works it cites.
C. Herzet, V. Ramon, and L. Vandendorpe, “A theoretical framework for iterative synchronization based on the sumÐproduct and the expectation-maximization algorithms,” IEEE Trans. Signal Proc., vol. 55, no. 5, pp. 1644–1658, 2007
2007
Later among the works it cites.
A. Zia, J. P. Reilly, and S. Shirani, “Distributed parameter estimation with side information: A factor graph approach,” IEEE Int. Symp. on Information Theory, Nice, France, June 2007, pp. 2556–2560
2007
Later among the works it cites.
J. Dauwels, “On variational message passing on factor graphs,” Proc. 2007 IEEE Int. Symp. on Information Theory, Nice, France, June 24–29, 2007, pp. 2546–2550
2007
Later among the works it cites.
S. Wu, “Factor graph EM algorithm for joint channel tracking and MAP detection of MIMO-OFDMA in fading channels,” 2008 Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing , Las Vegas, NV, USA, pp. 2701–2704, April 2008
2008
Later among the works it cites.
J. Dauwels, S. Korl, and H.-A. Loeliger, “Particle methods as message passing,” Proc. 2006 IEEE Int. Symp. on Information Theory, Seattle, USA, July 9–14, 2006, pp. 2052–2056
2056
Closest in time.