Sciweavers

697 search results - page 53 / 140
» Learning a Hidden Hypergraph
Sort
View
NN
1997
Springer
174views Neural Networks» more  NN 1997»
15 years 1 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
ISCI
2008
95views more  ISCI 2008»
14 years 9 months ago
Modified constrained learning algorithms incorporating additional functional constraints into neural networks
In this paper, two modified constrained learning algorithms are proposed to obtain better generalization performance and faster convergence rate. The additional cost terms of the ...
Fei Han, Qing-Hua Ling, De-Shuang Huang
JMLR
2010
202views more  JMLR 2010»
14 years 4 months ago
Learning the Structure of Deep Sparse Graphical Models
Deep belief networks are a powerful way to model complex probability distributions. However, it is difficult to learn the structure of a belief network, particularly one with hidd...
Ryan Prescott Adams, Hanna M. Wallach, Zoubin Ghah...
ISCAS
2005
IEEE
154views Hardware» more  ISCAS 2005»
15 years 3 months ago
Back propagation learning of neural networks with chaotically-selected affordable neurons
— Cell assembly is one of explanations of information processing in the brain, in which an information is represented by a firing space pattern of a group of plural neurons. On ...
Yoko Uwate, Yoshifumi Nishio
IJCAI
1997
14 years 11 months ago
Learning Topological Maps with Weak Local Odometric Information
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
Hagit Shatkay, Leslie Pack Kaelbling