✦ LIBER ✦

Optimal Partition Trees

✍ Scribed by Timothy M. Chan

Book ID: 113044309
Publisher: Springer
Year: 2012
Tongue: English
Weight: 887 KB
Volume: 47
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-012-9410-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal chain partitions of trees

✍ Jayadev Misra; R.Endre Tarjan 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Decision trees with optimal joint partit

Decision trees with optimal joint partitioning

✍ Djamel A. Zighed; Gilbert Ritschard; Walid Erray; Vasile-Marian Scuturici 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 544 KB

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 t

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

Partitioning infinite trees

✍ Peter Horak; Katherine Heinrich 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

On optimal trees

✍ Peter Eades; John Staples 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 571 KB

Optimal partitions

✍ F. K. Hwang 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 450 KB