45 search results - page 1 / 9 » Decision Trees Using the Minimum Entropy-of-Error Principle |
121
click to vote
CAIP
2009
Springer
15 years 5 months ago
2009
Springer
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
116
click to vote
IPMU
2010
Springer
15 years 5 days ago
2010
Springer
Abstract. In this paper we introduce a new approach to automatic attribute and granularity selection for building optimum regression trees. The method is based on the minimum descr...
113
click to vote
AUSAI
2004
Springer
15 years 7 months ago
2004
Springer
We propose a multivariate decision tree inference scheme by using the minimum message length (MML) principle (Wallace and Boulton, 1968; Wallace and Dowe, 1999). The scheme uses MM...
120
click to vote
JCB
2002
15 years 1 months ago
2002
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
107
Voted
FCS
2006
15 years 3 months ago
2006
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...