Hinton GE, Osindero S, Teh YW. (2006). A fast learning algorithm for deep belief nets. Neural computation. 18 [PubMed]

See more from authors: Hinton GE · Osindero S · Teh YW

References and models cited by this paper

Belongie S, Malik J, Puzicha J. (2002). Shape matching and object recognition using shape contexts IEEE Trans PAMI. 24

Decoste D, Schoelkopf B. (2002). Training invariant support vector machines Mach Learn. 46

Freund Y. (1995). Boosting a weak learning algorithm by majority Information And Computation. 12

Hinton G, Carreira-perpinan M. (2005). On contrastive divergence learning. Proceedings of the Society for Artificial Intelligence and Statistics.

Hinton G, Teh Y, Welling M, Osindero S. (2003). Energy-based models for sparse overcomplete representations Journal Of Machine Learning Res [special Issue]. 4

Hinton G, Welling M, Osindero S. (2003). Learning sparse topographic representations with products of Student-t distributions Advances in neural information processing systems 12. 15

Hinton GE. (2002). Training products of experts by minimizing contrastive divergence. Neural computation. 14 [PubMed]

Hinton GE, Dayan P, Frey BJ, Neal RM. (1995). The "wake-sleep" algorithm for unsupervised neural networks. Science (New York, N.Y.). 268 [PubMed]

Hinton GE, Mayraz G. (2001). Recognizing hand-written digits using hierarchical products of experts IEEE Transactions On Pattern Analysis And Machine Intelligence. 24

Hinton GE, Neal RM. (1998). A new view of the EM algorithm that justifies incremental, sparse and other variants Learning in graphical models.

Hinton GE, Teh Y. (2001). Rate-coded restricted Boltzmann machines for face recognition Advances in neural information processing systems. 13

Hinton GE, Welling M, Rosen-zvi M. (2005). Exponential family harmoniums with an application to information retrieval Advances in neural information processing systems. 17

Lecun Y, Bottou L, Haffner P. (1998). Gradient-based learning applied to document recognition Proc IEEE. 86

Lee TS, Mumford D. (2003). Hierarchical Bayesian inference in the visual cortex. Journal of the Optical Society of America. A, Optics, image science, and vision. 20 [PubMed]

Marks TK, Movellan JR. (2001). Diffusion networks, product of experts, and factor analysis Proc. Int. Conf. on Independent Component Analysis.

Neal R. (1992). Connectionist learning of belief networks Art Intell. 56

Ning F et al. (2005). Toward automatic phenotyping of developing embryos from videos. IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. 14 [PubMed]

Roth S, Black MJ. (2005). Fields of experts: A framework for learning image priors IEEE Conf. on Computer Vision and Pattern Recognition.

Sanger TD. (1989). Optimal unsupervised learning in a single-layer linear feedforward neural networks Neural Networks. 2

Simard PY, Steinkraus D, Platt J. (2003). Best practice for convolutional neural networks applied to visual document analysis International Conference on Document Analysis and Recogntion (ICDAR).

Stuetzle W, Friedman J. (1981). Projection pursuit regression J Am Stat Assoc. 76

References and models that cite this paper

Eguchi A, Neymotin SA, Stringer SM. (2014). Color opponent receptive fields self-organize in a biophysical model of visual cortex via spike-timing dependent plasticity Frontiers in neural circuits. 8 [PubMed]

Murray JF, Kreutz-Delgado K. (2007). Visual recognition and inference using dynamic overcomplete sparse learning. Neural computation. 19 [PubMed]

Raudies F, Zilli EA, Hasselmo ME. (2014). Deep belief networks learn context dependent behavior. PloS one. 9 [PubMed]

Sussillo D, Abbott LF. (2009). Generating coherent patterns of activity from chaotic neural networks. Neuron. 63 [PubMed]

Whittington JCR, Bogacz R. (2017). An Approximation of the Error Backpropagation Algorithm in a Predictive Coding Network with Local Hebbian Synaptic Plasticity. Neural computation. 29 [PubMed]

This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.