The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Unsupervised Feature Selection with Structured Graph Optimization
Open accessAbstract
Since amounts of unlabelled and high-dimensional data needed to be processed, unsupervised feature selection has become an important and challenging problem in machine learning. Conventional embedded unsupervised methods always need to construct the similarity matrix, which makes the selected features highly depend on the learned structure. However real world data always contain lots of noise samples and features that make the similarity matrix obtained by original data can't be fully relied. We propose an unsupervised feature selection approach which performs feature selection and local structure learning simultaneously, the similarity matrix thus can be determined adaptively. Moreover, we constrain the similarity matrix to make it contain more accurate information of data structure, thus the proposed approach can select more valuable features. An efficient and simple algorithm is derived to optimize the problem. Experiments on various benchmark data sets, including handwritten digit data, face image data and biomedical data, validate the effectiveness of the proposed approach.
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
Eigenfaces vs. Fisherfaces: recognition using class specific linear projection
Belhumeur, P. N., Hespanha, J. P., & Kriegman, D. J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.598228 · Cited by 11,707
Khan, J., Wei, J. S., Ringnér, M., Saal, L. H., Ladanyi, M., Westermann, F., Berthold, F., Schwab, M., Antonescu, C. R., Peterson, C., et al. (2001) · Nature Medicine · doi:10.1038/89044 · Cited by 2,644
Gene expression correlates of clinical prostate cancer behavior
Singh, D., Febbo, P. G., Ross, K., Jackson, D. G., Manola, J., Ladd, C., Tamayo, P., Renshaw, A. A., D'Amico, A. V., Richie, J. P., et al. (2002) · Cancer Cell · doi:10.1016/s1535-6108(02)00030-2 · Cited by 2,512
A database for handwritten text recognition research
Hull, J. J. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.291440 · Cited by 2,244
Laplacian Score for Feature Selection
He, X., Cai, D., & Niyogi, P. (2005) · Cited by 1,962
Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization
Nie, F., Huang, H., Cai, X., & Ding, C. H. Q. (2010) · Cited by 1,522
Self-citationColumbia Object Image Library (COIL100)
Nayar, S. K. (1996) · Medical Entomology and Zoology · Cited by 1,372
Unsupervised feature selection for multi-cluster data
Cai, D., Zhang, C., & He, X. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835848 · Cited by 1,112
THE LAPLACIAN SPECTRUM OF GRAPHS y
Mohar, B. (1991) · Cited by 1,090
Automatic classification of single facial images
Lyons, M. J., Budynek, J., & Akamatsu, S. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.817413 · Cited by 1,075
Cited by
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Treviño, R. P., Tang, J., & Liu, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.07996 · Cited by 739
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
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-citationLiang, C., Wang, L., Liu, L., Zhang, H., & Guo, F. (2023) · Pattern Recognition · doi:10.1016/j.patcog.2023.109632 · Cited by 72
Metadata
- Authors
- Nie, F., Zhu, W., & Li, X.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2016-02-21
- Volume
- 30
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2422268042
- Cited by
- 321
- References
- 27
- FWCI
- 13.98
- 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 with Structured Graph Optimization. https://app.cochat.ai/papers/10.1609/aaai.v30i1.10168
- The paper
- Nie, F., Zhu, W., & Li, X. (2016). Unsupervised Feature Selection with Structured Graph Optimization. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v30i1.10168
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.