{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:54:18Z","timestamp":1770274458725,"version":"3.49.0"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:00:00Z","timestamp":1675209600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"MEXT KAKENHI","award":["17H00758"],"award-info":[{"award-number":["17H00758"]}]},{"name":"MEXT KAKENHI","award":["16H06538"],"award-info":[{"award-number":["16H06538"]}]},{"name":"JST CREST","award":["JPMJCR1502"],"award-info":[{"award-number":["JPMJCR1502"]}]},{"name":"JST\/AIP Accelerated PRISM Research","award":["JPMJCR18ZF"],"award-info":[{"award-number":["JPMJCR18ZF"]}]},{"name":"RIKEN Center for Advanced Intelligence Project"},{"name":"JST support program for starting up innovation-hub on materials research"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2023,2,1]]},"DOI":"10.1109\/tpami.2022.3167993","type":"journal-article","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T19:37:49Z","timestamp":1651001869000},"page":"2330-2343","source":"Crossref","is-referenced-by-count":9,"title":["Safe RuleFit: Learning Optimal Sparse Rule Model by Meta Safe Screening"],"prefix":"10.1109","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9077-3589","authenticated-orcid":false,"given":"Hiroki","family":"Kato","sequence":"first","affiliation":[{"name":"Department of Computer Science, Nagoya Institute of Technology, Nagoya, Aichi, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2139-3857","authenticated-orcid":false,"given":"Hiroyuki","family":"Hanada","sequence":"additional","affiliation":[{"name":"Center for Advanced Intelligence Project, RIKEN, Chuo, Tokyo, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1366-1946","authenticated-orcid":false,"given":"Ichiro","family":"Takeuchi","sequence":"additional","affiliation":[{"name":"Center for Advanced Intelligence Project, RIKEN, Chuo, Tokyo, Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS148"},{"key":"ref2","first-page":"8","article-title":"Explanation and justification in machine learning: A survey","volume-title":"Proc. Int. Joint Conf. Artif. Intell. Workshop Explainable AI","author":"Biran"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/electronics8080832"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000015"},{"issue":"4","key":"ref6","first-page":"667","article-title":"Safe feature elimination for the LASSO and sparse supervised learning problems","volume":"8","author":"El Ghaoui","year":"2012","journal-title":"Pacific J. Optim."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2012.681250"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390185"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69731-2_52"},{"key":"ref10","first-page":"2367","article-title":"Multi-target regression with rule ensembles","volume":"13","author":"Aho","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/15-aoas848"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623648"},{"key":"ref13","first-page":"1059","article-title":"Rule-enhanced penalized regression by column generation using rectangular maximum agreement","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Eckstein"},{"key":"ref14","first-page":"6687","article-title":"Generalized linear rule models","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Wei"},{"key":"ref15","first-page":"1070","article-title":"Lasso screening rules via dual polytope projection","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref16","first-page":"289","article-title":"Safe screening with variational inequalities and its application to Lasso","volume-title":"Proc. 31st Int. Conf. Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2568185"},{"key":"ref18","first-page":"1053","article-title":"A safe screening rule for sparse logistic regression","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref19","first-page":"6","article-title":"A dynamic screening principle for the Lasso","volume-title":"Proc. 22nd Eur. Signal Process. Conf.","author":"Bonnefoy"},{"key":"ref20","first-page":"333","article-title":"Mind the duality gap: Safer rules for the Lasso","volume-title":"Proc. 32nd Int. Conf. Mach. Learn.","author":"Fercoq"},{"key":"ref21","first-page":"811","article-title":"Gap safe screening rules for sparse multi-task and multi-class models","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ndiaye"},{"key":"ref22","first-page":"388","article-title":"Gap safe screening rules for sparse-group Lasso","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ndiaye"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939844"},{"key":"ref24","first-page":"543","article-title":"Tree-guided group Lasso for multi-task regression with structured sparsity","volume-title":"Proc. 27th Int. Conf. Int. Conf. Mach. Learn.","author":"Kim"},{"key":"ref25","first-page":"2132","article-title":"Two-layer feature reduction for sparse-group lasso via decomposition of convex sets","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref26","first-page":"1279","article-title":"Multi-layer feature reduction for tree structured group lasso via hierarchical projection","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref28","first-page":"1342","article-title":"Revisiting numerical pattern mining with formal concept analysis","volume-title":"Proc. 22nd Int. Joint Conf. Artif. Intell.","author":"Kaytoue"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07821-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0170-0"},{"key":"ref32","first-page":"15","article-title":"A new vector norm for nonlinear curve fitting and some other optimization problems. 33","volume-title":"Proc. Int. Wiss. Kolloq. Fortragsreihe\u201d Mathematische Optimierung| Theorie Anwendungen","author":"Burdakov"},{"key":"ref33","article-title":"On a new norm for data fitting and optimization problems","author":"Burdakov","year":"2001"},{"key":"ref34","article-title":"UCI machine learning repository","author":"Dheeru","year":"2017"},{"issue":"1","key":"ref35","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random forests","volume":"45","author":"Breiman","year":"2001","journal-title":"Mach. Learn."},{"key":"ref36","first-page":"2825","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn Res."}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/10008914\/09762967.pdf?arnumber=9762967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:44:30Z","timestamp":1706060670000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9762967\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,1]]},"references-count":36,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2022.3167993","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":[[2023,2,1]]}}}