Sciweavers

493 search results - page 15 / 99
» A Multi-relational Decision Tree Learning Algorithm - Implem...
Sort
View
ICML
1996
IEEE
14 years 28 days ago
Second Tier for Decision Trees
A learner's performance does not rely only on the representation language and on the algorithm inducing a hypothesis in this language. Also the way the induced hypothesis is ...
Miroslav Kubat
ICML
1990
IEEE
14 years 25 days ago
An Incremental Method for Finding Multivariate Splits for Decision Trees
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
Paul E. Utgoff, Carla E. Brodley
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
14 years 19 days ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes
NLP
2000
14 years 10 days ago
Learning Rules for Large-Vocabulary Word Sense Disambiguation: A Comparison of Various Classifiers
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
Georgios Paliouras, Vangelis Karkaletsis, Ion Andr...
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
13 years 10 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens