7 search results - page 1 / 2 » Decision Tree Induction: How Effective is the Greedy Heurist... |
KDD
1995
ACM
13 years 9 months ago
1995
ACM
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
IJCAI
2003
13 years 7 months ago
2003
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...
SAC
2009
ACM
14 years 13 days ago
2009
ACM
Decision trees are widely disseminated as an effective solution for classification tasks. Decision tree induction algorithms have some limitations though, due to the typical strat...
PVLDB
2010
13 years 4 months ago
2010
Data ambiguity is inherent in applications such as data integration, location-based services, and sensor monitoring. In many situations, it is possible to “clean”, or remove, ...
ICCBR
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. This paper proposes a fuzzy-rough method of maintaining CaseBased Reasoning (CBR) systems. The methodology is mainly based on the idea that a large case library can be tr...