1107 search results - page 14 / 222 » Multi-instance tree learning |
114
click to vote
TSD
2000
Springer
15 years 4 months ago
2000
Springer
The aim of this paper is to describe and evaluate a system that automates a part of the transition from analytical to tectogrammatical tree structures within the Prague Dependency...
129
click to vote
JMLR
2010
14 years 11 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...
ECML
2007
Springer
15 years 7 months ago
2007
Springer
Decision tree learning algorithms produce accurate models that can be interpreted by domain experts. However, these algorithms are known to be unstable – they can produce drastic...
104
click to vote
IJAR
2010
14 years 10 months ago
2010
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
118
click to vote
ECML
2006
Springer
15 years 5 months ago
2006
Springer
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...