1283 search results - page 32 / 257 » Learning Voting Trees |
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...
ACL
2009
13 years 5 months ago
2009
Tree substitution grammars (TSGs) offer many advantages over context-free grammars (CFGs), but are hard to learn. Past approaches have resorted to heuristics. In this paper, we le...
JMLR
2010
13 years 2 months ago
2010
For many supervised learning tasks it may be infeasible (or very expensive) to obtain objective and reliable labels. Instead, we can collect subjective (possibly noisy) labels fro...
NAACL
2007
13 years 9 months ago
2007
We present a revision learning model for improving the accuracy of a dependency parser. The revision stage corrects the output of the base parser by means of revision rules learne...
ALT
2009
Springer
14 years 4 months ago
2009
Springer
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...