{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:11:06Z","timestamp":1787317866297,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1618948 and IIS-1652539"],"award-info":[{"award-number":["IIS-1618948 and IIS-1652539"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,13]]},"DOI":"10.1145\/3097983.3098165","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T14:35:54Z","timestamp":1501857354000},"page":"757-766","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Fast Newton Hard Thresholding Pursuit for Sparsity Constrained Nonconvex Optimization"],"prefix":"10.1145","author":[{"given":"Jinghui","family":"Chen","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quanquan","family":"Gu","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Finding approximate local minima for nonconvex optimization in linear time. arXiv preprint arXiv:1611.01146","author":"Agarwal Naman","year":"2016","unstructured":"Naman Agarwal , Zeyuan Allen-Zhu , Brian Bullins , Elad Hazan , and Tengyu Ma . Finding approximate local minima for nonconvex optimization in linear time. arXiv preprint arXiv:1611.01146 ( 2016 ). Naman Agarwal, Zeyuan Allen-Zhu, Brian Bullins, Elad Hazan, and Tengyu Ma. Finding approximate local minima for nonconvex optimization in linear time. arXiv preprint arXiv:1611.01146 (2016)."},{"key":"e_1_3_2_1_2_1","volume-title":"Second Order Stochastic Optimization in Linear Time. arXiv preprint arXiv:1602.03943","author":"Agarwal Naman","year":"2016","unstructured":"Naman Agarwal , Brian Bullins , and Elad Hazan . Second Order Stochastic Optimization in Linear Time. arXiv preprint arXiv:1602.03943 ( 2016 ). Naman Agarwal, Brian Bullins, and Elad Hazan. Second Order Stochastic Optimization in Linear Time. arXiv preprint arXiv:1602.03943 (2016)."},{"key":"e_1_3_2_1_3_1","volume-title":"Variance reduction for faster non-convex optimization. arXiv preprint arXiv:1603.05643","author":"Allen-Zhu Zeyuan","year":"2016","unstructured":"Zeyuan Allen-Zhu and Elad Hazan 2016. Variance reduction for faster non-convex optimization. arXiv preprint arXiv:1603.05643 ( 2016 ). Zeyuan Allen-Zhu and Elad Hazan 2016. Variance reduction for faster non-convex optimization. arXiv preprint arXiv:1603.05643 (2016)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2502607"},{"key":"e_1_3_2_1_5_1","volume-title":"Neural networks for pattern recognition","author":"Bishop Christopher M","unstructured":"Christopher M Bishop . 1995. Neural networks for pattern recognition . Oxford university press . Christopher M Bishop. 1995. Neural networks for pattern recognition. Oxford university press."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"e_1_3_2_1_7_1","volume-title":"Exact and Inexact Subsampled Newton Methods for Optimization. arXiv preprint arXiv:1609.08502","author":"Bollapragada Raghu","year":"2016","unstructured":"Raghu Bollapragada , Richard Byrd , and Jorge Nocedal . 2016. Exact and Inexact Subsampled Newton Methods for Optimization. arXiv preprint arXiv:1609.08502 ( 2016 ). Raghu Bollapragada, Richard Byrd, and Jorge Nocedal. 2016. Exact and Inexact Subsampled Newton Methods for Optimization. arXiv preprint arXiv:1609.08502 (2016)."},{"key":"e_1_3_2_1_8_1","volume-title":"Conference on Uncertainty in Artificial Intelligence.","author":"Chen Jinghui","year":"2016","unstructured":"Jinghui Chen and Quanquan Gu 2016 . Accelerated stochastic block coordinate gradient descent for sparsity constrained nonconvex optimization . In Conference on Uncertainty in Artificial Intelligence. Jinghui Chen and Quanquan Gu 2016. Accelerated stochastic block coordinate gradient descent for sparsity constrained nonconvex optimization. In Conference on Uncertainty in Artificial Intelligence."},{"key":"e_1_3_2_1_9_1","volume-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. In Advances in Neural Information Processing Systems. 1646--1654.","author":"Defazio Aaron","year":"2014","unstructured":"Aaron Defazio , Francis Bach , and Simon Lacoste-Julien . 2014 . SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. In Advances in Neural Information Processing Systems. 1646--1654. Aaron Defazio, Francis Bach, and Simon Lacoste-Julien. 2014. SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. In Advances in Neural Information Processing Systems. 1646--1654."},{"key":"e_1_3_2_1_10_1","unstructured":"Murat A Erdogdu. 2015. Newton-Stein Method: A Second Order Method for GLMs via Stein's Lemma Advances in Neural Information Processing Systems. 1216--1224. Murat A Erdogdu. 2015. Newton-Stein Method: A Second Order Method for GLMs via Stein's Lemma Advances in Neural Information Processing Systems. 1216--1224."},{"key":"e_1_3_2_1_11_1","unstructured":"Murat A Erdogdu and Andrea Montanari 2015. Convergence rates of sub-sampled newton methods. Advances in Neural Information Processing Systems. 3052--3060. Murat A Erdogdu and Andrea Montanari 2015. Convergence rates of sub-sampled newton methods. Advances in Neural Information Processing Systems. 3052--3060."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/100806278"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"e_1_3_2_1_15_1","unstructured":"Quanquan Gu Zhaoran Wang and Han Liu 2014. Sparse pca with oracle property. In Advances in neural information processing systems. 1529--1537. Quanquan Gu Zhaoran Wang and Han Liu 2014. Sparse pca with oracle property. In Advances in neural information processing systems. 1529--1537."},{"key":"e_1_3_2_1_16_1","unstructured":"Prateek Jain Ambuj Tewari and Purushottam Kar. 2014. On Iterative Hard Thresholding Methods for High-dimensional M-Estimation NIPS. 685--693. Prateek Jain Ambuj Tewari and Purushottam Kar. 2014. On Iterative Hard Thresholding Methods for High-dimensional M-Estimation NIPS. 685--693."},{"key":"e_1_3_2_1_17_1","volume-title":"Ravikumar","author":"Jalali Ali","year":"2011","unstructured":"Ali Jalali , Christopher C. Johnson , and Pradeep K . Ravikumar . 2011 . On learning discrete graphical models using greedy methods NIPS. 1935--1943. Ali Jalali, Christopher C. Johnson, and Pradeep K. Ravikumar. 2011. On learning discrete graphical models using greedy methods NIPS. 1935--1943."},{"key":"e_1_3_2_1_18_1","unstructured":"Rie Johnson and Tong Zhang 2013. Accelerating stochastic gradient descent using predictive variance reduction NIPS. 315--323. Rie Johnson and Tong Zhang 2013. Accelerating stochastic gradient descent using predictive variance reduction NIPS. 315--323."},{"key":"e_1_3_2_1_19_1","volume-title":"Predicting risk from financial reports with regression ACL","author":"Kogan Shimon","unstructured":"Shimon Kogan , Dimitry Levin , Bryan R Routledge , Jacob S Sagi , and Noah A Smith 2009. Predicting risk from financial reports with regression ACL . Association for Computational Linguistics , 272--280. Shimon Kogan, Dimitry Levin, Bryan R Routledge, Jacob S Sagi, and Noah A Smith 2009. Predicting risk from financial reports with regression ACL. Association for Computational Linguistics, 272--280."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50048-7"},{"key":"e_1_3_2_1_21_1","volume-title":"AAAI","volume":"6","author":"Lee Su-In","year":"2006","unstructured":"Su-In Lee , Honglak Lee , Pieter Abbeel , and Andrew Y Ng . 2006 . Efficient l 1 regularized logistic regression . AAAI , Vol. Vol. 6 . 401--408. Su-In Lee, Honglak Lee, Pieter Abbeel, and Andrew Y Ng. 2006. Efficient l 1 regularized logistic regression. AAAI, Vol. Vol. 6. 401--408."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005345"},{"key":"e_1_3_2_1_24_1","volume-title":"International Conference on Machine Learning","author":"Li Xingguo","year":"2016","unstructured":"Xingguo Li , Tuo Zhao , Roman Arora , Han Liu , and Jarvis Haupt 2016 . Stochastic variance reduced optimization for nonconvex sparse learning . International Conference on Machine Learning (2016). Xingguo Li, Tuo Zhao, Roman Arora, Han Liu, and Jarvis Haupt 2016. Stochastic variance reduced optimization for nonconvex sparse learning. International Conference on Machine Learning (2016)."},{"key":"e_1_3_2_1_25_1","unstructured":"Po-Ling Loh and Martin J Wainwright 2013. Regularized m-estimators with nonconvexity: Statistical and algorithmic theory for local optima. In NIPS. 476--484. Po-Ling Loh and Martin J Wainwright 2013. Regularized m-estimators with nonconvexity: Statistical and algorithmic theory for local optima. In NIPS. 476--484."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"e_1_3_2_1_27_1","volume-title":"A Linearly-Convergent Stochastic L-BFGS Algorithm. arXiv preprint arXiv:1508.02087","author":"Moritz Philipp","year":"2015","unstructured":"Philipp Moritz , Robert Nishihara , and Michael I Jordan . 2015. A Linearly-Convergent Stochastic L-BFGS Algorithm. arXiv preprint arXiv:1508.02087 ( 2015 ). Philipp Moritz, Robert Nishihara, and Michael I Jordan. 2015. A Linearly-Convergent Stochastic L-BFGS Algorithm. arXiv preprint arXiv:1508.02087 (2015)."},{"key":"e_1_3_2_1_28_1","volume-title":"Stochastic Second-Order Optimization via von Neumann Series. arXiv preprint arXiv:1612.04694","author":"Mutny Mojmir","year":"2016","unstructured":"Mojmir Mutny . 2016. Stochastic Second-Order Optimization via von Neumann Series. arXiv preprint arXiv:1612.04694 ( 2016 ). Mojmir Mutny. 2016. Stochastic Second-Order Optimization via von Neumann Series. arXiv preprint arXiv:1612.04694 (2016)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS850"},{"key":"e_1_3_2_1_31_1","unstructured":"Sahand Negahban Bin Yu Martin J Wainwright and Pradeep K Ravikumar 2009. A unified framework for high-dimensional analysis of $ M $-estimators with decomposable regularizers. In NIPS. 1348--1356. Sahand Negahban Bin Yu Martin J Wainwright and Pradeep K Ravikumar 2009. A unified framework for high-dimensional analysis of $ M $-estimators with decomposable regularizers. In NIPS. 1348--1356."},{"key":"e_1_3_2_1_32_1","volume-title":"Introductory lectures on convex optimization: A basic course","author":"Nesterov Yurii","unstructured":"Yurii Nesterov . 2013. Introductory lectures on convex optimization: A basic course . Vol. Vol. 87 . Springer Science & Business Media . Yurii Nesterov. 2013. Introductory lectures on convex optimization: A basic course. Vol. Vol. 87. Springer Science & Business Media."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"e_1_3_2_1_34_1","volume-title":"Linear convergence of stochastic iterative greedy algorithms with sparse constraints. arXiv preprint arXiv:1407.0088","author":"Nguyen Nam","year":"2014","unstructured":"Nam Nguyen , Deanna Needell , and Tina Woolf . 2014. Linear convergence of stochastic iterative greedy algorithms with sparse constraints. arXiv preprint arXiv:1407.0088 ( 2014 ). Nam Nguyen, Deanna Needell, and Tina Woolf. 2014. Linear convergence of stochastic iterative greedy algorithms with sparse constraints. arXiv preprint arXiv:1407.0088 (2014)."},{"key":"e_1_3_2_1_35_1","volume-title":"Optimal statistical and computational rates for one bit matrix completion Proceedings of the 19th International Conference on Artificial Intelligence and Statistics. 426--434","author":"Ni Renkun","unstructured":"Renkun Ni and Quanquan Gu 2016. Optimal statistical and computational rates for one bit matrix completion Proceedings of the 19th International Conference on Artificial Intelligence and Statistics. 426--434 . Renkun Ni and Quanquan Gu 2016. Optimal statistical and computational rates for one bit matrix completion Proceedings of the 19th International Conference on Artificial Intelligence and Statistics. 426--434."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165799"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2185803"},{"key":"e_1_3_2_1_38_1","volume-title":"Stochastic variance reduction for nonconvex optimization. arXiv preprint arXiv:1603.06160","author":"Reddi Sashank J","year":"2016","unstructured":"Sashank J Reddi , Ahmed Hefny , Suvrit Sra , Barnabas Poczos , and Alex Smola 2016. Stochastic variance reduction for nonconvex optimization. arXiv preprint arXiv:1603.06160 ( 2016 ). Sashank J Reddi, Ahmed Hefny, Suvrit Sra, Barnabas Poczos, and Alex Smola 2016. Stochastic variance reduction for nonconvex optimization. arXiv preprint arXiv:1603.06160 (2016)."},{"key":"e_1_3_2_1_39_1","volume-title":"Sub-Sampled Newton Methods I: Globally Convergent Algorithms. arXiv preprint arXiv:1601.04737","author":"Roosta-Khorasani Farbod","year":"2016","unstructured":"Farbod Roosta-Khorasani and Michael W Mahoney 2016. Sub-Sampled Newton Methods I: Globally Convergent Algorithms. arXiv preprint arXiv:1601.04737 ( 2016 ). Farbod Roosta-Khorasani and Michael W Mahoney 2016. Sub-Sampled Newton Methods I: Globally Convergent Algorithms. arXiv preprint arXiv:1601.04737 (2016)."},{"key":"e_1_3_2_1_40_1","unstructured":"Nicolas L Roux Mark Schmidt and Francis R Bach. 2012. A stochastic gradient method with an exponential convergence _rate for finite training sets Advances in Neural Information Processing Systems. 2663--2671. Nicolas L Roux Mark Schmidt and Francis R Bach. 2012. A stochastic gradient method with an exponential convergence _rate for finite training sets Advances in Neural Information Processing Systems. 2663--2671."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/090759574"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2502598"},{"key":"e_1_3_2_1_43_1","volume-title":"A Tight Bound of Hard Thresholding. arXiv preprint arXiv:1605.01656","author":"Shen Jie","year":"2016","unstructured":"Jie Shen and Ping Li. 2016. A Tight Bound of Hard Thresholding. arXiv preprint arXiv:1605.01656 ( 2016 ). Jie Shen and Ping Li. 2016. A Tight Bound of Hard Thresholding. arXiv preprint arXiv:1605.01656 (2016)."},{"key":"e_1_3_2_1_44_1","volume-title":"Forward backward greedy algorithms for multi-task learning with faster rates Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence","author":"Tian Lu","unstructured":"Lu Tian , Pan Xu , and Quanquan Gu 2016. Forward backward greedy algorithms for multi-task learning with faster rates Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence . AUAI Press , 735--744. Lu Tian, Pan Xu, and Quanquan Gu 2016. Forward backward greedy algorithms for multi-task learning with faster rates Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence. AUAI Press, 735--744."},{"key":"e_1_3_2_1_45_1","series-title":"Series B (Methodological)","volume-title":"Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society","author":"Tibshirani Robert","year":"1996","unstructured":"Robert Tibshirani . 1996. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society . Series B (Methodological) ( 1996 ), 267--288. Robert Tibshirani. 1996. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological) (1996), 267--288."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"e_1_3_2_1_47_1","volume-title":"Precision matrix estimation in high dimensional gaussian graphical models with faster rates Proceedings of the 19th International Conference on Artificial Intelligence and Statistics. 177--185","author":"Wang Lingxiao","unstructured":"Lingxiao Wang , Xiang Ren , and Quanquan Gu 2016. Precision matrix estimation in high dimensional gaussian graphical models with faster rates Proceedings of the 19th International Conference on Artificial Intelligence and Statistics. 177--185 . Lingxiao Wang, Xiang Ren, and Quanquan Gu 2016. Precision matrix estimation in high dimensional gaussian graphical models with faster rates Proceedings of the 19th International Conference on Artificial Intelligence and Statistics. 177--185."},{"key":"e_1_3_2_1_48_1","unstructured":"Pan Xu and Quanquan Gu 2016. Semiparametric Differential Graph Models. In Advances in Neural Information Processing Systems. 1064--1072. Pan Xu and Quanquan Gu 2016. Semiparametric Differential Graph Models. In Advances in Neural Information Processing Systems. 1064--1072."},{"key":"e_1_3_2_1_49_1","unstructured":"Peng Xu Jiyan Yang Farbod Roosta-Khorasani Christopher R\u00e9 and Michael W Mahoney. 2016. Sub-sampled Newton Methods with Non-uniform Sampling Advances in Neural Information Processing Systems. 3000--3008. Peng Xu Jiyan Yang Farbod Roosta-Khorasani Christopher R\u00e9 and Michael W Mahoney. 2016. Sub-sampled Newton Methods with Non-uniform Sampling Advances in Neural Information Processing Systems. 3000--3008."},{"key":"e_1_3_2_1_50_1","volume-title":"A Unifying Framework for Convergence Analysis of Approximate Newton Methods. arXiv preprint arXiv:1702.08124","author":"Ye Haishan","year":"2017","unstructured":"Haishan Ye , Luo Luo , and Zhihua Zhang 2017. A Unifying Framework for Convergence Analysis of Approximate Newton Methods. arXiv preprint arXiv:1702.08124 ( 2017 ). Haishan Ye, Luo Luo, and Zhihua Zhang 2017. A Unifying Framework for Convergence Analysis of Approximate Newton Methods. arXiv preprint arXiv:1702.08124 (2017)."},{"key":"e_1_3_2_1_51_1","volume-title":"Gradient hard thresholding pursuit for sparsity-constrained optimization. arXiv preprint arXiv:1311.5750","author":"Yuan Xiao-Tong","year":"2013","unstructured":"Xiao-Tong Yuan , Ping Li , and Tong Zhang 2013. Gradient hard thresholding pursuit for sparsity-constrained optimization. arXiv preprint arXiv:1311.5750 ( 2013 ). Xiao-Tong Yuan, Ping Li, and Tong Zhang 2013. Gradient hard thresholding pursuit for sparsity-constrained optimization. arXiv preprint arXiv:1311.5750 (2013)."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Xiao-Tong Yuan and Qingshan Liu 2014. Newton Greedy Pursuit: A Quadratic Approximation Method for Sparsity-Constrained Optimization CVPR. 4122--4129. Xiao-Tong Yuan and Qingshan Liu 2014. Newton Greedy Pursuit: A Quadratic Approximation Method for Sparsity-Constrained Optimization CVPR. 4122--4129.","DOI":"10.1109\/CVPR.2014.525"},{"key":"e_1_3_2_1_53_1","volume-title":"Accelerated Stochastic Block Coordinate Descent with Optimal Sampling Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM","author":"Zhang Aston","year":"2016","unstructured":"Aston Zhang and Quanquan Gu 2016 . Accelerated Stochastic Block Coordinate Descent with Optimal Sampling Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM , 2035--2044. Aston Zhang and Quanquan Gu 2016. Accelerated Stochastic Block Coordinate Descent with Optimal Sampling Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2035--2044."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146690"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS659"},{"key":"e_1_3_2_1_57_1","volume-title":"Towards a lower sample complexity for robust one-bit compressed sensing Proceedings of the 32nd International Conference on Machine Learning (ICML-15). 739--747","author":"Zhu Rongda","unstructured":"Rongda Zhu and Quanquan Gu 2015. Towards a lower sample complexity for robust one-bit compressed sensing Proceedings of the 32nd International Conference on Machine Learning (ICML-15). 739--747 . Rongda Zhu and Quanquan Gu 2015. Towards a lower sample complexity for robust one-bit compressed sensing Proceedings of the 32nd International Conference on Machine Learning (ICML-15). 739--747."}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","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 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098165","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098165","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T16:37:50Z","timestamp":1750783070000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,13]]},"references-count":57,"alternative-id":["10.1145\/3097983.3098165","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098165","relation":{},"subject":[],"published":{"date-parts":[[2017,8,13]]},"assertion":[{"value":"2017-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}