{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T14:20:29Z","timestamp":1790432429301,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T00:00:00Z","timestamp":1471046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001695","name":"Japan Science and Technology Corporation","doi-asserted-by":"publisher","award":["CREST15656320"],"award-info":[{"award-number":["CREST15656320"]}],"id":[{"id":"10.13039\/501100001695","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["KAKENHI 26280083, 26730120, 16H00886"],"award-info":[{"award-number":["KAKENHI 26280083, 26730120, 16H00886"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939844","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T18:33:46Z","timestamp":1470681226000},"page":"1785-1794","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Safe Pattern Pruning"],"prefix":"10.1145","author":[{"given":"Kazuya","family":"Nakagawa","sequence":"first","affiliation":[{"name":"Nagoya Institute of Technology, Nagoya, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shinya","family":"Suzumura","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology, Nagoya, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masayuki","family":"Karasuyama","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology, Nagoya, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Koji","family":"Tsuda","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ichiro","family":"Takeuchi","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology, Nagoya, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"6","volume-title":"Signal Processing Conference (EUSIPCO), 2014 Proceedings of the 22nd European","author":"Bonnefoy A.","year":"2014","unstructured":"A. Bonnefoy , V. Emiya , L. Ralaivola , and R. Gribonval . A dynamic screening principle for the lasso . In Signal Processing Conference (EUSIPCO), 2014 Proceedings of the 22nd European , pages 6 -- 10 . IEEE, 2014 . A. Bonnefoy, V. Emiya, L. Ralaivola, and R. Gribonval. A dynamic screening principle for the lasso. In Signal Processing Conference (EUSIPCO), 2014 Proceedings of the 22nd European, pages 6--10. IEEE, 2014."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012470815092"},{"issue":"4","key":"e_1_3_2_1_5_1","first-page":"667","article-title":"Safe feature elimination for the lasso and sparse supervised learning problems","volume":"8","author":"El Ghaoui L.","year":"2012","unstructured":"L. El Ghaoui , V. Viallon , and T. Rabbani . Safe feature elimination for the lasso and sparse supervised learning problems . Pacific Journal of Optimization , 8 ( 4 ): 667 -- 698 , 2012 . L. El Ghaoui, V. Viallon, and T. Rabbani. Safe feature elimination for the lasso and sparse supervised learning problems. Pacific Journal of Optimization, 8(4):667--698, 2012.","journal-title":"Pacific Journal of Optimization"},{"key":"e_1_3_2_1_6_1","first-page":"333","volume-title":"Proceedings of the 32nd International Conference on Machine Learning","author":"Fercoq O.","year":"2015","unstructured":"O. Fercoq , A. Gramfort , and J. Salmon . Mind the duality gap: safer rules for the lasso . In Proceedings of the 32nd International Conference on Machine Learning , pages 333 -- 342 , 2015 . O. Fercoq, A. Gramfort, and J. Salmon. Mind the duality gap: safer rules for the lasso. In Proceedings of the 32nd International Conference on Machine Learning, pages 333--342, 2015."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150429"},{"key":"e_1_3_2_1_8_1","first-page":"729","volume-title":"Advances in neural information processing systems","author":"Kudo T.","year":"2004","unstructured":"T. Kudo , E. Maeda , and Y. Matsumoto . An application of boosting to graph classification . In Advances in neural information processing systems , pages 729 -- 736 , 2004 . T. Kudo, E. Maeda, and Y. Matsumoto. An application of boosting to graph classification. In Advances in neural information processing systems, pages 729--736, 2004."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 31st International Conference on Machine Learning","author":"Liu J.","year":"2014","unstructured":"J. Liu , Z. Zhao , J. Wang , and J. Ye . Safe Screening with Variational Inequalities and Its Application to Lasso . In Proceedings of the 31st International Conference on Machine Learning , 2014 . J. Liu, Z. Zhao, J. Wang, and J. Ye. Safe Screening with Variational Inequalities and Its Application to Lasso. In Proceedings of the 31st International Conference on Machine Learning, 2014."},{"key":"e_1_3_2_1_10_1","first-page":"811","volume-title":"Advances in Neural Information Processing Systems","author":"Ndiaye E.","year":"2015","unstructured":"E. Ndiaye , O. Fercoq , A. Gramfort , and J. Salmon . Gap safe screening rules for sparse multi-task and multi-class models . In Advances in Neural Information Processing Systems , pages 811 -- 819 , 2015 . E. Ndiaye, O. Fercoq, A. Gramfort, and J. Salmon. Gap safe screening rules for sparse multi-task and multi-class models. In Advances in Neural Information Processing Systems, pages 811--819, 2015."},{"key":"e_1_3_2_1_11_1","volume-title":"L1-regularization path algorithm for generalized linear models. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 69(4):659--677","author":"Park M. Y.","year":"2007","unstructured":"M. Y. Park and T. Hastie . L1-regularization path algorithm for generalized linear models. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 69(4):659--677 , 2007 . M. Y. Park and T. Hastie. L1-regularization path algorithm for generalized linear models. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 69(4):659--677, 2007."},{"key":"e_1_3_2_1_12_1","first-page":"85","volume-title":"International workshop on mining and learning with graphs (MLG)","author":"Saigo H.","year":"2006","unstructured":"H. Saigo , T. Kadowaki , and K. Tsuda . A linear programming approach for molecular qsar analysis . In International workshop on mining and learning with graphs (MLG) , pages 85 -- 96 . Citeseer , 2006 . H. Saigo, T. Kadowaki, and K. Tsuda. A linear programming approach for molecular qsar analysis. In International workshop on mining and learning with graphs (MLG), pages 85--96. Citeseer, 2006."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5089-z"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm353"},{"key":"e_1_3_2_1_15_1","volume-title":"Selective inference approach for statistically sound predictive pattern mining. arXiv preprint arXiv:1602.04601","author":"Suzumura S.","year":"2016","unstructured":"S. Suzumura , K. Nakagawa , M. Sugiyama , K. Tsuda , and I. Takeuchi . Selective inference approach for statistically sound predictive pattern mining. arXiv preprint arXiv:1602.04601 , 2016 . S. Suzumura, K. Nakagawa, M. Sugiyama, K. Tsuda, and I. Takeuchi. Selective inference approach for statistically sound predictive pattern mining. arXiv preprint arXiv:1602.04601, 2016."},{"key":"e_1_3_2_1_16_1","volume-title":"A coordinate gradient descent method for nonsmooth separable minimization. Mathematical Programming, 117(1--2):387--423","author":"Tseng P.","year":"2009","unstructured":"P. Tseng and S. Yun . A coordinate gradient descent method for nonsmooth separable minimization. Mathematical Programming, 117(1--2):387--423 , 2009 . P. Tseng and S. Yun. A coordinate gradient descent method for nonsmooth separable minimization. Mathematical Programming, 117(1--2):387--423, 2009."},{"key":"e_1_3_2_1_17_1","first-page":"1053","volume-title":"Advances in Neural Information Processing Systems","author":"Wang J.","year":"2014","unstructured":"J. Wang , J. Zhou , J. Liu , P. Wonka , and J. Ye . A safe screening rule for sparse logistic regression . In Advances in Neural Information Processing Systems , pages 1053 -- 1061 , 2014 . J. Wang, J. Zhou, J. Liu, P. Wonka, and J. Ye. A safe screening rule for sparse logistic regression. In Advances in Neural Information Processing Systems, pages 1053--1061, 2014."},{"key":"e_1_3_2_1_18_1","first-page":"1070","volume-title":"Advances in Neural Information Processing Systems","author":"Wang J.","year":"2013","unstructured":"J. Wang , J. Zhou , P. Wonka , and J. Ye . Lasso screening rules via dual polytope projection . In Advances in Neural Information Processing Systems , pages 1070 -- 1078 , 2013 . J. Wang, J. Zhou, P. Wonka, and J. Ye. Lasso screening rules via dual polytope projection. In Advances in Neural Information Processing Systems, pages 1070--1078, 2013."},{"key":"e_1_3_2_1_19_1","volume-title":"Screening tests for lasso problems. arXiv preprint arXiv:1405.4897","author":"Xiang Z. J.","year":"2014","unstructured":"Z. J. Xiang , Y. Wang , and P. J. Ramadge . Screening tests for lasso problems. arXiv preprint arXiv:1405.4897 , 2014 . Z. J. Xiang, Y. Wang, and P. J. Ramadge. Screening tests for lasso problems. arXiv preprint arXiv:1405.4897, 2014."},{"key":"e_1_3_2_1_20_1","first-page":"900","volume-title":"Advances in Neural Information Processing Systems","author":"Xiang Z. J.","year":"2011","unstructured":"Z. J. Xiang , H. Xu , and P. J. Ramadge . Learning sparse representations of high dimensional data on large scale dictionaries . In Advances in Neural Information Processing Systems , pages 900 -- 908 , 2011 . Z. J. Xiang, H. Xu, and P. J. Ramadge. Learning sparse representations of high dimensional data on large scale dictionaries. In Advances in Neural Information Processing Systems, pages 900--908, 2011."},{"key":"e_1_3_2_1_21_1","first-page":"721","volume-title":"Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han . gspan: Graph-based substructure pattern mining . In Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on , pages 721 -- 724 . IEEE, 2002 . X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on, pages 721--724. IEEE, 2002."}],"event":{"name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Francisco California USA","acronym":"KDD '16","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939844","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:31Z","timestamp":1750222591000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939844"}},"subtitle":["An Efficient Approach for Predictive Pattern Mining"],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":21,"alternative-id":["10.1145\/2939672.2939844","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939844","relation":{},"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2016-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}