✦ LIBER ✦

On decision trees for orthants

✍ Scribed by V.A. Vassiliev

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 332 KB
Volume: 62
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00073-2

No coin nor oath required. For personal study only.

✦ Synopsis

M. Rabin's principle asserts that the depth of any algebraic decision tree, recognizing a closed orthant in JR", is no less than n. Using the techniques of Newton polyhedra, we give the shortest possible proof of this fact, extending it to arbitrary collections of open or closed orthants, and apply it to trees distinguishing real polynomials having at least 1 real roots. @ 1997 Elsevier Science B.V.

📜 SIMILAR VOLUMES

Decision trees for forecasting

✍ Jacob W. Ulvila 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 511 KB

Recent years have seen an increasing cross-fertilization between the fields of decision analysis and forecasting. Decision-analytic models often require forecasts as inputs, and aspects of the Bayesian decision-theoretic framework underlying decision analysis have proved useful to forecasting, parti

Computational Methods for Probabilistic

Computational Methods for Probabilistic Decision Trees

✍ David E. Clark 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 222 KB

Lower bounds for algebraic decision tree

Lower bounds for algebraic decision trees

✍ J Michael Steele; Andrew C Yao 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Decision trees for monotone price models

✍ Marina Velikova; Hennie Daniels 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 120 KB

Algorithms for optimal dyadic decision t

Algorithms for optimal dyadic decision trees

✍ Don Hush; Reid Porter 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 585 KB

Using decision trees as tools for settle

Using decision trees as tools for settlement decision trees can be helpful settlement tools

✍ Marjorie Corman Aaron; David P. Hoffer 📂 Article 📅 1996 🏛 Wiley (John Wiley & Sons) ⚖ 355 KB 👁 2 views