Trevor J. Hastie
Stanford University
4 papers in the Anchorcite directory, published between 2000 and 2005, cited 44,810 times in total.
ORCID profileResearch topics
- Statistical Methods and Inference · 3 papers
- Gene expression and cancer classification · 1 paper
- Neural Networks and Applications · 1 paper
- Face and Expression Recognition · 1 paper
- Control Systems and Identification · 1 paper
- Advanced Statistical Methods and Models · 1 paper
Frequent co-authors
- Robert John Tibshirani · 3 papers
- Hui Zou · 1 paper
- Bradley Efron · 1 paper
- Iain M. Johnstone · 1 paper
- Jerome H. Friedman · 1 paper
- Guenther Walther · 1 paper
Papers
- Regularization and Variable Selection Via the Elastic NetJournal of the Royal Statistical Society Series B (Statistical Methodology) · 2005 · 21,798 citations
Summary We propose the elastic net, a new regularization and variable selection method. Real world data and a simulation study show that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation. In addition, the elastic…
- Least angle regressionThe Annals of Statistics · 2004 · 9,561 citations
The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have…
- Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)The Annals of Statistics · 2000 · 7,025 citations
Boosting is one of the most important recent developments in classification methodology. Boosting works by sequentially applying a classification algorithm to reweighted versions of the training data and then taking a weighted majority vote of the sequence of classifiers thus…
- Estimating the Number of Clusters in a Data Set Via the Gap StatisticJournal of the Royal Statistical Society Series B (Statistical Methodology) · 2001 · 6,426 citations
Summary We propose a method (the ‘gap statistic’) for estimating the number of clusters (groups) in a set of data. The technique uses the output of any clustering algorithm (e.g. K-means or hierarchical), comparing the change in within-cluster dispersion with…
Metadata from OpenAlex (CC0).