The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Joint Embedding Learning and Sparse Regression: A Framework for Unsupervised Feature Selection
Open accessAbstract
Feature selection has aroused considerable research interests during the last few decades. Traditional learning-based feature selection methods separate embedding learning and feature ranking. In this paper, we propose a novel unsupervised feature selection framework, termed as the joint embedding learning and sparse regression (JELSR), in which the embedding learning and sparse regression are jointly performed. Specifically, the proposed JELSR joins embedding learning with sparse regression to perform feature selection. To show the effectiveness of the proposed framework, we also provide a method using the weight via local linear approximation and adding the l2,1 -norm regularization, and design an effective algorithm to solve the corresponding optimization problem. Furthermore, we also conduct some insightful discussion on the proposed feature selection approach, including the convergence analysis, computational complexity, and parameter determination. In all, the proposed framework not only provides a new perspective to view traditional methods but also evokes some other deep researches for feature selection. Compared with traditional unsupervised feature selection methods, our approach could integrate the merits of embedding learning and sparse regression. Promising experimental results on different kinds of data sets, including image, voice data and biological data, have validated the effectiveness of our proposed 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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
An introduction to variable and feature selection
GuyonIsabelle, & ElisseeffAndré (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944968 · Cited by 7,715
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
An Introduction to Variable and Feature Selection.
Guyon, I., & Elisseeff, A. (2003) · Cited by 6,576
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Selection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
Yan, S., Xu, D., Zhang, B., Zhang, H.-J., Yang, Q., & Lin, S. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.250598 · Cited by 3,031
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 · cited 1×
“Besides, we also compare one of the famous supervised feature selection approach RelieF in this scenario [45].”
Result
Cited by
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-citationMulti-Participant Multi-Class Vertical Federated Learning
Feng, S., & Yu, H. (2020) · arXiv · doi:10.48550/arxiv.2001.11154 · Cited by 66
Feature Selection Boosted by Unselected Features
Zheng, W., Chen, S., Fu, Z., Zhu, F., Yan, H., & Yang, J. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3058172 · Cited by 51
Zhao, J., Chen, L., Pedrycz, W., & Wang, W. (2018) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2018.2815997 · Cited by 50
Metadata
- Authors
- Hou, C., Nie, F., Li, X., Yi, D., & Wu, Y.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2014-06
- Volume
- 44
- Issue
- 6
- Pages
- 793-804
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2076363162
- Cited by
- 554
- References
- 35
- FWCI
- 28.99
- Type
- journal article
- Language
- en
- Open access
- green
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: Joint Embedding Learning and Sparse Regression: A Framework for Unsupervised Feature Selection. https://app.cochat.ai/papers/10.1109/tcyb.2013.2272642
- The paper
- Hou, C., Nie, F., Li, X., Yi, D., & Wu, Y. (2014). Joint Embedding Learning and Sparse Regression: A Framework for Unsupervised Feature Selection. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2013.2272642
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.