Sciweavers

116 search results - page 4 / 24
» Evaluation of decision trees: a multi-criteria approach
Sort
View
PAKDD
2007
ACM
140views Data Mining» more  PAKDD 2007»
16 years 24 days ago
A Hybrid Multi-group Privacy-Preserving Approach for Building Decision Trees
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
Zhouxuan Teng, Wenliang Du
201
Voted
ECML
2007
Springer
15 years 10 months ago
Seeing the Forest Through the Trees: Learning a Comprehensible Model from an Ensemble
Abstract. Ensemble methods are popular learning methods that usually increase the predictive accuracy of a classifier though at the cost of interpretability and insight in the deci...
Anneleen Van Assche, Hendrik Blockeel
ICML
2004
IEEE
16 years 7 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
AAAI
2006
15 years 8 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
ICAISC
2004
Springer
16 years 2 days ago
An Evolutionary Algorithm for Oblique Decision Tree Induction
In the paper, a new evolutionary approach to induction of oblique decision trees is described. In each non-terminal node, the specialized evolutionary algorithm is applied to searc...
Marek Kretowski