{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T11:52:14Z","timestamp":1772625134775,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071022"],"award-info":[{"award-number":["12071022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/lsp.2022.3167918","type":"journal-article","created":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T19:31:34Z","timestamp":1650396694000},"page":"1062-1066","source":"Crossref","is-referenced-by-count":3,"title":["A Safe Feature Screening Rule for Rank Lasso"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8586-5358","authenticated-orcid":false,"given":"Pan","family":"Shang","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Beijing Jiaotong University, Beijing, China"}]},{"given":"Lingchen","family":"Kong","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Beijing Jiaotong University, Beijing, China"}]},{"given":"Dashuai","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Beijing Jiaotong University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2447503"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/9781601984616"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS131"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"issue":"4","key":"ref5","first-page":"667","article-title":"Safe feature elimination in sparse supervised learning","volume":"8","author":"Ghaoui","year":"2012","journal-title":"Pacific J. Optim."},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learnin: Data Mining, Inference and Prediction","author":"Hastie","year":"2009"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1201\/b18401"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177692377"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/EUSIPCO.2015.7362473"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-30528-9_7"},{"issue":"1","key":"ref11","first-page":"4671","article-title":"Gap safe screening rules for sparsity enforcing penalties","volume":"18","author":"Ndiaye","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2776267"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1973.10481436"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3087160"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2020.1840989"},{"key":"ref19","first-page":"1063","article-title":"Lasso screening rules via dual polytope projection","volume":"16","author":"Wang","year":"2015","journal-title":"J. Mach. Learn. Res."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2388203"},{"key":"ref21","first-page":"1","article-title":"Two-layer feature reduction for sparse-group Lasso via decomposition of convex sets","volume":"20","author":"Wang","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2924580"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638268"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asn060"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1111\/j.1541-0420.2008.01099.x"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/9686799\/09759983.pdf?arnumber=9759983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:29:35Z","timestamp":1705958975000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9759983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/lsp.2022.3167918","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}