7259 search results - page 77 / 1452 » From Fields to Trees |
174
click to vote
JMLR
2010
15 years 3 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In this article we present a refined summation theory based on Karr's difference field approach. The resulting algorithms find sum representations with optimal nested depth. ...
136
click to vote
SIGPLAN
2002
15 years 5 months ago
2002
Field accessor methods have become a ubiquitous feature of object-oriented programming. The definition and use of such methods promote code bloat and an unnatural expression style...
157
click to vote
ICML
2003
IEEE
16 years 6 months ago
2003
IEEE
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
151
click to vote
ICCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...