✦ LIBER ✦

Polynomials for classification trees and applications

✍ Scribed by Ian H. Dinwoodie

Publisher: Springer
Year: 2009
Tongue: English
Weight: 248 KB
Volume: 19
Category: Article
ISSN: 1613-981X
DOI: 10.1007/s10260-009-0123-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tutte polynomials for trees

✍ Sharad Chaudhary; Gary Gordon 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 682 KB

## Abstract We define two two‐variable polynomials for rooted trees and one two‐variable polynomial for unrooted trees, all of which are based on the coranknullity formulation of the Tutte polynomial of a graph or matroid. For the rooted polynomials, we show that the polynomial completely determine

Applications of recurrence relations for

Applications of recurrence relations for the characteristic polynomials of Bethe trees

✍ María Robbiano; Vilmar Trevisan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Calibration and refinement for classific

Calibration and refinement for classification trees

✍ Stephen E. Fienberg; Sung-Ho Kim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 115 KB

On Classification and Regression Trees f

On Classification and Regression Trees for Multiple Responses and Its Application

✍ Seong Keon Lee 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 198 KB

Classification trees for ordinal variabl

Classification trees for ordinal variables

✍ Raffaella Piccarreta 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 414 KB

Classification and regression trees

✍ N. Speybroeck 📂 Article 📅 2011 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 248 KB