{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:26:07Z","timestamp":1772760367086,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"15","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"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"}]},{"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"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2019,8,1]]},"DOI":"10.1109\/tsp.2019.2924580","type":"journal-article","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T16:36:19Z","timestamp":1561480579000},"page":"4043-4054","source":"Crossref","is-referenced-by-count":13,"title":["Simultaneous Safe Feature and Sample Elimination for Sparse Support Vector Regression"],"prefix":"10.1109","volume":"67","author":[{"given":"Hongmei","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5957-0444","authenticated-orcid":false,"given":"Xianli","family":"Pan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7577-4420","authenticated-orcid":false,"given":"Yitian","family":"Xu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"4016","article-title":"Scaling up sparse support vector machines by simultaneous feature and sample reduction","author":"zhang","year":"0","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref38","first-page":"1577","article-title":"Simultaneous safe screening of features and samples in doubly sparse modeling","author":"shibagaki","year":"0","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref33","first-page":"523","article-title":"Scaling SVM and least absolute deviations via exact data reduction","author":"wang","year":"0","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref32","first-page":"1382","article-title":"Safe screening of non-support vectors in pathwise SVM computation","author":"ogawa","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref31","first-page":"1053","article-title":"A safe screening rule for sparse logistic regression","volume":"27","author":"wang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2447503"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.07.008"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.01.083"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2688182"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.10.011"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2301453"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.12.003"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CSB.2003.1227323"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.37"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2013.2258337"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2010.03.005"},{"key":"ref15","first-page":"341","article-title":"A modified finite Newton method for fast solution of large scale linear SVMs","volume":"6","author":"keerthi","year":"2005","journal-title":"J Mach Learn Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2006.873281"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.08.030"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/72.788643"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/72.870050"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288334"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2348012"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2294591"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-141516"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/72.788648"},{"key":"ref29","first-page":"388","article-title":"Gap safe screening rules for sparse-group lasso","volume":"29","author":"ndiaye","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-1599-1_12"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2504348"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2028314"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-013-0220-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/34.683777"},{"key":"ref1","first-page":"281","article-title":"Support vector method for function approximation, regression estimation and signal processing","volume":"9","author":"vapnik","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2709262"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.08.005"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390208"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/252"},{"key":"ref24","first-page":"667","article-title":"Safe feature elimination in sparse supervised learning","volume":"8","author":"ghaoui","year":"2012","journal-title":"Pacific J Optim"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.02.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0839-0"},{"key":"ref26","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":"ref43","first-page":"4754","article-title":"Unified methods for exploiting piecewise linear structure in convex optimization","volume":"29","author":"johnson","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2011.01004.x"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8744445\/08744246.pdf?arnumber=8744246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:49:40Z","timestamp":1657745380000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8744246\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,1]]},"references-count":43,"journal-issue":{"issue":"15"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2019.2924580","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,1]]}}}