The Elements of Statistical Learning: Data Mining, Inference, and PredictionDuring 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 & 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. Trevor Hastie, Robert Tibshirani, and Jerome Friedman are professors of statistics at Stanford University. They are prominent researchers in this area: Hastie and Tibshirani developed generalized additive models and wrote a popular book of that title. Hastie co-developed much of the statistical modeling software and environment in R/S-PLUS and invented principal curves and surfaces. Tibshirani proposed the lasso and is co-author of the very successful An Introduction to the Bootstrap. Friedman is the co-inventor of many data-mining tools including CART, MARS, projection pursuit and gradient boosting. |
From inside the book
Results 1-5 of 72
... criterion for picking k , since we would always pick k = 1 ! It would seem that k - nearest - neighbor methods would be more appropriate for the mixture Scenario 2 described above , while for Gaussian data the decision boundaries of k ...
... criterion for choosing f , - EPE ( ƒ ) = E ( Y - ƒ ( X ) ) 2 = [ ( v − f ( x ) ) 2Pr ( da , dy ) , ( 2.9 ) ( 2.10 ) the expected ( squared ) prediction error . By conditioning * on X , we can write EPE as EPE ( ƒ ) = ExEy | x ( [ Y – ƒ ...
... criterion ( 2.11 ) ? What happens if we replace the L2 loss function with the L1 : E | Y - ƒ ( X ) | ? The solution in this case is the conditional median , f ( x ) = median ( Y | X = x ) , ( 2.18 ) which is a different measure of ...
... when we average squared errors uniformly in our EPE criterion 28 2. Overview of Supervised Learning Statistical Models, Supervised Learning and Function Approximation A Statistical Model for the Joint Distribution Pr(X, Y)
... criterion . With such a model it becomes natural to use least squares as a data criterion for model estimation as in ( 2.1 ) . Simple modifications can be made to avoid the independence assumption ; for example , we can have Var ( YX ...
Contents
1 | |
3 | |
5 | |
7 | |
9 | |
11 | |
Bibliographic Notes | 75 |
41 | 108 |
79 | 282 |
Bibliographic Notes | 295 |
Support Vector Machines | 350 |
Bibliographic Notes | 367 |
Flexible Discriminants | 371 |
Bibliographic Notes | 406 |
Prototype Methods and NearestNeighbors | 410 |
Unsupervised Learning | 437 |
55 | 146 |
Bibliographic Notes | 155 |
73 | 159 |
Kernel Methods | 165 |
Additive Models Trees and Related Methods | 257 |
165 | 264 |
Bibliographic Notes | 504 |
81 | 511 |
91 | 517 |
Author Index | 523 |
95 | 530 |