Learning causally linked Markov Random Fields

AISTATS 2005 - Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics

Volumn , Issue , 2005, Pages 128-135

  Hinton, G E ^a   Osindero, S ^a   Bao, K ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHAIN GRAPH; CONTRASTIVE DIVERGENCE; GENERATIVE MODEL; HIDDEN MARKOV RANDOM FIELDS; HIDDEN VARIABLE; HYBRID MODEL; INTENSITY IMAGES; INTER-RELATIONSHIPS; LEARNING PROCEDURES; LOWER BOUNDS; MARKOV RANDOM FIELDS; MEAN-FIELD VERSIONS; OBSERVABLE VARIABLES; OBSERVED DATA; PARTITION FUNCTIONS; POSTERIOR DISTRIBUTIONS; VARIATIONAL APPROXIMATION;

ARTIFICIAL INTELLIGENCE; IMAGE SEGMENTATION;

DIRECTED GRAPHS;

EID: 84862625369     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. M. Welling and G. E. Hinton. A new learning algorithm for mean field boltzmann machines. In Proc. International Conference on Artificial Neural Networks, pages 351-357. 2002.
2. R. M. Neal and G. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants. In M. I. Jordan, editor, Learning in Graphical Models, pages 355-368. Kluwer Academic Publishers, 1998.
3. G. E. Hinton. Training products of experts by minimizing contrastive divergence. Neural Computation, 14:1771-1800, 2002.
4. S. Lauritzen and N Wermuth. Graphical models for associations between variables, some of which are qualitative and some quantitative. Annals of Statistics, 17:31-57, 1989.
5. W. L. Buntine. Chain graphs for learning. In Uncertainty in Artificial Intelligence, pages 46-54, 1995.
6. S. L. Lauritzen and T. S. Richardson. Chain graphs and their causal interpretations. Journal of the Royal Statistical Society. Series B. Statistical Methodology, 64(3):321-361, 2002.
7. Y. W. Teh and G. E. Hinton. Rate-coded restricted boltzmann machines for face recognition. In Advances in Neural Information Processing Systems 13. 2001.
8. M. Weber, M. Welling, and P. Perona. Unsupervised learning of models for recognition. In Proc. 6th European Conference on Computer Vision, 2000.
9. D.D. Lee and H. S. Seung. Algorithms for nonnegative matrix factorization. In Advances in Neural Information Processing Systems 13. 2001.
10. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc., 1988.
11. A. J. Bell and T. J. Sejnowski. An information maximisation approach to blind separation and blind devonvolution. Neural Cmputation, 7:1129-1159, 1995.
12. J.F. Cardoso. Infomax and maximum likelihood for blind source separation. IEEE Signal Processing Letters, 4:112-114, 1997.
13. G.E. Hinton, P. Dayan, B.J. Frey, and R.M. Neal. The "wake- sleep" algorithm for unsupervised neural networks. Science, 268:1158-1160, 1995.