Sciweavers

352 search results - page 17 / 71
» A Fast Decision Tree Learning Algorithm
Sort
View
89
Voted
CONCUR
2006
Springer
15 years 26 days ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
107
Voted
EMNLP
2006
15 years 8 days ago
Learning Information Status of Discourse Entities
In this paper we address the issue of automatically assigning information status to discourse entities. Using an annotated corpus of conversational English and exploiting morpho-s...
Malvina Nissim
JAIR
2011
134views more  JAIR 2011»
14 years 5 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
ICML
2004
IEEE
15 years 11 months ago
Sequential skewing: an improved skewing algorithm
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
Soumya Ray, David Page
105
Voted
SAC
2006
ACM
15 years 4 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach