Sciweavers

495 search results - page 20 / 99
» Transfer Learning in Decision Trees
Sort
View
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 6 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
ICML
2000
IEEE
14 years 8 months ago
Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria
This paper investigates how the splitting criteria and pruning methods of decision tree learning algorithms are influenced by misclassification costs or changes to the class distr...
Chris Drummond, Robert C. Holte
SIGKDD
2000
231views more  SIGKDD 2000»
13 years 7 months ago
KDD-99 Classifier Learning Contest: LLSoft's Results Overview
Kernel Miner is a new data-mining tool based on building the optimal decision forest. The tool won second place in the KDD'99 Classifier Learning Contest, August 1999. We des...
Itzhak Levin
ECML
2007
Springer
13 years 11 months ago
Ensembles of Multi-Objective Decision Trees
Abstract. Ensemble methods are able to improve the predictive performance of many base classifiers. Up till now, they have been applied to classifiers that predict a single target ...
Dragi Kocev, Celine Vens, Jan Struyf, Saso Dzerosk...
ILP
2005
Springer
14 years 1 months ago
Predicate Selection for Structural Decision Trees
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...
Kee Siong Ng, John W. Lloyd