342 search results - page 8 / 69 » Using Decision Trees to Construct a Practical Parser |
PAKDD
2004
ACM
14 years 25 days ago
2004
ACM
We introduce a numerical measure on sets of partitions of finite sets that is linked to the Goodman-Kruskal association index commonly used in statistics. This measure allows us t...
IDA
2000
Springer
13 years 7 months ago
2000
Springer
Conventional algorithms for decision tree induction use an attribute-value representation scheme for instances. This paper explores the empirical consequences of using set-valued ...
EMNLP
2007
13 years 9 months ago
2007
This paper compares a deep and a shallow processing approach to the problem of classifying a sentence as grammatically wellformed or ill-formed. The deep processing approach uses ...
ML
2010
ACM
13 years 5 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
ICANNGA
2007
Springer
13 years 11 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...