Class prediction by nearest shrunken centroids, with applications to DNA microarrays.
From MaRDI portal
Publication:1431225
DOI10.1214/ss/1056397488zbMath1048.62109OpenAlexW1966626540MaRDI QIDQ1431225
Balasubramanian Narasimhan, Gilbert Chu, Robert Tibshirani, Trevor Hastie
Publication date: 27 May 2004
Published in: Statistical Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/ss/1056397488
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Biochemistry, molecular biology (92C40)
Related Items
Sparse regularized discriminant analysis with application to microarrays, Open-Set Nearest Shrunken Centroid Classification, Stability of feature selection in classification issues for high-dimensional correlated data, The robust nearest shrunken centroids classifier for high-dimensional heavy-tailed data, Covariance-Regularized Regression and Classification for high Dimensional Problems, Robust groupwise least angle regression, Optimal variable selection in multi-group sparse discriminant analysis, Unnamed Item, An adaptive multiclass nearest neighbor classifier, Scalable Model-Free Feature Screening via Sliced-Wasserstein Dependency, Variational discriminant analysis with variable selection, A procedure of linear discrimination analysis with detected sparsity structure for high-dimensional multi-class classification, Penalized model-based clustering, Coordinatewise Gaussianization: Theories and Applications, Sparse quadratic classification rules via linear dimension reduction, Classification of biomedical signals for differential diagnosis of Raynaud's phenomenon, Bayesian classification for bivariate normal gene expression, Sparse Covariance Matrix Estimation by DCA-Based Algorithms, New perspectives on multilocus ancestry informativeness, Stable classification with applications to microarray data, An extensive comparison of recent classification tools applied to microarray data, Fast rate of convergence in high-dimensional linear discriminant analysis, Modified linear discriminant analysis approaches for classification of high-dimensional microarray data, Sparse estimation of large covariance matrices via a nested Lasso penalty, A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis, Variational nonparametric discriminant analysis, Sparse Bayesian hierarchical modeling of high-dimensional clustering problems, Feature selection in omics prediction problems using cat scores and false nondiscovery rate control, Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis, Alternating direction method of multipliers for penalized zero-variance discriminant analysis, Mixtures of Dirichlet-multinomial distributions for supervised and unsupervised classification of short text data, Two-group classification with high-dimensional correlated data: a factor model approach, Unnamed Item, Ensemble quantile classifier, Bias-Corrected Diagonal Discriminant Rules for High-Dimensional Classification, Two‐way Gaussian mixture models for high dimensional classification, SURE estimates for high dimensional classification, Robust centroid based classification with minimum error rates for high dimension, low sample size data, Diagonal Discriminant Analysis With Feature Selection for High-Dimensional Data, Surface segmentation for polycube construction based on generalized centroidal Voronoi tessellation, High-dimensional linear discriminant analysis using nonparametric methods, Entropy-based model-free feature screening for ultrahigh-dimensional multiclass classification, Classification and clustering of sequencing data using a Poisson model, Penalized Classification using Fisher’s Linear Discriminant, The effect of microarray image compression on expression-based classification, High-Dimensional Data Classification, Bayesian variable selection in multinomial probit model for classifying high-dimensional data
Uses Software
Cites Work
