The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Robust Sparse Linear Discriminant Analysis
Abstract
Linear discriminant analysis (LDA) is a very popular supervised feature extraction method and has been extended to different variants. However, classical LDA has the following problems: 1) The obtained discriminant projection does not have good interpretability for features; 2) LDA is sensitive to noise; and 3) LDA is sensitive to the selection of number of projection directions. In this paper, a novel feature extraction method called robust sparse linear discriminant analysis (RSLDA) is proposed to solve the above problems. Specifically, RSLDA adaptively selects the most discriminative features for discriminant analysis by introducing the$l_{2,1}$norm. An orthogonal matrix and a sparse matrix are also simultaneously introduced to guarantee that the extracted features can hold the main energy of the original data and enhance the robustness to noise, and thus RSLDA has the potential to perform better than other discriminant methods. Extensive experiments on six databases demonstrate that the proposed method achieves the competitive performance compared with other state-of-the-art feature extraction methods. Moreover, the proposed method is robust to the noisy data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Very Deep Convolutional Networks for Large-Scale Image Recognition
Simonyan, K., & Zisserman, A. (2014) · arXiv · doi:10.48550/arxiv.1409.1556 · Cited by 114,148
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Donoho, D. L. (2004) · Cited by 16,703
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
From few to many: illumination cone models for face recognition under variable lighting and pose
Georghiades, A. S., Belhumeur, P. N., & Kriegman, D. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927464 · Cited by 4,912
Locality Preserving Projections
He, X., & Niyogi, P. (2003) · Cited by 4,119
Cited by
An Improved Ant Colony Optimization Algorithm Based on Hybrid Strategies for Scheduling Problem
Deng, W., Xu, J., & Zhao, H. (2019) · IEEE Access · doi:10.1109/access.2019.2897580 · Cited by 560
Incomplete Multiview Spectral Clustering With Adaptive Graph Learning
Wen, J., Xu, Y., & Liu, H. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2884715 · Cited by 390
Self-citationAn, Q., Rahman, S., Zhou, J., & Kang, J. J. (2023) · Sensors · doi:10.3390/s23094178 · Cited by 340
Generalized Incomplete Multiview Clustering With Flexible Locality Structure Diffusion
Wen, J., Zhang, Z., Zhang, Z., Fei, L., & Wang, M. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2987164 · Cited by 305
Self-citationPurwar, S., Tripathi, R. K., Ranjan, R., & Saxena, R. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-019-07927-0 · Cited by 46
Analysis of anomaly detection method for Internet of things based on deep learning
Ma, W. (2020) · Transactions on Emerging Telecommunications Technologies · doi:10.1002/ett.3893 · Cited by 31
Metadata
- Authors
- Wen, J., Fang, X., Cui, J., Fei, L., Yan, K., Chen, Y., & Xu, Y.
- Venue
- IEEE Transactions on Circuits and Systems for Video Technology
- Published
- 2019-02
- Volume
- 29
- Issue
- 2
- Pages
- 390-403
- ISSN
- 1051-8215 (ISSN-L)
- 1558-2205
- OpenAlex
- W2791052411
- Cited by
- 370
- References
- 50
- FWCI
- 20.19
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.