Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 12,390

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

The Elements of Statistical Learning: Data Mining, Inference, and Prediction

John Lu, Z. Q.·2010·Journal of the Royal Statistical Society Series A: Statistics in Society
DOI 10.1111/j.1467-985x.2010.00646_6.x
Open this paper in CoChat — free account

Abstract

This second edition of this very successful book is a welcome update which should benefit both the rapidly growing user community and researchers who want to keep track of active recent developments and some hot topics in the growing area of statistical learning and data mining. When the book first appeared in 2002, it was a shock to see many techniques inspired from the computer science literature being embraced side by side with modern multivariate regression techniques, many of which were developed either by the third author, either individually or in collaboration with others, or the first two authors together. It was probably due to the late Leo Breiman who brought V. Vapnik’s work on the support vector machine to the attention of the statistical community, which is covered in Chapter 12 (‘Support vector machines and flexible discriminants’) (see Vapnik (1999)), which led to the revival of a key statistical area with a new catchy name, and inspired much recent interest in sparse modelling, though his work is very close to the familiar smoothing spline formulation by Wahba and others (see Wahba (1990)). The influence of computer and information sciences is apparent throughout the book. For example, the 1993 National Institute of Standards and Technology database as a benchmark inspired development of many methods discussed in Chapter 11 and Chapter 13. Vapnik (1999), page 173, discussed the superior performance of the support vector machine on these benchmark data, building on earlier work using variants of neural network methods. Many algorithms that are covered in the book are taken directly from the computer science literature such as those in Chapter 10 (‘Boosting and additive trees’) and many in Chapter 14 (‘Unsupervised learning’). Of the four new chapters, Chapter 15 (‘Random forests’) is based directly on Leo Breiman’s application of the ideas of bagging and boosting (which are discussed earlier in Chapter 8 and Chapter 10) to improve the tree methodology (which is discussed in Chapter 9). Chapter 16 (‘Ensemble learning’) covers more recent developments of applying boosting ideas to many other machine learning methods. Although choosing new topics to add to an already successful book is a difficult task, however, I feel that the choice of topics in Chapter 17 could have been done better, as it does not fit well with the rest of the book and does a poor service to the large area of graphical modelling. Instead, some mention of causality concepts such as Pearl (2009) may be more pertinent to the prediction flavour of the book. The last new chapter (Chapter 18, ‘High-dimensional problems: P≫N’) provides a welcome survey of some recent statistical thinking on selected topics on the theory of analysing high dimensional data. However, because this is an area of much current statistical research interest I think it left much more to be desired, which I shall explain later. Various other changes have been made throughout the book. However, the authors have chosen to leave most of the earlier chapters intact to preserve the familiarity for current readers. Indeed, Chapters 1–8 present a nice set of materials for a basic statistical introduction to regression modelling and model inference. The authors have clearly demonstrated their expertise and great insights in various places such as sections 3.4 (‘Shrinkage methods and Lasso’), 3.5 (‘Partial least squares’) and 3.8 (‘New developments on Lasso’) and Chapter 7 (‘Model assessment and selection’). Chapter 7 and Chapter 8 (‘Model inference and averaging’) comprise an important part of the book on the statistical principles for data mining, though model validation is rarely based on within-data assessment alone. Although I think that the strength of the book is to provide several statistical themes as guiding principles for algorithmic developments in statistical learning, further theoretical study of why or when these techniques should work in practice on high dimensional data sets is still very much in demand. Ripley (1996) contains more theoretical discussions which should complement this book well, in addition to Vapnik’s (1999) far-reaching discussions. Ye (1998) is an important reference which I am surprised is not cited in Chapter 7. Another example is the notion of the curse of dimensionality which is central to motivating many of the multivariate regression techniques that are discussed in the book, but which is poorly explained in pages 22–23 of the book. The recent book by Clarke et al. (2009) gives more attention to this issue. Because multivariate data often lie in a low dimensional manifold, as alluded to in section 13.3.3 (pages 471–475), the hopeless situation of the curse of dimensionality as discussed in pages 22–23 of the book may not happen in many commonly encountered situations. Indeed, real problems are more promising, and I hope that statisticians realize that it may be more realistic to assume much more structure with multivariate d

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1111/j.1467-985x.2010.00646_6.x

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Research works printed but not linked: 6

  1. Clarke, 2009, Principles and Theory for Data Mining and Machine Learning, 10.1007/978-0-387-98135-2 · DOI · Paper page
  2. Ferraty, 2000, Dimension fractale et estimation de la régression dans des espaces vectoriels semi-normés, C. R. Acad. Sci. Paris, 330, 139, 10.1016/S0764-4442(00)00140-3 · DOI
  3. Lu, 1999, Nonparametric regression with singular design, J. Multiv. Anal., 70, 177, 10.1006/jmva.1999.1813 · DOI
  4. Ripley, 1996, Pattern Recognition and Neural Networks, 10.1017/CBO9780511812651 · DOI · Paper page
  5. Vapnik, 1999, The Nature of Statistical Learning Theory
  6. Ye, 1998, On measuring and correcting the effects of data mining and model selection, J. Am. Statist. Ass., 93, 120, 10.1080/01621459.1998.10474094 · DOI · Paper page

Cited by

Metadata

Authors
John Lu, Z. Q.
Venue
Journal of the Royal Statistical Society Series A: Statistics in Society
Publisher
Oxford University Press (OUP)
Published
2010-06-17
Volume
173
Issue
3
Pages
693-694
ISSN
  • 0964-1998 (ISSN-L)
  • 1467-985X
DOI
10.1111/j.1467-985x.2010.00646_6.x
OpenAlex
W2171033594
Cited by
12,390
References
2
FWCI
399.41
Type
journal article
Language
en
Open access
closed
Licence
academic.oup.com/journals/pages/open_access/funder_policies/chorus/standard_publication_model (vor)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.