zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Classification and regression trees. (English) Zbl 0541.62042
The Wadsworth Statistics/Probability Series. Belmont, California: Wadsworth International Group, a Division of Wadsworth, Inc. X, 358 p. $ 29.25; $ 18.95 (1984).

This book is about CART (Classification and Regression Trees), an extension of two earlier methodologies developed at the Institute for Social Research of the University of Michigan. During the early 1960’s AID (Automatic Interaction Detection) was first used (at least in part) to grow regression trees. THAID (a sister-methodology primarily used for developing classification rules) followed in the early 1970’s. These procedures are not without problems; most notably the lack of a satisfactory stopping rule. CART attempts to circumvent this difficulty by diminishing the importance of the forward stopping rule in a clever way. The authors propose growing ”large” trees and then pruning them back to a manageable size using a two-fold measure called ”cost-complexicity”.

This book consists of twelve chapters: 1. Background; 2. Introduction to tree classification; 3. Right sized trees and honest estimates; 4. Splitting rules; 5. Strengthening and interpreting; 6. Medical diagnosis and prognosis; 7. Mass spectra classification; 8. Regression trees; 9. Bayes rules and partitions; 10. Optimal pruning; 11. Construction of trees from a learning sample; and 12. Consistency. There is a good list of references at the end of the book, however there are no exercises. The first eight chapters give an expository discussion of the use of binary trees as a nonparametric classification procedure. Last four chapters provide the theoretical framework for the methodology.

The combination of algorithmic, consultative, and theoretical material as well as the generous helping of live and simulated data sets make this work unusually worthwhile.

Reviewer: A.K.Gupta

62H30Classification and discrimination; cluster analysis (statistics)
62-02Research monographs (statistics)
62P10Applications of statistics to biology and medical sciences
62P99Applications of statistics