{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T05:23:30Z","timestamp":1782278610097,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T00:00:00Z","timestamp":1501804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA","award":["XDATA"],"award-info":[{"award-number":["XDATA"]}]},{"name":"DARPA","award":["SIMPLEX"],"award-info":[{"award-number":["SIMPLEX"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1149837"],"award-info":[{"award-number":["IIS-1149837"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NIH","award":["BD2K"],"award-info":[{"award-number":["BD2K"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,4]]},"DOI":"10.1145\/3097983.3098037","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"205-213","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":144,"title":["Network Inference via the Time-Varying Graphical Lasso"],"prefix":"10.1145","author":[{"given":"David","family":"Hallac","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youngsuk","family":"Park","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Boyd","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jure","family":"Leskovec","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0901910106"},{"key":"e_1_3_2_2_2_1","volume-title":"JMLR","author":"Banerjee O.","year":"2008","unstructured":"O. Banerjee , L. El Ghaoui , and A. d' Aspremont . Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data . JMLR , 2008 . O. Banerjee, L. El Ghaoui, and A. d'Aspremont. Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data. JMLR, 2008."},{"key":"e_1_3_2_2_3_1","volume-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine learning","author":"Boyd S.","year":"2011","unstructured":"S. Boyd , N. Parikh , E. Chu , B. Peleato , and J. Eckstein . Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine learning , 2011 . S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine learning, 2011."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_3_2_2_5_1","volume-title":"Proc. Eur. Conf. Op. Res","author":"Dahl J.","year":"2006","unstructured":"J. Dahl and L. Vandenberghe . CVXOPT: A Python package for convex optimization . In Proc. Eur. Conf. Op. Res , 2006 . J. Dahl and L. Vandenberghe. CVXOPT: A Python package for convex optimization. In Proc. Eur. Conf. Op. Res, 2006."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12033"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835933"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04898-2_321"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783313"},{"key":"e_1_3_2_2_11_1","volume-title":"JMLR (To Appear)","author":"Hallac D.","year":"2017","unstructured":"D. Hallac , C. Wong , S. Diamond , R. Sosivc , S. Boyd , and J. Leskovec . SnapVX: A network-based convex optimization solver . JMLR (To Appear) , 2017 . D. Hallac, C. Wong, S. Diamond, R. Sosivc, S. Boyd, and J. Leskovec. SnapVX: A network-based convex optimization solver. JMLR (To Appear), 2017."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"e_1_3_2_2_14_1","volume-title":"NIPS","author":"Hsieh C.-J.","year":"2013","unstructured":"C.-J. Hsieh , M. A. Sustik , I. S. Dhillon , P. K. Ravikumar , and R. Poldrack . BIG & QUIC: Sparse inverse covariance estimation for a million variables . In NIPS , 2013 . C.-J. Hsieh, M. A. Sustik, I. S. Dhillon, P. K. Ravikumar, and R. Poldrack. BIG & QUIC: Sparse inverse covariance estimation for a million variables. In NIPS, 2013."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOAS308"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1795555"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical models","author":"Lauritzen S. L.","year":"1996","unstructured":"S. L. Lauritzen . Graphical models . Clarendon Press , 1996 . S. L. Lauritzen. Graphical models. Clarendon Press, 1996."},{"key":"e_1_3_2_2_18_1","volume-title":"NIPS","author":"Mohan K.","year":"2012","unstructured":"K. Mohan , M. Chung , S. Han , D. Witten , S.-I. Lee , and M. Fazel . Structured learning of Gaussian graphical models . In NIPS , 2012 . K. Mohan, M. Chung, S. Han, D. Witten, S.-I. Lee, and M. Fazel. Structured learning of Gaussian graphical models. In NIPS, 2012."},{"key":"e_1_3_2_2_19_1","volume-title":"JMLR","author":"Mohan K.","year":"2014","unstructured":"K. Mohan , P. London , M. Fazel , D. Witten , and S.-I. Lee . Node-based learning of multiple Gaussian graphical models . JMLR , 2014 . K. Mohan, P. London, M. Fazel, D. Witten, and S.-I. Lee. Node-based learning of multiple Gaussian graphical models. JMLR, 2014."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294246"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2014.07.033"},{"key":"e_1_3_2_2_22_1","volume-title":"NIPS","author":"Myers S.","year":"2010","unstructured":"S. Myers and J. Leskovec . On the convexity of latent social network inference . In NIPS , 2010 . S. Myers and J. Leskovec. On the convexity of latent social network inference. In NIPS, 2010."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.06.033"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0892-3"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1201\/9780203492024"},{"key":"e_1_3_2_2_27_1","volume-title":"NIPS","author":"Scheinberg K.","year":"2010","unstructured":"K. Scheinberg , S. Ma , and D. Goldfarb . Sparse inverse covariance selection via alternating linearization methods . In NIPS , 2010 . K. Scheinberg, S. Ma, and D. Goldfarb. Sparse inverse covariance selection via alternating linearization methods. In NIPS, 2010."},{"key":"e_1_3_2_2_28_1","unstructured":"L. Vanderberghe. Proximal mapping lecture notes. http:\/\/seas.ucla.edu\/ vandenbe\/236C\/lectures\/proxop.pdf 2010. L. Vanderberghe. Proximal mapping lecture notes. http:\/\/seas.ucla.edu\/ vandenbe\/236C\/lectures\/proxop.pdf 2010."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.874409"},{"key":"e_1_3_2_2_30_1","volume-title":"NIPS","author":"Weinberger K.","year":"2006","unstructured":"K. Weinberger , F. Sha , Q. Zhu , and L. Saul . Graph Laplacian regularization for large-scale semidefinite programming . In NIPS , 2006 . K. Weinberger, F. Sha, Q. Zhu, and L. Saul. Graph Laplacian regularization for large-scale semidefinite programming. In NIPS, 2006."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-16-S6-S5"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2009.00699.x"},{"key":"e_1_3_2_2_33_1","volume-title":"ICML","author":"Wytock M.","year":"2013","unstructured":"M. Wytock and J. Z. Kolter . Sparse Gaussian conditional random fields: Algorithms, theory, and application to energy forecasting . ICML , 2013 . M. Wytock and J. Z. Kolter. Sparse Gaussian conditional random fields: Algorithms, theory, and application to energy forecasting. ICML, 2013."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/130936397"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asm018"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5180-0"}],"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.3098037","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098037","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:25Z","timestamp":1750217425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,4]]},"references-count":36,"alternative-id":["10.1145\/3097983.3098037","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098037","relation":{},"subject":[],"published":{"date-parts":[[2017,8,4]]},"assertion":[{"value":"2017-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}