Sciweavers

1594 search results - page 101 / 319
» Fast Prediction on a Tree
Sort
View
ACL
2006
13 years 9 months ago
Trace Prediction and Recovery with Unlexicalized PCFGs and Slash Features
This paper describes a parser which generates parse trees with empty elements in which traces and fillers are co-indexed. The parser is an unlexicalized PCFG parser which is guara...
Helmut Schmid
AAAI
1998
13 years 9 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
BMCBI
2006
143views more  BMCBI 2006»
13 years 8 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
ECAI
2004
Springer
14 years 1 months ago
Explaining the Result of a Decision Tree to the End-User
This paper addresses the problem of the explanation of the result given by a decision tree, when it is used to predict the class of new cases. In order to evaluate this result, the...
Isabelle Alvarez
AUSAI
1998
Springer
14 years 10 days ago
The Problem of Missing Values in Decision Tree Grafting
Decision tree grafting adds nodes to inferred decision trees. Previous research has demonstrated that appropriate grafting techniques can improve predictive accuracy across a wide ...
Geoffrey I. Webb