The DOI matches its Crossref record.
Unsupervised Feature Selection Using Nonnegative Spectral Analysis
Open accessAbstract
In this paper, a new unsupervised learning algorithm, namely Nonnegative Discriminative Feature Selection (NDFS), is proposed. To exploit the discriminative information in unsupervised scenarios, we perform spectral clustering to learn the cluster labels of the input samples, during which the feature selection is performed simultaneously. The joint learning of the cluster labels and feature selection matrix enables NDFS to select the most discriminative features. To learn more accurate cluster labels, a nonnegative constraint is explicitly imposed to the class indicators. To reduce the redundant or even noisy features, l2,1-norm minimization constraint is added into the objective function, which guarantees the feature selection matrix sparse in rows. Our algorithm exploits the discriminative information and feature correlation simultaneously to select a better feature subset. A simple yet efficient iterative algorithm is designed to optimize the proposed objective function. Experimental results on different real world datasets demonstrate the encouraging performance of our algorithm over the state-of-the-arts.
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
Cited by
A review of unsupervised feature selection methods
Solorio-Fernández, S., Carrasco-Ochoa, J. A., & Martínez-Trinidad, J. F. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09682-y · Cited by 648
A Review of Feature Selection and Its Methods
Venkatesh, B., & Anuradha, J. (2019) · Cybernetics and Information Technologies · doi:10.2478/cait-2019-0001 · Cited by 631
Miao, J., & Niu, L. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.07.111 · Cited by 564
Robust Structured Subspace Learning for Data Representation
Li, Z., Liu, J., Tang, J., & Lu, H. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2400461 · Cited by 353
Self-citationUnsupervised feature selection by regularized self-representation
Zhu, P., Zuo, W., Zhang, L., Hu, Q., & Shiu, S. C. K. (2015) · Pattern Recognition · doi:10.1016/j.patcog.2014.08.006 · Cited by 323
Metadata
- Authors
- Li, Z., Yang, Y., Liu, J., Zhou, X., & Lu, H.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2021-09-20
- Volume
- 26
- Issue
- 1
- Pages
- 1026-1032
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W141062567
- Cited by
- 508
- References
- 0
- FWCI
- 13.69
- Type
- conference paper
- Language
- en
- Open access
- diamond
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: Unsupervised Feature Selection Using Nonnegative Spectral Analysis. https://app.cochat.ai/papers/10.1609/aaai.v26i1.8289
- The paper
- Li, Z., Yang, Y., Liu, J., Zhou, X., & Lu, H. (2021). Unsupervised Feature Selection Using Nonnegative Spectral Analysis. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v26i1.8289
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.