𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decision trees with optimal joint partitioning

✍ Scribed by Djamel A. Zighed; Gilbert Ritschard; Walid Erray; Vasile-Marian Scuturici

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
544 KB
Volume
20
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

✦ Synopsis

Decision tree methods generally suppose that the number of categories of the attribute to be predicted is fixed. Breiman et al., with their Twoing criterion in CART, considered gathering the categories of the predicted attribute into two supermodalities. In this article, we propose an extension of this method. We try to merge the categories in an optimal unspecified number of supermodalities. Our method, called ArbogodaΓ―, allows during tree growing for grouping categories of the target variable as well as categories of the predictive attributes. It handles both categorical and quantitative attributes. At the end, the user can choose to generate either a set of single rules or a set of multiconclusion rules that provide interval-like predictions.

πŸ“œ SIMILAR VOLUMES

Optimality of consecutive and nested tre
Optimality of consecutive and nested tree partitions
✍ Chang, G. J.; Hwang, F. K. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 84 KB

We consider the problem of partitioning the vertex-set of a tree to p parts to minimize a cost function. Since the number of partitions is exponential in the number of vertices, it is helpful to identify small classes of partitions which also contain optimal partitions. Two such classes, called cons

H. Almuallim, An efficient algorithm for
H. Almuallim, An efficient algorithm for optimal of decision trees
πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 69 KB

Situations in which them is competition among possible contractor agents or possible manager agents are also considered. In all situations we assume that the contractor can choose a level of effort when carrying out the task and we would like the contractor to carry out the task efficiently without

Monochromatic Trees with Respect to Edge
Monochromatic Trees with Respect to Edge Partitions
✍ V. Rodl; B. Voigt πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 270 KB

It is shown. that for every infinite cardinal \(\kappa\) there exists a graph \(F\) on \(\kappa\) vertices satisfying \(F \rightarrow(T)_{i}^{\text {edgen }}\) for every tree \(T\) on \(\kappa\) vertices and all \(i\) satisfying cf \(\kappa \rightarrow((1))_{j}^{3}\). ' 1993 Acadenic Press, Inc.

Optimal natural regeneration of Scots pi
Optimal natural regeneration of Scots pine with seed trees
✍ W. Zhou πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 354 KB

In this study a model for the economic optimization of natural regeneration with seed trees is presented. The objective is maximization of the present value of profits. The model is used, given an initial stand, to determine the optimal harvesting time of the initial stand, the number of seed trees,