Sciweavers

254 search results - page 11 / 51
» Multi-interval Discretization Methods for Decision Tree Lear...
Sort
View
SAC
2006
ACM
14 years 1 months ago
Induction of compact decision trees for personalized recommendation
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...
Daniel Nikovski, Veselin Kulev
ROCAI
2004
Springer
14 years 29 days ago
An Empirical Evaluation of Supervised Learning for ROC Area
We present an empirical comparison of the AUC performance of seven supervised learning methods: SVMs, neural nets, decision trees, k-nearest neighbor, bagged trees, boosted trees,...
Rich Caruana, Alexandru Niculescu-Mizil
IFIP12
2008
13 years 9 months ago
A Study with Class Imbalance and Random Sampling for a Decision Tree Learning System
Sampling methods are a direct approach to tackle the problem of class imbalance. These methods sample a data set in order to alter the class distributions. Usually these methods ar...
Ronaldo C. Prati, Gustavo E. A. P. A. Batista, Mar...
IJPRAI
2002
93views more  IJPRAI 2002»
13 years 7 months ago
Improving Stability of Decision Trees
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
Mark Last, Oded Maimon, Einat Minkov
ICML
2006
IEEE
14 years 8 months ago
An empirical comparison of supervised learning algorithms
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...
Rich Caruana, Alexandru Niculescu-Mizil