{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:04Z","timestamp":1740131704827,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1109\/tcomm.2019.2957080","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T20:19:43Z","timestamp":1575317983000},"page":"987-997","source":"Crossref","is-referenced-by-count":1,"title":["Structure Learning of Sparse GGMs Over Multiple Access Networks"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0662-0115","authenticated-orcid":false,"given":"Mostafa","family":"Tavassolipour","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9323-5161","authenticated-orcid":false,"given":"Armin","family":"Karamzade","sequence":"additional","affiliation":[]},{"given":"Reza","family":"Mirzaeifard","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7639-0362","authenticated-orcid":false,"given":"Seyed Abolfazl","family":"Motahari","sequence":"additional","affiliation":[]},{"given":"Mohammad-Taghi","family":"Manzuri Shalmani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807213"},{"key":"ref38","first-page":"485","article-title":"Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data","volume":"9","author":"banerjee","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2172430"},{"key":"ref32","first-page":"39","article-title":"Distributed learning of Gaussian graphical models via marginal likelihoods","author":"meng","year":"2013","journal-title":"Proc 16th Int Conf Artif Intell Statist"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00023"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2940119"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177704254"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2007.09.014"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2876325"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2016.7551705"},{"key":"ref10","article-title":"Precision matrix estimation with noisy and missing data","author":"fan","year":"2019","journal-title":"arXiv 1904 03548"},{"key":"ref11","article-title":"Robust estimation of tree structured Gaussian graphical model","author":"katiyar","year":"2019","journal-title":"arXiv 1901 08770"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/cjs.11356"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2011.00771.x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1201\/b18401"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000000281"},{"key":"ref18","first-page":"2911","article-title":"QUIC: Quadratic approximation for sparse inverse covariance estimation","volume":"15","author":"hsieh","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/15-EJS1031"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2906207"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3389\/fninf.2018.00058"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2646342"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772790"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.csl.2008.11.001"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2652385"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783391"},{"key":"ref8","article-title":"Large-scale sparse inverse covariance estimation via thresholding and max-det matrix completion","author":"zhang","year":"2018","journal-title":"arXiv 1802 04911"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/17M1147615"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2008.12.004"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1588"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2014.02.011"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/11-EJS631"},{"key":"ref22","first-page":"2293","article-title":"High-dimensional Gaussian graphical model selection: Walk summability and local separation criterion","volume":"13","author":"anandkumar","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref21","first-page":"3943","article-title":"Equivalence of graphical lasso and thresholding forsparse graphs","volume":"17","author":"sojoudi","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref24","first-page":"1617","article-title":"Learning high-dimensional Markov forest distributions: Analysis of error rates","volume":"12","author":"tan","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"ref26","first-page":"2328","article-title":"Information-theoretic lower bounds for distributed statistical estimation with communication constraints","author":"zhang","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104513"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/8999755\/08918445.pdf?arnumber=8918445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:47:23Z","timestamp":1651067243000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8918445\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":39,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2019.2957080","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2020,2]]}}}