{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:46:18Z","timestamp":1777639578655,"version":"3.51.4"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61271296"],"award-info":[{"award-number":["61271296"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2012M521747"],"award-info":[{"award-number":["2012M521747"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"111 Project of China","award":["B08038"],"award-info":[{"award-number":["B08038"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities of China","doi-asserted-by":"crossref","award":["BDY21"],"award-info":[{"award-number":["BDY21"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/tnnls.2016.2636130","type":"journal-article","created":{"date-parts":[[2016,12,29]],"date-time":"2016-12-29T19:14:22Z","timestamp":1483038862000},"page":"738-743","source":"Crossref","is-referenced-by-count":25,"title":["Robust DLPP With Nongreedy $\\ell _1$ -Norm Minimization and Maximization"],"prefix":"10.1109","volume":"29","author":[{"given":"Qianqian","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8509-4549","authenticated-orcid":false,"given":"Quanxue","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deyan","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinbo","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/AFGR.2002.1004130"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2038764"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2427451"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2512563"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1109\/TNNLS.2015.2496964","article-title":"$L_{1}$ -norm low-rank matrix decomposition by neural networks and mollifiers","volume":"27","author":"liu","year":"2016","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref14","first-page":"739","article-title":"Robust $L_{1}$ norm factorization in the presence of outliers and missing data by alternative convex programming","author":"ke","year":"2005","journal-title":"Proc Conf Comput Vis and Pattern Recog"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.114"},{"key":"ref16","first-page":"1433","article-title":"Robust principal component analysis with non-greedy $L_{1}$ -norm maximization","author":"nie","year":"2011","journal-title":"Proc 22th Int Joint Conf Artif Intell"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2253476"},{"key":"ref18","first-page":"1836","article-title":"Robust distance metric learning via simultaneous $L_{1}$ -norm minimization and maximization","author":"wang","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2281428"},{"key":"ref28","article-title":"The AR face database","volume":"24","author":"martinez","year":"1998"},{"key":"ref4","first-page":"385","article-title":"Learning a locality preserving subspace for visual recognition","author":"he","year":"2003","journal-title":"Proc 9th Int Conf Comput Vis"},{"key":"ref27","author":"sun","year":"2006","journal-title":"Optimization Theory and Methods"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.250598"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/34.927464"},{"key":"ref5","first-page":"1208","article-title":"Neighborhood preserving embedding","author":"he","year":"2005","journal-title":"Proc 10th IEEE Int Conf Comput Vis"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/TNNLS.2014.2312535","article-title":"Efficient $\\iota _{1}$ -norm-based low-rank matrix approximations for large-scale problems using alternating rectified gradient method","volume":"26","author":"kim","year":"2015","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.19"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1904-8","author":"jolliffe","year":"1986","journal-title":"Principal Component Analysis"},{"key":"ref9","first-page":"1","article-title":"Block-wise constrained sparse graph for face image representation","author":"zhao","year":"2015","journal-title":"Proc IEEE Int Conf on Auto Face and Gesture Recog"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.29"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2303798"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2448637"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382983"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(02)00207-6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2011.2178037"},{"key":"ref26","first-page":"1","article-title":"Structured sparse principal component analysis","author":"jenatton","year":"2010","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood estimation from incomplete data via the EM algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"J Roy Statist Soc B"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8301440\/07801864.pdf?arnumber=7801864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:53:27Z","timestamp":1718978007000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7801864\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":30,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2016.2636130","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}