Trendafilov, Nickolay T. and Gebru, Tsegay Gebrehiwot
(2016).
Recipes for sparse LDA of horizontal data.
METRON, 74 pp. 207–221.
Full text available as:
Abstract
Many important modern applications require analyzing data with more variables than observations, called for short horizontal. In such situation the classical Fisher’s linear discriminant analysis (LDA) does not possess solution because the within-group scatter matrix is singular. Moreover, the number of the variables is usually huge and the classical type of solutions (discriminant functions) are difficult to interpret as they involve all available variables. Nowadays, the aim is to develop fast and reliable algorithms for sparse LDA of horizontal data. The resulting discriminant functions depend on very few original variables, which facilitates their interpretation. The main theoretical and numerical challenge is how to cope with the singularity of the within-group scatter matrix. This work aims at classifying the existing approaches according to the way they tackle this singularity issue, and suggest new ones.
Metrics
Altmetrics from Altmetric | Citations from Dimensions |
| |
Download history for this item
These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.
Actions (login may be required)
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)