4095 search results - page 150 / 819 » How to test a tree |
102
Voted
COLING
1992
15 years 1 months ago
1992
This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yi...
69
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present two important variations on a recently successful bloat control technique, Dynamic Maximum Tree Depth, intended at further improving the results and extending ...
120
Voted
ISMB
1993
15 years 1 months ago
1993
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...
92
Voted
JAIR
2008
15 years 13 days ago
2008
Machine learning techniques are gaining prevalence in the production of a wide range of classifiers for complex real-world applications with nonuniform testing and misclassificati...
107
click to vote
PKDD
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...