Sciweavers

495 search results - page 19 / 99
» Transfer Learning in Decision Trees
Sort
View
FLAIRS
2006
13 years 9 months ago
Generalized Entropy for Splitting on Numerical Attributes in Decision Trees
Decision Trees are well known for their training efficiency and their interpretable knowledge representation. They apply a greedy search and a divide-and-conquer approach to learn...
Mingyu Zhong, Michael Georgiopoulos, Georgios C. A...
AAAI
1990
13 years 9 months ago
What Should Be Minimized in a Decision Tree?
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...
Usama M. Fayyad, Keki B. Irani
ESANN
2001
13 years 9 months ago
Transfer functions: hidden possibilities for better neural networks
Abstract. Sigmoidal or radial transfer functions do not guarantee the best generalization nor fast learning of neural networks. Families of parameterized transfer functions provide...
Wlodzislaw Duch, Norbert Jankowski
ECML
2005
Springer
14 years 1 months ago
A Comparison of Approaches for Learning Probability Trees
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice...
ICML
2001
IEEE
14 years 8 months ago
Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers
Accurate, well-calibrated estimates of class membership probabilities are needed in many supervised learning applications, in particular when a cost-sensitive decision must be mad...
Bianca Zadrozny, Charles Elkan