Independent factor analysis

Neural Computation

Volumn 11, Issue 4, 1999, Pages 803-851

  Attias, H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER SIMULATION; FACTORIAL ANALYSIS; LEARNING; NORMAL DISTRIBUTION; PROBABILITY; STATISTICAL MODEL;

ALGORITHMS; COMPUTER SIMULATION; FACTOR ANALYSIS, STATISTICAL; LEARNING; LIKELIHOOD FUNCTIONS; MODELS, STATISTICAL; NORMAL DISTRIBUTION; PROBABILITY;

EID: 0033561886     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976699300016458     Document Type: Article

References (43)

1. Amari, S., Cichocki, A., & Yang, H. H. (1996). A new learning algorithm for blind signal separation. In D. S. Touretzky, M. C. Mozer, & M. E. Hasselmo (Eds.), Advances in neural information processing systems, 8 (pp. 757-763). Cambridge, MA: MIT Press.
2. Attias, H., & Schreiner, C. E. (1998). Blind source separation and deconvolution: The dynamic component analysis algorithm. Neural Computation 10, 1373-1424.
3. Bell, A. J., & Sejnowski, T. J. (1995). An information-maximization approach to blind separation and blind deconvolution. Neural Computation, 7, 1129-1159.
4. Belouchrani, A., & Cardoso, J.-F. (1994). Maximum likelihood source separation for discrete sources. In Proc. EUSIPCO, 768-771.
5. Bishop, C. M., Svensén, M., & Williams, C. K. I. (1998). GTM: The generative topographic mapping. Neural Computation, 10, 215-234.
6. Cardoso, J.-F. (1997). Infomax and maximum likelihood for source separation. IEEE Signal Processing Letters, 4, 112-114.
7. Cardoso, J.-F., & Laheld, B. H. (1996). Equivariant adaptive source separation. IEEE Transactions on Signal Processing, 44, 3017-3030.
8. Comon, P., Jutten, C., & Hérault, J. (1991). Blind separation of sources, Part II: Problem statement. Signal Processing, 24, 11-20.
9. Comon, P. (1994). Independent component analysis: a new concept? Signal Processing, 36, 287-314.
10. Cover, T.M., & Thomas, J. A. (1991). Elements of information theory. New York: Wiley.
11. Dayan, P., Hinton, G., Neal, R., & Zemel, R. (1995). The Helmholtz machine. Neural Computation, 7, 889-904.
12. Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm (with discussion). Journal of the Royal Statistical Society B, 39, 1-38.
13. Everitt, B. S. (1984). An introduction to latent variable models. London: Chapman & Hall.
14. Friedman, J. H., & Stuetzle, W. (1981). Projection pursuit regression. Journal of the American Statistical Association, 76, 817-823.
15. Ghahramani, Z. (1995). Factorial learning and the EM algorithm. In G. Tesauro, D. S. Touretzky, & J. Alspector (Eds.), Advances in neural information processing systems, 7 (pp. 617-624). San Mateo, CA: Morgan Kaufmann.
16. Ghahramani, Z., & Jordan, M. I. (1997). Factorial hidden Markov models. Machine Learning, 29, 245-273.
17. Hastie, T. J., & Tibshirani, R. J. (1990). Generalized additive models. London: Chapman & Hall.
18. Hinton, G. E., Dayan, P., Frey, B. J., & Neal, R. M. (1995). The "wake-sleep" algorithm for unsupervised neural networks. Science, 268, 1158-1161.
19. Hinton, G. E., Williams, C. K. I., & Revow, M. D. (1992). Adaptive elastic models for hand-printed character recognition. In J. E. Moody, S. J. Hanson, & P. P. Lippmann (Eds.), Advances in neural information processing systems, 4 (pp. 512-519). San Mateo, CA: Morgan Kaufmann.
20. Hinton, G. E., & Zemel, R. S. (1994). Autoencoders, minimum description length, and Helmholtz free energy. In J. D. Cowan, G. Tesauro, & J. Alspector (Eds.), Advances in neural information processing systems, 6 (pp. 3-10). San Mateo, CA: Morgan Kaufmann.
21. Huber, P. J. (1985). Projection pursuit. Annals of Statistics, 13, 435-475.
22. Hyvärinen, A., & Oja, E. (1997). A fast fixed-point algorithm for independent component analysis. Neural Computation, 9, 1483-1492.
23. Jordan, M. I., & Jacobs, R. A. (1994). Hierarchical mixtures of experts and the EM algorithm. Neural Computation, 6, 181-214.
24. Jutten, C., and Hérault, J. (1991). Blind separation of sources, part I: An adaptive algorithm based on neuromimetic architecture. Signal Processing, 24, 1-10.
25. Lee, T.-W., Bell, A. J., & Lambert, R. (1997). Blind separation of delayed and convolved sources. In M. C. Mozer, M. I. Jordan, & T. Petsche (Eds.), Advances in neural information processing systems, 9 (pp. 758-764). Cambridge, MA: MIT Press.
26. Lewicki, M. S., & Sejnowski, T. J. (1998). Learning nonlinear overcomplete representations for efficient coding. In M. Kearns, M. Jordan, & S. Solla (Eds.), Advances in neural information processing systems, 10 (pp. 556-562). Cambridge, MA: MIT Press.
27. Lewicki, M. S., & Olshausen, B. A. (1998). Inferring sparse, overcomplete image codes using an efficient coding framework. In M. Kearns, M. Jordan, & S. Solla (Eds.), Advances in neural information processing systems, 10 (pp. 815-821). Cambridge, MA: MIT Press.
28. MacKay, D. J. C. (1992). Bayesian interpolation. Neural Computation, 4, 415-447.
29. MacKay, D. J. C. (1996). Maximum likelihood and covariant algorithms for independent component analysis (Tech. Rep.) Cambridge: Cavendish Laboratory, Cambridge University.
30. Moulines, E., Cardoso, J.-P., & Gassiat, E. (1997). Maximum likelihood for blind separation and deconvolution of noisy signals using mixture models. In Proceedings of IEEE Conference on Acoustics, Speech, and Signal Processing 1997 (Vol. 5, pp. 3617-3620). New York: IEEE.
31. Neal, R. M., and Hinton, G. E. (1998). A view of the EM algorithm that justifies incremental, sparse, and other variants. In M. I. Jordan (Ed.), Learning in graphical models, pp. 355-368. Norwell, MA: Kluwer Academic Press.
32. Olshausen, B. A. (1996). Learning linear, sparse, factorial codes. (Tech. Rep. AI Memo 1580, CBCL 138). Cambridge, MA: Artificial Intelligence Lab, MIT.
33. Olshausen, B. A., & Field, D. J. (1996). Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature, 381 607-609.
34. Olshausen, B. A., & Field, D. J. (1997). Sparse coding with an overcomplete basis set: A strategy employed by V1? Vision Research, 37, 3311-3325.
35. Pearlmutter, B. A., & Parra, L. C. (1997). Maximum likelihood blind source separation: A context-sensitive generalization of ICA. In M. C. Mozer, M. I. Jordan, & T. Petsche (Eds.), Advances in neural information processing systems, 9 (pp. 613-619). Cambridge, MA: MIT Press.
36. Pham, D. T. (1996). Blind separation of instantaneous mixture of sources via an independent component analysis. IEEE Transactions on Signal Processing, 44, 2768-2779.
37. Roweis, S. (1998). EM algorithms for PCA and SPCA. In M. Kearns, M. Jordan, & S. Solla (Eds.), Advances in neural information processing systems, 10 (pp. 626-632). Cambridge, MA: MIT Press.
38. Roweis, S., & Ghahramani, Z. (1997). A unifying review of linear gaussian models. Neural Computation 11, 297-337.
39. Rubin, D., & Thayer, D. (1982). EM algorithms for ML factor analysis. Psychometrika, 47, 69-76.
40. Saul, L., & Jordan, M. I. (1995). Exploiting tractable structures in intractable networks. In D. S. Touretzky, M. C. Mozer, & M. E. Hasselmo (Eds.), Advances in neural information processing systems, 8 (pp. 486-492). Cambridge, MA: MIT Press.
41. Saul, L. K., Jaakkola, T., & Jordan, M. I. (1996). Mean field theory of sigmoid belief networks. Journal of Artificial Intelligence Research, 4, 61-76.
42. Tipping, M. E., and Bishop, C. M. (1997). Probabilistic principal component analysis (Tech. Report NCRG/97/010). Aston University, U.K.
43. Torkkola, K. (1996). Blind separation of convolved sources based on information maximization. In Neural Networks for Signal Processing VI. New York: IEEE.