Sciweavers

28 search results - page 2 / 6
» Learning Accurate, Compact, and Interpretable Tree Annotatio...
Sort
View
ACL
2003
13 years 8 months ago
Accurate Unlexicalized Parsing
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
Dan Klein, Christopher D. Manning
AUSAI
1999
Springer
13 years 11 months ago
Generating Rule Sets from Model Trees
Model trees—decision trees with linear models at the leaf nodes—have recently emerged as an accurate method for numeric prediction that produces understandable models. However,...
Geoffrey Holmes, Mark Hall, Eibe Frank
ICDM
2009
IEEE
146views Data Mining» more  ICDM 2009»
14 years 2 months ago
Induction of Mean Output Prediction Trees from Continuous Temporal Meteorological Data
: In this paper, we present a novel method for fast data-driven construction of regression trees from temporal datasets including continuous data streams. The proposed Mean Output ...
Dima Alberg, Mark Last, Roni Neuman, Avi Sharon
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
13 years 11 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
ICML
2008
IEEE
14 years 8 months ago
Detecting statistical interactions with additive groves of trees
Discovering additive structure is an important step towards understanding a complex multi-dimensional function because it allows the function to be expressed as the sum of lower-d...
Daria Sorokina, Rich Caruana, Mirek Riedewald, Dan...