{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:24Z","timestamp":1750221204152,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T00:00:00Z","timestamp":1529971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,26]]},"DOI":"10.1145\/3209582.3209600","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"171-180","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning Data Dependency with Communication Cost"],"prefix":"10.1145","author":[{"given":"Hyeryung","family":"Jang","sequence":"first","affiliation":[{"name":"Dept. of Informatics, King's College London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HyungSeok","family":"Song","sequence":"additional","affiliation":[{"name":"Dept. of Electrical Engineering, Kaist, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yung","family":"Yi","sequence":"additional","affiliation":[{"name":"Dept. of Electrical Engineering, Kaist, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,26]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1743","article-title":"Learning factor graphs in polynomial time and sample complexity","author":"Abbeel Pieter","year":"2006","unstructured":"Pieter Abbeel , Daphne Koller , and Andrew Y Ng . 2006 . Learning factor graphs in polynomial time and sample complexity . Journal of Machine Learning Research 7 , Aug (2006), 1743 -- 1788 . Pieter Abbeel, Daphne Koller, and Andrew Y Ng. 2006. Learning factor graphs in polynomial time and sample complexity. Journal of Machine Learning Research 7, Aug (2006), 1743--1788.","journal-title":"Journal of Machine Learning Research 7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13235-010-0004-1"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. of Neural Information Processing Systems.","author":"Anandkumar Anima","year":"2012","unstructured":"Anima Anandkumar , Furong Huang , Daniel J Hsu , and Sham M Kakade . 2012 . Learning mixtures of tree graphical models . In Proc. of Neural Information Processing Systems. Anima Anandkumar, Furong Huang, Daniel J Hsu, and Sham M Kakade. 2012. Learning mixtures of tree graphical models. In Proc. of Neural Information Processing Systems."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746631"},{"volume-title":"Large deviation techniques in decision, simulation, and estimation","author":"Bucklew James A","key":"e_1_3_2_1_5_1","unstructured":"James A Bucklew . 1990. Large deviation techniques in decision, simulation, and estimation . Wiley New York . James A Bucklew. 1990. Large deviation techniques in decision, simulation, and estimation. Wiley New York."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.361598"},{"key":"e_1_3_2_1_7_1","unstructured":"Lei Chen Mujdat Cetin and Alan S Willsky. 2005. Distributed data association for multi-target tracking in sensor networks. (2005).  Lei Chen Mujdat Cetin and Alan S Willsky. 2005. Distributed data association for multi-target tracking in sensor networks. (2005)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"volume-title":"Proc. of Uncertainty in Artificial Intelligence","author":"Dasgupta Sanjoy","key":"e_1_3_2_1_9_1","unstructured":"Sanjoy Dasgupta . 1999. Learning polytrees . In Proc. of Uncertainty in Artificial Intelligence . Morgan Kaufmann Publishers Inc . Sanjoy Dasgupta. 1999. Learning polytrees. In Proc. of Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers Inc."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557602"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2014.2314512"},{"key":"e_1_3_2_1_12_1","volume-title":"Residual belief propagation: Informed scheduling for asynchronous message passing. ArXiv preprint arXiv:1206.6837","author":"Elidan Gal","year":"2012","unstructured":"Gal Elidan , Ian McGraw , and Daphne Koller . 2012. Residual belief propagation: Informed scheduling for asynchronous message passing. ArXiv preprint arXiv:1206.6837 ( 2012 ). Gal Elidan, Ian McGraw, and Daphne Koller. 2012. Residual belief propagation: Informed scheduling for asynchronous message passing. ArXiv preprint arXiv:1206.6837 (2012)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"e_1_3_2_1_14_1","volume-title":"Deanonymization of Social Networks with Communities: When Quantifications Meet Algorithms. ArXiv preprint arXiv:1703","author":"Fu Xinzhe","year":"2017","unstructured":"Xinzhe Fu , Zhongzhao Hu , Zhiying Xu , Luoyi Fu , and Xinbing Wang . 2017 . Deanonymization of Social Networks with Communities: When Quantifications Meet Algorithms. ArXiv preprint arXiv:1703 .09028 (2017). Xinzhe Fu, Zhongzhao Hu, Zhiying Xu, Luoyi Fu, and Xinbing Wang. 2017. Deanonymization of Social Networks with Communities: When Quantifications Meet Algorithms. ArXiv preprint arXiv:1703.09028 (2017)."},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of Neural Information Processing Systems.","author":"Globerson Amir","year":"2008","unstructured":"Amir Globerson and Tommi S Jaakkola . 2008 . Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations . In Proc. of Neural Information Processing Systems. Amir Globerson and Tommi S Jaakkola. 2008. Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In Proc. of Neural Information Processing Systems."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843548"},{"key":"e_1_3_2_1_17_1","first-page":"905","article-title":"Loopy belief propagation: Convergence and effects of message errors","author":"Ihler Alexander T","year":"2005","unstructured":"Alexander T Ihler , W Fisher John III, and Alan S Willsky . 2005 . Loopy belief propagation: Convergence and effects of message errors . Journal of Machine Learning Research 6 , May (2005), 905 -- 936 . Alexander T Ihler, W Fisher John III, and Alan S Willsky. 2005. Loopy belief propagation: Convergence and effects of message errors. Journal of Machine Learning Research 6, May (2005), 905--936.","journal-title":"Journal of Machine Learning Research 6"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209582.3209600"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.927480"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. of Neural Information Processing Systems.","author":"Patrick Kreidl O","year":"2006","unstructured":"O Patrick Kreidl and Alan S Willsky . 2006 . Inference with minimal communication: A decision-theoretic variational approach . In Proc. of Neural Information Processing Systems. O Patrick Kreidl and Alan S Willsky. 2006. Inference with minimal communication: A decision-theoretic variational approach. In Proc. of Neural Information Processing Systems."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244301753344605"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2006.1657816"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1147685.1147697"},{"key":"e_1_3_2_1_24_1","unstructured":"Judea Pearl. 2014. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann.  Judea Pearl. 2014. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS691"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700004432"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236360.1236375"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104513"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2011.0194"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.810642"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910585"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2007.910533"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2365541"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2016.7733005"},{"key":"e_1_3_2_1_36_1","volume-title":"On the number of samples needed to learn the correct structure of a Bayesian network. Arxiv preprint arXiv:1206.6862","author":"Zuk Or","year":"2012","unstructured":"Or Zuk , Shiri Margel , and Eytan Domany . 2012. On the number of samples needed to learn the correct structure of a Bayesian network. Arxiv preprint arXiv:1206.6862 ( 2012 ). Or Zuk, Shiri Margel, and Eytan Domany. 2012. On the number of samples needed to learn the correct structure of a Bayesian network. Arxiv preprint arXiv:1206.6862 (2012)."}],"event":{"name":"Mobihoc '18: The Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Los Angeles CA USA","acronym":"Mobihoc '18"},"container-title":["Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209582.3209600","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209582.3209600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:32Z","timestamp":1750210772000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209582.3209600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,26]]},"references-count":36,"alternative-id":["10.1145\/3209582.3209600","10.1145\/3209582"],"URL":"https:\/\/doi.org\/10.1145\/3209582.3209600","relation":{},"subject":[],"published":{"date-parts":[[2018,6,26]]},"assertion":[{"value":"2018-06-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}