3718 search results - page 304 / 744 » On learning with dissimilarity functions |
170
click to vote
LREC
2008
15 years 8 months ago
2008
We report about a project which brings together Natural Language Processing and eLearning. One of the functionalities developed within this project is the possibility to annotate ...
209
click to vote
NIPS
2007
15 years 8 months ago
2007
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...
191
click to vote
ACL
2006
15 years 8 months ago
2006
Shortage of manually labeled data is an obstacle to supervised relation extraction methods. In this paper we investigate a graph based semi-supervised learning algorithm, a label ...
153
click to vote
ESANN
2006
15 years 8 months ago
2006
Abstract. We present experimental results about learning function values (i.e. Bellman values) in stochastic dynamic programming (SDP). All results come from openDP (opendp.sourcef...
165
click to vote
AAAI
1997
15 years 8 months ago
1997
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...