{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T17:17:38Z","timestamp":1787851058201,"version":"build-2784847793"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"publisher","award":["4031505"],"award-info":[{"award-number":["4031505"]}],"id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.neucom.2026.133928","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T02:25:56Z","timestamp":1778552756000},"page":"133928","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Joint sample-feature subspace learning via bidirectional reconstruction for feature selection"],"prefix":"10.1016","volume":"694","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8576-3119","authenticated-orcid":false,"given":"Morteza","family":"Maleknia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2718-229X","authenticated-orcid":false,"given":"Farid","family":"Saberi-Movahed","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5913-1035","authenticated-orcid":false,"given":"Majid","family":"Soleimani-damaneh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.neucom.2026.133928_bib0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.dsp.2025.105248","article-title":"Sparse dual-graph regularized quadratic dimensionality reduction algorithm based on subspace learning","volume":"164","author":"Ma","year":"2025","journal-title":"Digit. Signal Process."},{"key":"10.1016\/j.neucom.2026.133928_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.123831","article-title":"Discriminative sparse subspace learning with manifold regularization","volume":"249","author":"Feng","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.133928_bib0015","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1109\/TSP.2025.3537867","article-title":"ALPCAH: subspace learning for sample-wise heteroscedastic data","volume":"73","author":"Cavazos","year":"2025","journal-title":"IEEE Trans. Signal Process."},{"issue":"9","key":"10.1016\/j.neucom.2026.133928_bib0020","doi-asserted-by":"crossref","first-page":"4930","DOI":"10.1109\/TKDE.2024.3372657","article-title":"Supervised feature selection via multi-center and local structure learning","volume":"36","author":"Zhang","year":"2024","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.neucom.2026.133928_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.124919","article-title":"Subspace learning for feature selection via rank revealing QR factorization: fast feature selection","volume":"256","author":"Moslemi","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.133928_bib0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121800","article-title":"Robust semi-supervised multi-label feature selection based on shared subspace and manifold learning","volume":"699","author":"Sheikhpour","year":"2025","journal-title":"Inf. Sci."},{"key":"10.1016\/j.neucom.2026.133928_bib0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.129885","article-title":"Joint subspace learning and subspace clustering based unsupervised feature selection","volume":"635","author":"Xiao","year":"2025","journal-title":"Neurocomputing"},{"issue":"1","key":"10.1016\/j.neucom.2026.133928_bib0040","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TBDATA.2024.3378090","article-title":"Feature subspace learning-based binary differential evolution algorithm for unsupervised feature selection","volume":"11","author":"Li","year":"2025","journal-title":"IEEE Trans. Big Data"},{"key":"10.1016\/j.neucom.2026.133928_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.compbiomed.2024.109567","article-title":"Subspace learning using low-rank latent representation learning and perturbation theorem: unsupervised gene selection","volume":"185","author":"Moslemi","year":"2025","journal-title":"Comput. Biol. Med."},{"issue":"10","key":"10.1016\/j.neucom.2026.133928_bib0050","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/s10462-025-11349-w","article-title":"A comprehensive survey on subspace clustering: methods and applications","volume":"58","author":"Miao","year":"2025","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.neucom.2026.133928_bib0055","first-page":"1","article-title":"Nonnegative matrix factorization in dimensionality reduction: a survey","author":"Saberi-Movahed","year":"2024","journal-title":"ACM Comput. Surv."},{"issue":"11","key":"10.1016\/j.neucom.2026.133928_bib0060","doi-asserted-by":"crossref","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","article-title":"Sparse subspace clustering: algorithm, theory, and applications","volume":"35","author":"Elhamifar","year":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"10.1016\/j.neucom.2026.133928_bib0065","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","article-title":"Robust recovery of subspace structures by low-rank representation","volume":"35","author":"Liu","year":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"7","key":"10.1016\/j.neucom.2026.133928_bib0070","article-title":"A self-representation learning method for unsupervised feature selection using feature space basis","volume":"2024","author":"Tiwari","year":"2024","journal-title":"Trans. Mach. Learn. Res."},{"key":"10.1016\/j.neucom.2026.133928_bib0075","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2024.129997","article-title":"Dual-dual subspace learning with low-rank consideration for feature selection","volume":"651","author":"Moslemi","year":"2024","journal-title":"Phys. a Stat. Mech. Appl."},{"issue":"1","key":"10.1016\/j.neucom.2026.133928_bib0080","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.patcog.2014.08.004","article-title":"Subspace learning for unsupervised feature selection via matrix factorization","volume":"48","author":"Wang","year":"2015","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.neucom.2026.133928_bib0085","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.knosys.2014.11.008","article-title":"Unsupervised feature selection via maximum projection and minimum redundancy","volume":"75","author":"Wang","year":"2015","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.neucom.2026.133928_bib0090","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.neucom.2017.08.047","article-title":"Unsupervised feature selection by regularized matrix factorization","volume":"273","author":"Qi","year":"2018","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2026.133928_bib0095","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.112878","article-title":"Structured learning for unsupervised feature selection with high-order matrix factorization","volume":"140","author":"Wang","year":"2020","journal-title":"Expert Syst. Appl."},{"issue":"11","key":"10.1016\/j.neucom.2026.133928_bib0100","doi-asserted-by":"crossref","first-page":"6881","DOI":"10.1109\/TNNLS.2021.3083763","article-title":"Unsupervised feature selection via orthogonal basis clustering and local structure preserving","volume":"33","author":"Lin","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.neucom.2026.133928_bib0105","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.neunet.2023.06.018","article-title":"Unsupervised feature selection based on variance\u00e2\u20ac\u201ccovariance subspace distance","volume":"166","author":"Karami","year":"2023","journal-title":"Neural Netw."},{"key":"10.1016\/j.neucom.2026.133928_bib0110","doi-asserted-by":"crossref","first-page":"1242","DOI":"10.1016\/j.neucom.2015.07.068","article-title":"Self-representation based dual-graph regularized feature selection clustering","volume":"171","author":"Shang","year":"2016","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2026.133928_bib0115","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.103855","article-title":"Unsupervised feature selection based on adaptive similarity learning and subspace clustering","volume":"95","author":"Parsa","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.neucom.2026.133928_bib0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.129557","article-title":"Bilinear self-representation for unsupervised feature selection with structure learning","volume":"625","author":"Assadi","year":"2025","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2026.133928_bib0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2026.133507","article-title":"FWHSR: an unsupervised feature selection framework via feature-weighted hypergraph and clustering similarity self-representation","volume":"683","author":"Huang","year":"2026","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2026.133928_bib0130","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.knosys.2016.09.006","article-title":"Subspace learning-based graph regularized feature selection","volume":"112","author":"Shang","year":"2016","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.neucom.2026.133928_bib0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.07.001","article-title":"Sparse and low-redundant subspace learning-based dual-graph regularized robust feature selection","volume":"187","author":"Shang","year":"2020","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.neucom.2026.133928_bib0140","doi-asserted-by":"crossref","first-page":"2355","DOI":"10.1109\/TCYB.2025.3546658","article-title":"Unsupervised feature selection for high-order embedding learning and sparse learning","volume":"55","author":"Hu","year":"2025","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.neucom.2026.133928_bib0145","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2026.113401","article-title":"Unsupervised feature selection based on dual-graph clustering learning and adaptive weighting","volume":"178","author":"Wang","year":"2026","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.neucom.2026.133928_bib0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120277","article-title":"Unsupervised feature selection using orthogonal encoder-decoder factorization","volume":"663","author":"Mozafari","year":"2024","journal-title":"Inf. Sci."},{"issue":"1","key":"10.1016\/j.neucom.2026.133928_bib0155","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103923","article-title":"Unsupervised feature selection using sparse manifold learning: auto-encoder approach","volume":"62","author":"Moslemi","year":"2025","journal-title":"Inf. Process. Manag."},{"key":"10.1016\/j.neucom.2026.133928_bib0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2026.104714","article-title":"Unsupervised feature selection via graph-based proximity and structured autoencoder-like NMF","volume":"63","author":"Pakmanesh","year":"2026","journal-title":"Inf. Process. Manag."},{"key":"10.1016\/j.neucom.2026.133928_bib0165","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2026.132678","article-title":"Autoencoder-like structure with correntropy-induced metric for unsupervised feature selection","volume":"671","author":"Luo","year":"2026","journal-title":"Neurocomputing"},{"key":"10.1016\/j.neucom.2026.133928_bib0170","doi-asserted-by":"crossref","DOI":"10.1016\/j.neunet.2024.106814","article-title":"Robust generalized PCA for enhancing discriminability and recoverability","volume":"181","author":"Dai","year":"2025","journal-title":"Neural Netw."},{"key":"10.1016\/j.neucom.2026.133928_bib0175","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119051","article-title":"Deep autoencoder-like NMF with contrastive regularization and feature relationship preservation","volume":"214","author":"Salahian","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.neucom.2026.133928_bib0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.120121","article-title":"Robust autoencoder feature selector for unsupervised feature selection","volume":"660","author":"Ling","year":"2024","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.neucom.2026.133928_bib0185","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.patcog.2014.08.006","article-title":"Unsupervised feature selection by regularized self-representation","volume":"48","author":"Zhu","year":"2015","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.neucom.2026.133928_bib0190","series-title":"Functional Analysis, Calculus of Variations and Optimal Control","author":"Clarke","year":"2013"},{"key":"10.1016\/j.neucom.2026.133928_bib0195","series-title":"Introduction to Nonsmooth Optimization","author":"Bagirov","year":"2014"},{"key":"10.1016\/j.neucom.2026.133928_bib0200","series-title":"A Course in Functional Analysis","author":"Conway","year":"1985"},{"key":"10.1016\/j.neucom.2026.133928_bib0205","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"2006"},{"issue":"10","key":"10.1016\/j.neucom.2026.133928_bib0210","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1287\/mnsc.31.10.1312","article-title":"An improved successive linear programming algorithm","volume":"31","author":"Zhang","year":"1985","journal-title":"Manag. Sci."},{"key":"10.1016\/j.neucom.2026.133928_bib0215","series-title":"Linear Programming and Network Flows","author":"Bazaraa","year":"2004"},{"key":"10.1016\/j.neucom.2026.133928_bib0220","series-title":"Minimization Methods for Non-Differentiable Functions","author":"Shor","year":"1985"},{"key":"10.1016\/j.neucom.2026.133928_bib0225","series-title":"Methods of Descent for Nondifferentiable Optimization","author":"Kiwiel","year":"1985"},{"issue":"3","key":"10.1016\/j.neucom.2026.133928_bib0230","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/030601296","article-title":"A robust gradient sampling algorithm for nonsmooth, nonconvex optimization","volume":"15","author":"Burke","year":"2005","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.neucom.2026.133928_bib0235","series-title":"Numerical Optimization","author":"Bonnans","year":"2006"},{"key":"10.1016\/j.neucom.2026.133928_bib0240","series-title":"First-Order Methods in Optimization","author":"Beck","year":"2017"},{"issue":"4","key":"10.1016\/j.neucom.2026.133928_bib0245","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/S1052623498345075","article-title":"Newton\u2019s method for large bound-constrained optimization problems","volume":"9","author":"Lin","year":"1999","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.neucom.2026.133928_bib0250","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1007\/s10462-019-09682-y","article-title":"A review of unsupervised feature selection methods","volume":"53","author":"Solorio-Fern\u00e1ndez","year":"2020","journal-title":"Artif. Intell. Rev."}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226013251?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226013251?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T16:21:23Z","timestamp":1787847683000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231226013251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":50,"alternative-id":["S0925231226013251"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2026.133928","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Joint sample-feature subspace learning via bidirectional reconstruction for feature selection","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2026.133928","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"133928"}}