1622 search results - page 74 / 325 » Learning a Hidden Matching |
142
click to vote
ISCI
2008
15 years 2 months ago
2008
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 ...
143
click to vote
JMLR
2010
14 years 10 months ago
2010
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...
114
click to vote
ISCAS
2005
IEEE
15 years 8 months ago
2005
IEEE
— 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 ...
133
click to vote
IJCAI
1997
15 years 4 months ago
1997
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
114
click to vote
NIPS
1997
15 years 4 months ago
1997
Singular value decomposition (SVD) can be viewed as a method for unsupervised training of a network that associates two classes of events reciprocally by linear connections throug...