Name
Abstract | ||
|---|---|---|
Linear discriminant analysis (LDA) is a linear feature extraction approach, and it has received much attention. On the basis of LDA, researchers have done a lot of research work on it, and many variant versions of LDA were proposed. However, the inherent problem of LDA cannot be solved very well by the variant methods. The major disadvantages of the classical LDA are as follows. First, it is sensitive to outliers and noises. Second, only the global discriminant structure is preserved, while the local discriminant information is ignored. In this paper, we present a new orthogonal sparse linear discriminant analysis (OSLDA) algorithm. The k nearest neighbour graph is first constructed to preserve the locality discriminant information of sample points. Then, L-2,L-1-norm constraint on the projection matrix is used to act as loss function, which can make the proposed method robust to outliers in data points. Extensive experiments have been performed on several standard public image databases, and the experiment results demonstrate the performance of the proposed OSLDA algorithm. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1080/00207721.2018.1424964 | INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE |
Keywords | Field | DocType |
Linear discriminant analysis (LDA), L-2,L-1-norm, nearest neighbour, orthogonal sparse linear discriminant analysis (OSLDA) | Data point,Nearest neighbour,Mathematical optimization,Locality,Pattern recognition,Discriminant,Outlier,Projection (linear algebra),Feature extraction,Artificial intelligence,Linear discriminant analysis,Mathematics | Journal |
Volume | Issue | ISSN |
49 | 4 | 0020-7721 |
Citations | PageRank | References |
2 | 0.36 | 37 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhonghua Liu | 1 | 115 | 11.12 |
| Gang Liu | 2 | 8 | 1.77 |
| Jie-xin Pu | 3 | 5 | 1.93 |
| Xiaohong Wang | 4 | 2 | 0.36 |
| Haijun Wang | 5 | 55 | 9.23 |