{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:25:49Z","timestamp":1772760349484,"version":"3.50.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":["11671010"],"award-info":[{"award-number":["11671010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071475"],"award-info":[{"award-number":["12071475"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["4172035"],"award-info":[{"award-number":["4172035"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tpami.2021.3071138","type":"journal-article","created":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T20:03:56Z","timestamp":1617739436000},"page":"1-1","source":"Crossref","is-referenced-by-count":17,"title":["A safe feature elimination rule for L1-regularized logistic regression"],"prefix":"10.1109","author":[{"given":"Xianli","family":"Pan","sequence":"first","affiliation":[{"name":"College of Science, China Agricultural University, 34752 Beijing, Beijing, China, (e-mail: pxlcjs@cau.edu.cn)"}]},{"given":"Yitian","family":"Xu","sequence":"additional","affiliation":[{"name":"College of Science, China Agricultural University, 34752 Beijing, Beijing, China, (e-mail: xytshuxue@126.com)"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v033.i01"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref33","article-title":"Screening rules for convex problems","author":"raj","year":"2016"},{"key":"ref32","first-page":"6","article-title":"A dynamic screening principle for the Lasso","author":"bonnefoy","year":"2014","journal-title":"Proc 22nd Eur Signal Process Conf"},{"key":"ref31","first-page":"333","article-title":"Mind the duality GAP: Safer rules for the Lasso","author":"fercoq","year":"2015","journal-title":"Proc 32nd Int Conf Mach Learn"},{"key":"ref30","first-page":"811","article-title":"GAP safe screening rules for sparse multi-task and multi-class models","author":"ndiaye","year":"2015","journal-title":"Proc 28th Int Conf Adv Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.10.031"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2765321"},{"key":"ref35","first-page":"1171","article-title":"Blitz: A principled meta-algorithm for scaling sparse optimization","author":"johnson","year":"2015","journal-title":"Proc 32nd Int Conf Mach Learn"},{"key":"ref34","first-page":"1","article-title":"GAP safe screening rules for sparsity enforcing penalties","volume":"18","author":"ndiaye","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1198\/004017007000000245"},{"key":"ref11","first-page":"401","article-title":"Efficient $L_1$L1-regularized logistic regression","author":"lee","year":"2006","journal-title":"Proc Assoc Adv Artif Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2007.00607.x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1988.10478694"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.222"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2269765"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2347372"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288334"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2388203"},{"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":"ref28","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2011.01004.x"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1109\/TKDE.2008.166","article-title":"Distributional features for text categorization","volume":"21","author":"xue","year":"2009","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref3","first-page":"289","article-title":"Privacy-preserving logistic regression","author":"kamalika","year":"2008","journal-title":"Proc 21st Int Conf Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl386"},{"key":"ref29","first-page":"1053","article-title":"A safe screening rule for sparse logistic regression","author":"wang","year":"2014","journal-title":"Proc 27th Int Conf Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2362771"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910971"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ssci.2008.01.002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2279-5"},{"key":"ref9","first-page":"627","article-title":"Trust region Newton method for logistic regression","volume":"9","author":"lin","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29150-4","author":"kleinbaum","year":"2005","journal-title":"Logistic Regression Statistics for Biology and Health"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2568185"},{"key":"ref22","first-page":"523","article-title":"Scaling SVM and least absolute deviations via exact data reduction","volume":"32","author":"wang","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref21","first-page":"900","article-title":"Learning sparse representations of high dimensional data on large scale dictionaries","author":"xiang","year":"2011","journal-title":"Proc 24th Int Conf Neural Inf Process Syst"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.01.083"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2688182"},{"key":"ref26","first-page":"667","article-title":"Safe feature elimination in sparse supervised learning","volume":"8","author":"ghaoui","year":"2012","journal-title":"Pac J Optim"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2776267"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/09397291.pdf?arnumber=9397291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T22:48:22Z","timestamp":1663886902000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9397291\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/tpami.2021.3071138","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}