121 search results - page 4 / 25 » Algorithms for optimal dyadic decision trees |
PAKDD
2001
ACM
14 years 11 days ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed. In non-terminal nodes of a mixed decision tree different types of tests can be placed, ranging ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...