The elements of statistical learning. Data mining, inference, and prediction. 2nd ed.

*(English)*Zbl 1273.62005
Springer Series in Statistics. New York, NY: Springer (ISBN 978-0-387-84857-0/hbk; 978-0-387-84858-7/ebook). xxii, 745 p. (2009).

Publisher’s description: During the past decade there has been an explosion in computation and information technology. With it have come vast amounts of data in a variety of fields such as medicine, biology, finance, and marketing. The challenge of understanding these data has led to the development of new tools in the field of statistics, and spawned new areas such as data mining, machine learning, and bioinformatics. Many of these tools have common underpinnings but are often expressed with different terminology. This book describes the important ideas in these areas in a common conceptual framework. While the approach is statistical, the emphasis is on concepts rather than mathematics. Many examples are given, with a liberal use of color graphics. It is a valuable resource for statisticians and anyone interested in data mining in science or industry. The book’s coverage is broad, from supervised learning (prediction) to unsupervised learning. The many topics include neural networks, support vector machines, classification trees and boosting – the first comprehensive treatment of this topic in any book.

This major new edition features many topics not covered in the original, including graphical models, random forests, ensemble methods, least angle regression and path algorithms for the lasso, non-negative matrix factorization, and spectral clustering. There is also a chapter on methods for “wide” data (\(p\) bigger than \(n\)), including multiple testing and false discovery rates.

See the review of the first edition in [Zbl 0973.62007].

This major new edition features many topics not covered in the original, including graphical models, random forests, ensemble methods, least angle regression and path algorithms for the lasso, non-negative matrix factorization, and spectral clustering. There is also a chapter on methods for “wide” data (\(p\) bigger than \(n\)), including multiple testing and false discovery rates.

See the review of the first edition in [Zbl 0973.62007].