2615 search results - page 225 / 523 » Predictive Hebbian Learning |
155
click to vote
ICGI
2000
Springer
15 years 7 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
162
click to vote
MCS
2000
Springer
15 years 7 months ago
2000
Springer
Ensemble methods are learning algorithms that construct a set of classi ers and then classify new data points by taking a (weighted) vote of their predictions. The original ensembl...
138
click to vote
NIPS
2008
15 years 5 months ago
2008
Extensive labeled data for image annotation systems, which learn to assign class labels to image regions, is difficult to obtain. We explore a hybrid model framework for utilizing...
121
click to vote
AIPS
2006
15 years 5 months ago
2006
We view dynamic scheduling as a sequential decision problem. Firstly, we introduce a generalized planning operator, the stochastic task model (STM), which predicts the effects of ...
124
click to vote
FLAIRS
2006
15 years 5 months ago
2006
We introduce a novel learning algorithm for noise elimination. Our algorithm is based on the re-measurement idea for the correction of erroneous observations and is able to discri...