Sciweavers

493 search results - page 8 / 99
» A Multi-relational Decision Tree Learning Algorithm - Implem...
Sort
View
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 7 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
PKDD
2000
Springer
134views Data Mining» more  PKDD 2000»
14 years 11 days ago
Induction of Multivariate Decision Trees by Using Dipolar Criteria
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
Leon Bobrowski, Marek Kretowski
ECML
2007
Springer
14 years 3 months ago
Decision Tree Instability and Active Learning
Decision tree learning algorithms produce accurate models that can be interpreted by domain experts. However, these algorithms are known to be unstable – they can produce drastic...
Kenneth Dwyer, Robert Holte
IJCAI
1993
13 years 10 months ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
ACL
2001
13 years 10 months ago
Automated Subcategorization of Named Entities
There has been much interest in the recent past concerning the possibilities for automated categorization of named entities. The research presented here describes a method for the...
Michael Fleischman