The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Effective Discriminative Feature Selection With Nontrivial Solution
Abstract
Feature selection and feature transformation, the two main ways to reduce dimensionality, are often presented separately. In this paper, a feature selection method is proposed by combining the popular transformation-based dimensionality reduction method linear discriminant analysis (LDA) and sparsity regularization. We impose row sparsity on the transformation matrix of LDA through l2,1-norm regularization to achieve feature selection, and the resultant formulation optimizes for selecting the most discriminative features and removing the redundant ones simultaneously. The formulation is extended to the l2,p-norm regularized case, which is more likely to offer better sparsity when 0 < p < 1. Thus, the formulation is a better approximation to the feature selection problem. An efficient algorithm is developed to solve the l2,p-norm-based optimization problem and it is proved that the algorithm converges when 0 < p ≤ 2. Systematical experiments are conducted to understand the work of the proposed method. Promising experimental results on various types of real-world data sets demonstrate the effectiveness of our algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Theoretical and Empirical Analysis of ReliefF and RReliefF
Robnik-Šikonja, M., & Kononenko, I. (2003) · Machine Learning · doi:10.1023/a:1025667309714 · Cited by 3,025
Exact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
Cited by
Auto-Weighted Multi-View Learning for Image Clustering and Semi-Supervised Classification
Nie, F., Cai, G., Li, J., & Li, X. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2754939 · Cited by 406
Self-citationRobust Sparse Linear Discriminant Analysis
Wen, J., Fang, X., Cui, J., Fei, L., Yan, K., Chen, Y., & Xu, Y. (2019) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2018.2799214 · Cited by 370
Feature selection with multi-view data: A survey
Zhang, R., Nie, F., Li, X., & Wei, X. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.019 · Cited by 313
Self-citation
Metadata
- Authors
- Tao, H., Hou, C., Nie, F., Jiao, Y., & Yi, D.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2016-04
- Volume
- 27
- Issue
- 4
- Pages
- 796-808
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2257217404
- Cited by
- 173
- References
- 2
- FWCI
- 12.42
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Effective Discriminative Feature Selection With Nontrivial Solution. https://app.cochat.ai/papers/10.1109/tnnls.2015.2424721
- The paper
- Tao, H., Hou, C., Nie, F., Jiao, Y., & Yi, D. (2016). Effective Discriminative Feature Selection With Nontrivial Solution. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2015.2424721
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.