Sciweavers

1661 search results - page 11 / 333
» Decision Tree Fields
Sort
View
DAWAK
2006
Springer
15 years 1 months ago
Mixed Decision Trees: An Evolutionary Approach
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed. In non-terminal nodes of a mixed decision tree different types of tests can be placed, ranging ...
Marek Kretowski, Marek Grzes
FLAIRS
2007
14 years 11 months ago
Naive Bayes and Decision Trees for Function Tagging
This paper describes the use of two machine learning techniques, naive Bayes and decision trees, to address the task of assigning function tags to nodes in a syntactic parse tree....
Mihai C. Lintean, Vasile Rus
ICML
2004
IEEE
15 years 10 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
AAAI
2006
14 years 11 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
ICML
2004
IEEE
15 years 10 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...