Sciweavers

2916 search results - page 90 / 584
» Generating Rule Sets from Model Trees
Sort
View
133
Voted
AAAI
2007
15 years 6 months ago
Recognizing Textual Entailment Using a Subsequence Kernel Method
We present a novel approach to recognizing Textual nt. Structural features are constructed from abstract tree descriptions, which are automatically extracted from syntactic depend...
Rui Wang 0005, Günter Neumann
125
Voted
ACTA
2008
88views more  ACTA 2008»
15 years 2 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
117
Voted
AI
2011
Springer
14 years 10 months ago
Relational preference rules for control
Much like relational probabilistic models, the need for relational preference models arises naturally in real-world applications where the set of object classes is fixed, but obj...
Ronen I. Brafman
154
Voted
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 4 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
108
Voted
NAACL
2007
15 years 5 months ago
Tree Revision Learning for Dependency Parsing
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...
Giuseppe Attardi, Massimiliano Ciaramita