{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,14]],"date-time":"2024-01-14T00:12:17Z","timestamp":1705191137364},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF) grant","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Ministry of Science and ICT","doi-asserted-by":"publisher","award":["2021R1F1A1063288"],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MSIT under the Information Technology Research Center (ITRC) support program"},{"name":"supervised by the Institute for Information and Communications Technology Planning and Evaluation","award":["IITP-2021-2020-0-01789"]},{"name":"BK21 FOUR Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1109\/tnet.2022.3141128","type":"journal-article","created":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T20:30:09Z","timestamp":1642624209000},"page":"1382-1394","source":"Crossref","is-referenced-by-count":0,"title":["On Cost-Efficient Learning of Data Dependency"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7314-0739","authenticated-orcid":false,"given":"Hyeryung","family":"Jang","sequence":"first","affiliation":[{"name":"Department of Artificial Intelligence, Dongguk University, Seoul, South Korea"}]},{"given":"Hyungseok","family":"Song","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6955-3135","authenticated-orcid":false,"given":"Yung","family":"Yi","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3209582.3209600"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2005.1440895"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2365541"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2007.4379670"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2011.0194"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2014.2314512"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.927480"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s13235-010-0004-1"},{"key":"ref9","article-title":"De-anonymization of social networks with communities: When quantifications meet algorithms","volume-title":"arXiv:1703.09028","author":"Fu","year":"2017"},{"key":"ref10","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl","year":"2014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/09-aos691"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"ref14","first-page":"1743","article-title":"Learning factor graphs in polynomial time and sample complexity","volume":"7","author":"Abbeel","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"ref15","article-title":"Learning to communicate with deep multi-agent reinforcement learning","volume-title":"arXiv:1605.06676","author":"Foerster","year":"2016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"ref17","first-page":"1052","article-title":"Learning mixtures of tree graphical models","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Anandkumar"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4739066"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2006.1657816"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2007.910533"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.361598"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843548"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.910585"},{"key":"ref24","first-page":"553","article-title":"Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Globerson"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810642"},{"key":"ref26","first-page":"905","article-title":"Loopy belief propagation: Convergence and effects of message errors","volume":"6","author":"Ihler","year":"2005","journal-title":"J. Mach. Learn. Res."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104513"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746631"},{"key":"ref29","article-title":"On the number of samples needed to learn the correct structure of a Bayesian network","volume-title":"arXiv:1206.6862","author":"Zuk","year":"2012"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557602"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2016.7733005"},{"key":"ref32","first-page":"1771","article-title":"Learning latent tree graphical models","volume":"12","author":"Choi","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref33","article-title":"Residual belief propagation: Informed scheduling for asynchronous message passing","volume-title":"arXiv:1206.6837","author":"Elidan","year":"2012"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.3390\/s20051302"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3209582.3209600"},{"key":"ref36","volume-title":"Computers and Intractability","volume":"29","author":"Garey","year":"2002"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700004432"},{"key":"ref38","volume-title":"Large Deviation Techniques in Decision, Simulation, and Estimation","author":"Bucklew","year":"1990"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1155\/WCN.2005.523"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/INDIN.2013.6622857"},{"key":"ref41","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03311-7","volume-title":"Large Deviations Techniques and Applications, of Stochastic Modelling and Applied Probability","volume":"38","author":"Dembo","year":"2010"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9797041\/09686365.pdf?arnumber=9686365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T22:09:07Z","timestamp":1705183747000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9686365\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":41,"journal-issue":{"issue":"3"},"URL":"http:\/\/dx.doi.org\/10.1109\/tnet.2022.3141128","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6]]}}}
