{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T07:48:50Z","timestamp":1748418530344,"version":"3.40.5"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"National High Technology Research and Development Program of China","award":["2014AA015103"],"award-info":[{"award-number":["2014AA015103"]}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["4152023"],"award-info":[{"award-number":["4152023"]}],"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":["61473006"],"award-info":[{"award-number":["61473006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science and Technology","award":["2014BAG01B02"],"award-info":[{"award-number":["2014BAG01B02"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,8,1]]},"DOI":"10.1109\/tkde.2015.2407358","type":"journal-article","created":{"date-parts":[[2015,2,26]],"date-time":"2015-02-26T19:59:11Z","timestamp":1424980751000},"page":"2217-2230","source":"Crossref","is-referenced-by-count":5,"title":["Overlapping Decomposition for Gaussian Graphical Modeling"],"prefix":"10.1109","volume":"27","author":[{"given":"Guojie","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunqing","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.0126"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5180-0"},{"key":"ref30","first-page":"447","article-title":"Multi-task learning of gaussian graphical models","author":"honorio","year":"0","journal-title":"Proc 27th Int Conf Mach Learn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asm018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339551"},{"key":"ref12","first-page":"781","article-title":"Exact covariance thresholding into connected components for large-scale graphical lasso","volume":"13","author":"mazumder","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref13","article-title":"A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning","author":"spielman","year":"2008","journal-title":"arXiv preprint arXiv 0809 3232"},{"key":"ref14","first-page":"2330","article-title":"A divide-and-conquer method for sparse inverse covariance estimation","author":"hsieh","year":"0","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref15","first-page":"3165","article-title":"BIG & QUIC: Sparse inverse covariance estimation for a million variables","author":"hsieh","year":"0","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref16","first-page":"2330","article-title":"Sparse inverse covariance matrix estimation using quadratic approximation","author":"hsieh","year":"0","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref17","first-page":"755","article-title":"Newton-like methods for sparse inverse covariance estimation","author":"oztoprak","year":"0","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref18","first-page":"927","article-title":"A block-coordinate descent approach for large-scale sparse inverse covariance estimation","author":"treister","year":"0","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12033"},{"key":"ref28","first-page":"1732","article-title":"Time-varying dynamic bayesian networks","author":"song","year":"0","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1142\/S0219720011005525"},{"key":"ref27","first-page":"1006","article-title":"Sparsistent learning of varying-coefficient models with structural changes","author":"kolar","year":"0","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1126\/science.1094068","article-title":"Inferring cellular networks using probabilistic graphical models","volume":"303","author":"friedman","year":"2004","journal-title":"Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557086"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOAS308"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557151"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281203"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.67"},{"journal-title":"Proc 24th AAAI Conf Artif Intell","year":"0","author":"chen","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"journal-title":"Probabilistic Graphical Models Principles and Techniques","year":"2009","author":"koller","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asq060"},{"journal-title":"Graphical Models in Applied Multivariate Statistics","year":"2009","author":"whittaker","key":"ref22"},{"key":"ref21","first-page":"33","article-title":"Detecting highly overlapping community structure by greedy clique expansion","author":"lee","year":"0","journal-title":"Proc 4th Int Workshop Soc Netw Mining Anal"},{"key":"ref24","first-page":"286","article-title":"Fast optimization methods for L1 regularization: A comparative study and two new approaches","author":"schmidt","year":"2007","journal-title":"Proc 18th Eur Conf Mach Learn"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","author":"lauritzen","year":"1996","journal-title":"Graphical Models"},{"key":"ref26","first-page":"407","article-title":"On time varying undirected graphs","author":"kolar","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/08-EJS176"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7150523\/07050333.pdf?arnumber=7050333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T03:32:51Z","timestamp":1747711971000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7050333\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,1]]},"references-count":33,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2015.2407358","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2015,8,1]]}}}