Search
Now showing items 1-3 of 3
Fast Learning by Bounding Likelihoods in Sigmoid Type Belief Networks
(1996-02-09)
Sigmoid type belief networks, a class of probabilistic neural networks, provide a natural framework for compactly representing probabilistic information in a variety of unsupervised and supervised learning problems. ...
Neural Networks
(1996-03-13)
We present an overview of current research on artificial neural networks, emphasizing a statistical perspective. We view neural networks as parameterized graphs that make probabilistic assumptions about data, and view ...
Factorial Hidden Markov Models
(1996-02-09)
We present a framework for learning in hidden Markov models with distributed state representations. Within this framework, we derive a learning algorithm based on the Expectation--Maximization (EM) procedure for maximum ...