The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Robust Joint Graph Sparse Coding for Unsupervised Spectral Feature Selection
Open accessAbstract
In this paper, we propose a new unsupervised spectral feature selection model by embedding a graph regularizer into the framework of joint sparse regression for preserving the local structures of data. To do this, we first extract the bases of training data by previous dictionary learning methods and, then, map original data into the basis space to generate their new representations, by proposing a novel joint graph sparse coding (JGSC) model. In JGSC, we first formulate its objective function by simultaneously taking subspace learning and joint sparse regression into account, then, design a new optimization solution to solve the resulting objective function, and further prove the convergence of the proposed solution. Furthermore, we extend JGSC to a robust JGSC (RJGSC) via replacing the least square loss function with a robust loss function, for achieving the same goals and also avoiding the impact of outliers. Finally, experimental results on real data sets showed that both JGSC and RJGSC outperformed the state-of-the-art algorithms in terms of k -nearest neighbor classification performance.
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
Gene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954 · cited 1×
“A wrapper model wraps the selection process to identify relevant features while requiring a predetermined learning algorithm [34].”
MethodEfron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
Olshausen, B. A., & Field, D. J. (1996) · Nature · doi:10.1038/381607a0 · Cited by 5,694 · cited 1×
“For example, an 1-norm regularizer [43], [44], [48] leads to the element sparsity and an 2,1-norm regularizer [49] results in the group sparsity, while a mixed-norm regularizer combining an 1-norm with an 2,1-norm [50] produces the mixed sparsity.”
Locality Preserving Projections
He, X., & Niyogi, P. (2003) · Cited by 4,119
(2006) · Cited by 3,624
Sparse Principal Component Analysis
Zou, H., Hastie, T., & Tibshirani, R. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x113430 · Cited by 3,152
Online Learning for Matrix Factorization and Sparse Coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0050 · Cited by 2,258
Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization
Nie, F., Huang, H., Cai, X., & Ding, C. H. Q. (2010) · neural information processing systems · Cited by 2,231
Convex multi-task feature learning
Argyriou, A., Evgeniou, T., & Pontil, M. (2008) · Machine Learning · doi:10.1007/s10994-007-5040-8 · Cited by 1,528
Cited by
A Survey on Multi-Task Learning
Zhang, Y., & Yang, Q. (2017) · arXiv · doi:10.48550/arxiv.1707.08114 · Cited by 2,910
A Survey on Multi-Task Learning
Zhang, Y., & Yang, Q. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3070203 · Cited by 2,878
Efficient kNN classification with different numbers of nearest neighbors
Zhang, S., Li, X., Zong, M., Zhu, X., & Wang, R. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2673241 · Cited by 1,378
Self-citationLearning k for kNN Classification
Zhang, S., Li, X., Zong, M., Zhu, X., & Cheng, D. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2990508 · Cited by 576
Self-citationFeature selection for text classification: A review
Deng, X., Li, Y., Weng, J., & Zhang, J. (2019) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6083-5 · Cited by 351
Temporally Constrained Sparse Group Spatial Patterns for Motor Imagery BCI
Zhang, Y., Nam, C. S., Zhou, G., Jin, J., Wang, X., & Cichocki, A. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2841847 · Cited by 330
A novel k NN algorithm with data-driven k parameter computation
Zhang, S., Cheng, D., Deng, Z., Zong, M., & Deng, X. (2018) · Pattern Recognition Letters · doi:10.1016/j.patrec.2017.09.036 · Cited by 278
Self-citationDescribing Video With Attention-Based Bidirectional LSTM
Bin, Y., Yang, Y., Shen, F., Xie, N., Shen, H. T., & Li, X. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2831447 · Cited by 270
Self-citationBeyond Frame-level CNN: Saliency-Aware 3-D CNN With LSTM for Video Action Recognition
Wang, X., Gao, L., Song, J., & Shen, H. (2017) · IEEE Signal Processing Letters · doi:10.1109/lsp.2016.2611485 · Cited by 265
One-Step Multi-View Spectral Clustering
Zhu, X., Zhang, S., He, W., Hu, R., Lei, C., & Zhu, P. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2873378 · Cited by 265
Self-citationA brief review on multi-task learning
Thung, K.-H., & Wee, C.-Y. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6463-x · Cited by 263
Structure-Aware Positional Transformer for Visible-Infrared Person Re-Identification
Chen, C., Ye, M., Qi, M., Wu, J., Jiang, J., & Lin, C.-W. (2022) · IEEE Transactions on Image Processing · doi:10.1109/tip.2022.3141868 · Cited by 255
Yu, Z., Tan, E.-L., Ni, D., Qin, J., Chen, S., Li, S., Lei, B., & Wang, T. (2018) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2017.2705031 · Cited by 109
Robust and Secure Image Fingerprinting Learned by Neural Network
Li, Y., Wang, D., & Tang, L. (2020) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2019.2890966 · Cited by 52
Metadata
- Authors
- Zhu, X., Li, X., Zhang, S., Ju, C., & Wu, X.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2017-06
- Volume
- 28
- Issue
- 6
- Pages
- 1263-1275
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2335437633
- Cited by
- 339
- References
- 58
- FWCI
- 44.27
- 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.