Sciweavers

723 search results - page 51 / 145
» Learning a Hidden Subgraph
Sort
View
CVPR
2007
IEEE
14 years 10 months ago
Discriminative Learning of Dynamical Systems for Motion Tracking
We introduce novel discriminative learning algorithms for dynamical systems. Models such as Conditional Random Fields or Maximum Entropy Markov Models outperform the generative Hi...
Minyoung Kim, Vladimir Pavlovic
IJCAI
1993
13 years 10 months ago
Learning Finite Automata Using Local Distinguishing Experiments
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Wei-Mein Shen
JMLR
2010
192views more  JMLR 2010»
13 years 3 months ago
Efficient Learning of Deep Boltzmann Machines
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...
Ruslan Salakhutdinov, Hugo Larochelle
NN
1997
Springer
174views Neural Networks» more  NN 1997»
14 years 27 days 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»
13 years 8 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