564 search results - page 50 / 113 » Training Tree Transducers |
108
Voted
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
106
click to vote
NIPS
2008
15 years 3 months ago
2008
Neural probabilistic language models (NPLMs) have been shown to be competitive with and occasionally superior to the widely-used n-gram language models. The main drawback of NPLMs...
107
click to vote
ECML
2006
Springer
15 years 5 months ago
2006
Springer
Automatically acquiring control-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training examples. In the case of planning, examp...
109
Voted
EMNLP
2007
15 years 3 months ago
2007
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser act...
136
click to vote
PAA
2002
15 years 1 months ago
2002
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...