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.
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
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].”
ResultToward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
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-citationToward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
Zhang, Z., & Zha, H. (2004) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827502419154 · Cited by 1,479
Unsupervised feature selection using feature similarity
Mitra, P., Murthy, C. A., & Pal, S. K. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990133 · Cited by 1,460
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
Spectral feature selection for supervised and unsupervised learning
Zhao, Z., & Liu, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273641 · Cited by 906
Feature Selection for Unsupervised Learning
Dy, J., & Brodley, C. E. (2004) · doi:10.5555/1005332.1016787 · Cited by 885
Label Propagation through Linear Neighborhoods
Wang, F., & Zhang, C. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190672 · Cited by 690
New Approaches to Fuzzy-Rough Feature Selection
Jensen, R., & Shen, Q. (2009) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2008.924209 · Cited by 591
Flexible Manifold Embedding: A Framework for Semi-Supervised and Unsupervised Dimension Reduction
Nie, F., Xu, D., Tsang, I. W.-H., & Zhang, C. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2044958 · Cited by 509
Self-citationFeature selection for clustering - a filter solution
Dash, M., Choi, K., Scheuermann, P., & Liu, H. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183893 · Cited by 383
Trace ratio criterion for feature selection
Nie, F., Xiang, S., Jia, Y., Zhang, C., & Yan, S. (2008) · Cited by 356
Self-citationSpectral Regression for Efficient Regularized Subspace Learning
Cai, D., He, X., & Han, J. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408855 · Cited by 355
Feature selection using principal feature analysis
Lu, Y., Cohen, I., Zhou, X. S., & Tian, Q. (2007) · Proceedings of the 15th ACM international conference on Multimedia · doi:10.1145/1291233.1291297 · Cited by 341
Discriminant Locally Linear Embedding With High-Order Tensor Data
Li, X., Lin, S., Yan, S., & Xu, D. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2007.911536 · Cited by 303
Self-citationEfficient Spectral Feature Selection with Minimum Redundancy
Zhao, Z., Wang, L., & Liu, H. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7671 · Cited by 277
Selection of Variables to Preserve Multivariate Data Structure, Using Principal Components
Krzanowski, W. J. (1987) · Applied Statistics · doi:10.2307/2347842 · Cited by 275
Wolf, L., & Shashua, A. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1194906 · Cited by 239
Bayesian feature and model selection for Gaussian mixture models
Constantinopoulos, C., Titsias, M. K., & Likas, A. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.111 · Cited by 199
Feature Selection in Clustering Problems
Röth, V., & Lange, T. (2003) · neural information processing systems · Cited by 163
Nonlinear Dimensionality Reduction with Local Spline Embedding
Xiang, S., Nie, F., Zhang, C., & Zhang, C. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.204 · Cited by 113
Self-citationConvex Principal Feature Selection
Masaeli, M., Yan, Y., Cui, Y. D., Fung, G., & Dy, J. (2010) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.54 · Cited by 51
Effective Feature Extraction in High-Dimensional Space
Pang, Y., Yuan, Y., & Li, X. (2008) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2008.927276 · Cited by 45
Self-citation
Cited by
A Survey of Sparse Representation: Algorithms and Applications
Zhang, Z., Xu, Y., Yang, J., Li, X., & Zhang, D. (2015) · IEEE Access · doi:10.1109/access.2015.2430359 · Cited by 1,092
Self-citationA 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
Predicting multicellular function through multi-layer tissue networks
Zitnik, M., & Leskovec, J. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btx252 · Cited by 519
Feature Selection Based on Structured Sparsity: A Comprehensive Study
Gui, J., Sun, Z., Ji, S., Tao, D., & Tan, T. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2551724 · Cited by 335
AI-based modeling and data-driven evaluation for smart manufacturing processes
Ghahramani, M., Qiao, Y., Zhou, M. C., O'Hagan, A., & Sweeney, J. (2020) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2020.1003114 · Cited by 334
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
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.