Open Access
The elements of statistical learning. 2001
Trevor Hastie,Robert Tibshirani,Jerome H. Friedman +2 more
- 01 Jan 2001
17K
About: The article was published on 01 Jan 2001. and is currently open access.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Moderated estimation of fold change and dispersion for RNA-seq data with DESeq2
TL;DR: This work presents DESeq2, a method for differential analysis of count data, using shrinkage estimation for dispersions and fold changes to improve stability and interpretability of estimates, which enables a more quantitative analysis focused on the strength rather than the mere presence of differential expression.
Focal Loss for Dense Object Detection
Tsung-Yi Lin,Priya Goyal,Ross Girshick,Kaiming He,Piotr Dollár +4 more
- 07 Aug 2017
TL;DR: This paper proposes to address the extreme foreground-background class imbalance encountered during training of dense detectors by reshaping the standard cross entropy loss such that it down-weights the loss assigned to well-classified examples, and develops a novel Focal Loss, which focuses training on a sparse set of hard examples and prevents the vast number of easy negatives from overwhelming the detector during training.
Robust enumeration of cell subsets from tissue expression profiles
Aaron M. Newman,Chih Long Liu,Michael R. Green,Andrew J. Gentles,Weiguo Feng,Yue Xu,Chuong D. Hoang,Maximilian Diehn,Arash Ash Alizadeh +8 more
TL;DR: CIBERSORT outperformed other methods with respect to noise, unknown mixture content and closely related cell types when applied to enumeration of hematopoietic subsets in RNA mixtures from fresh, frozen and fixed tissues, including solid tumors.
Mastering the game of Go without human knowledge
David Silver,Julian Schrittwieser,Karen Simonyan,Ioannis Antonoglou,Aja Huang,Arthur Guez,Thomas Hubert,Lucas Baker,Matthew Lai,Adrian Bolton,Yutian Chen,Timothy P. Lillicrap,Fan Hui,Laurent Sifre,George van den Driessche,Thore Graepel,Demis Hassabis +16 more
TL;DR: An algorithm based solely on reinforcement learning is introduced, without human data, guidance or domain knowledge beyond game rules, that achieves superhuman performance, winning 100–0 against the previously published, champion-defeating AlphaGo.
Focal Loss for Dense Object Detection
TL;DR: Focal loss as discussed by the authors focuses training on a sparse set of hard examples and prevents the vast number of easy negatives from overwhelming the detector during training, which improves the accuracy of one-stage detectors.
10K
References
Least angle regression
Bradley Efron,Trevor Hastie,Iain M. Johnstone,Robert Tibshirani,Hemant Ishwaran,Keith Knight,Jean-Michel Loubes,Jean-Michel Loubes,Pascal Massart,Pascal Massart,David Madigan,David Madigan,Greg Ridgeway,Greg Ridgeway,Saharon Rosset,Saharon Rosset,Ji Zhu,Robert A. Stine,Berwin A. Turlach,Sanford Weisberg +19 more
TL;DR: A publicly available algorithm that requires only the same order of magnitude of computational effort as ordinary least squares applied to the full set of covariates is described.
Regularized Discriminant Analysis
TL;DR: Alternatives to the usual maximum likelihood estimates for the covariance matrices are proposed, characterized by two parameters, the values of which are customized to individual situations by jointly minimizing a sample-based estimate of future misclassification risk.
2.5K
Penalized Discriminant Analysis
TL;DR: A penalized version of Fisher's linear discriminant analysis is described, designed for situations in which there are many highly correlated predictors, such as those obtained by discretizing a function, or the grey-scale values of the pixels in a series of images.
Learning vector quantization
Teuvo Kohonen
- 01 Oct 1998
TL;DR: While VQ and the basic SOM are unsupervised clustering and learning methods, LVQ describes supervised learning, unlike in SOM, no neighborhoods around the “winner” are defined during learning in the basic LVQ, whereby also no spatial order of the codebook vectors is expected to ensue.
547
Boosting and Additive Trees
Trevor Hastie,Robert Tibshirani,Jerome H. Friedman +2 more
- 01 Jan 2009
TL;DR: Boosting is one of the most powerful learning ideas introduced in the last ten years, but as will be seen in this chapter, it can profitably be extended to regression as well.
295
Related Papers (5)
[...]
Leo Breiman
- 01 Oct 2001
Vladimir Vapnik
- 01 Jan 1995
Noboru Murata
- 01 May 1999