On sparse linear discriminant analysis algorithm for high-dimensional data classification.
This paper proposes a sparse linear discriminant analysis (LDA) algorithm for high-dimensional objects with a number of samples much smaller than the data dimension. This situation arises, for example, in text data classification, where a text document is viewed as a sample vector with every entry giving the measure of a particular term or word, e.g., the frequency of the term in the document. The number of terms tends to be much larger than the number of documents. Groups of documents of different types are classified by different subsets of terms; the terms characterizing one group may not occur in the samples of other groups. Therefore, in high dimensional data, groups of objects often exist in subspaces rather than in the entire space.NEWLINENEWLINE In the proposed algorithm, an LDA is considered which calculates a weight for each dimension and uses the weights to identify the subsets of important dimensions in the discriminant vectors that categorize different groups. This is achieved by including a weight sparsity term that is minimized in the LDA the objective function. The LDA objective function is based on the ratio of between-class and within-class scatters. To avoid singularity of the within-class scatter covariance matrix, it is shifted with a small perturbation. An iterative algorithm is developed for computing the sparse and orthogonal vectors related to the modified objective function. Experiments on real data sets show that the new algorithm can generate better classification results and identify relevant dimensions.
- Sparse linear discriminant analysis with applications to high dimensional low sample size data
- Sparse linear discriminant analysis by thresholding for high dimensional data
- General sparse multi-class linear discriminant analysis
- Recipes for sparse LDA of horizontal data
- Sparse subspace linear discriminant analysis
- An Optimal Set of Discriminant Vectors
- An optimal transformation for discriminant and principal component analysis
- Characterization of a family of algorithms for generalized discriminant analysis on undersampled problems
- Discriminant Analysis with Singular Covariance Matrices: Methods and Applications to Spectroscopic Data
- Expected classification error of the Fisher linear classifier with pseudo-inverse covariance matrix
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- Improving implementation of linear discriminant analysis for the high dimension/small sample size problem
- Regularized discriminant analysis and its application to face recognition
- Structure Preserving Dimension Reduction for Clustered Text Data Based on the Generalized Singular Value Decomposition
- The Geometry of Algorithms with Orthogonality Constraints
- The MATLAB ODE Suite
- On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
- A method for selecting the relevant dimensions for high-dimensional classification in singular vector spaces
- Linear discriminant analysis guided by unsupervised ensemble learning
- Maximization of the sum of the trace ratio on the Stiefel manifold. I: Theory
- Perturbation analysis for the trace quotient problem
- scientific article; zbMATH DE number 5968873 (Why is no real title available?)
- Recipes for sparse LDA of horizontal data
- Classification of sparse high-dimensional vectors
- Superlinear convergence of a general algorithm for the generalized Foley-Sammon discriminant analysis
- scientific article; zbMATH DE number 1841988 (Why is no real title available?)
- High-dimensional linear discriminant analysis classifier for spiked covariance model
- Multi-instance dimensionality reduction via sparsity and orthogonality
- High Dimensional Linear Discriminant Analysis: Optimality, Adaptive Algorithm and Missing Data
- A direct LDA algorithm for high-dimensional data -- with application to face recognition
- High-dimensional data mining algorithm based on SPCA-GWR
- Sketch-and-project method to semi-supervised graph-based learning via Sylvester-class matrix equation
This page was built for publication: On sparse linear discriminant analysis algorithm for high-dimensional data classification.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889381)
