Graph-based sparse linear discriminant analysis for high-dimensional classification
From MaRDI portal
Recommendations
- L1 least squares for sparse high-dimensional LDA
- Sparse linear discriminant analysis with applications to high dimensional low sample size data
- Sparse subspace linear discriminant analysis
- Adherently penalized linear discriminant analysis
- Sparse linear discriminant analysis by thresholding for high dimensional data
Cites work
- scientific article; zbMATH DE number 6377993 (Why is no real title available?)
- scientific article; zbMATH DE number 6378086 (Why is no real title available?)
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A direct approach to sparse discriminant analysis in ultra-high dimensions
- A direct estimation approach to sparse linear discriminant analysis
- A fast unified algorithm for solving group-lasso penalize learning problems
- A road to classification in high dimensional space: the regularized optimal affine discriminant
- A significance test for graph-constrained estimation
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
- Classifier technology and the illusion of progress
- Edge detection in sparse Gaussian graphical models
- Extended Bayesian information criteria for model selection with large model spaces
- Flexible Discriminant Analysis by Optimal Scoring
- Graph estimation with joint additive models
- High-dimensional classification using features annealed independence rules
- High-dimensional graphs and variable selection with the Lasso
- Incorporating Predictor Network in Penalized Regression with Application to Microarray Data
- Model Selection and Estimation in Regression with Grouped Variables
- Model selection and estimation in the Gaussian graphical model
- Network-based feature screening with applications to genome data
- Network-based penalized regression with application to genomic data
- Pattern recognition and machine learning.
- Penalized classification using Fisher's linear discriminant
- Penalized model-based clustering with application to variable selection
- Penalized model-based clustering with unconstrained covariance matrices
- Selection and estimation for mixed graphical models
- Sequential Lasso cum EBIC for feature selection with ultra-high dimensional feature space
- Simultaneous Grouping Pursuit and Feature Selection Over an Undirected Graph
- Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCAR
- Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
- Sparse inverse covariance estimation with the graphical lasso
- Sparse linear discriminant analysis by thresholding for high dimensional data
- Sparse semiparametric discriminant analysis
- The Group Lasso for Logistic Regression
Cited in
(8)- Optimal Linear Discriminant Analysis for High-Dimensional Functional Data
- Network linear discriminant analysis
- Graphical-model based high dimensional generalized linear models
- High-dimensional Gaussian graphical models on network-linked data
- Multiclass sparse discriminant analysis incorporating graphical structure among predictors
- Multi-network assisted clustering using a grouped factor model
- NetDA: an R package for network-based discriminant analysis subject to multilabel classes
- Sparse Fréchet sufficient dimension reduction with graphical structure among predictors
Describes a project that uses
Uses Software
This page was built for publication: Graph-based sparse linear discriminant analysis for high-dimensional classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2418517)
