272 search results - page 3 / 55 » Lazy tree splitting |
ICML
2000
IEEE
14 years 7 months ago
2000
IEEE
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...
FLAIRS
2006
13 years 7 months ago
2006
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...
AUSAI
2006
Springer
13 years 10 months ago
2006
Springer
Decision tree-based probability estimation has received great attention because accurate probability estimation can possibly improve classification accuracy and probability-based r...
ML
2000
ACM
13 years 6 months ago
2000
ACM
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
ICTAI
2006
IEEE
14 years 8 days ago
2006
IEEE
Existing work shows that classic decision trees have inherent deficiencies in obtaining a good probability-based ranking (e.g. AUC). This paper aims to improve the ranking perfor...