{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:20:24Z","timestamp":1740169224759,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Automation and Systems Research Institute ASRI Seoul National University"},{"name":"Brain Korea 21 BK21 FOUR Program of the Education and Research Program for Future Information and Communication Technology ICT Pioneers Seoul National University"},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["Ministry of Education, Science, and Technology (20"],"award-info":[{"award-number":["Ministry of Education, Science, and Technology (20"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["MURI 133668-5079809","MURI Award 58153-MA-MUR"],"award-info":[{"award-number":["MURI 133668-5079809","MURI Award 58153-MA-MUR"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3070490","type":"journal-article","created":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T19:43:37Z","timestamp":1617306217000},"page":"54032-54055","source":"Crossref","is-referenced-by-count":0,"title":["Partition-Merge: Distributed Inference and Modularity Optimization"],"prefix":"10.1109","volume":"9","author":[{"given":"Vincent","family":"Blondel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyomin","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pushmeet","family":"Kohli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0737-3259","authenticated-orcid":false,"given":"Devavrat","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3557-4157","authenticated-orcid":false,"given":"Seungpil","family":"Won","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238226"},{"key":"ref32","article-title":"On the complexity of Newman’s community finding approach for biological and social networks","author":"dasgupta","year":"2011","journal-title":"arXiv 1102 0969"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/103\/28003"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.4000\/brussels.806"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69311-6_19"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062049"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.200"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"girvan","year":"2002","journal-title":"Proc Nat Acad Sci USA"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63504"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167261"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.77"},{"key":"ref18","first-page":"1","article-title":"Local algorithms for approximate inference in minor-excluded graphs","author":"jung","year":"2007","journal-title":"Proc Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90084-W"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.58.86"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/080744888"},{"key":"ref27","first-page":"1","article-title":"Dynamic tree block coordinate ascent","author":"tarlow","year":"2011","journal-title":"Proc ICML"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.10.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.95"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","article-title":"Modularity and community structure in networks","volume":"103","author":"newman","year":"2006","journal-title":"Proc Nat Acad Sci USA"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389745"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487696"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"ref2","first-page":"3240","article-title":"Fast lifted map inference via partitioning","author":"sarkhel","year":"2015","journal-title":"Proc Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389142"},{"key":"ref1","first-page":"871","article-title":"Local rules for global map: When do they work?","volume":"22","author":"jung","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"article-title":"Generalized belief propagation","year":"2000","author":"yedidia","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523648"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref24","first-page":"195","article-title":"Loopy belief propagation for bipartite maximum weight B-matching","author":"huang","year":"2007","journal-title":"Proc Artif Intell Statist (AISTATS)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915695"},{"key":"ref26","first-page":"544","article-title":"Tree block coordinate descent for map in graphical models","volume":"5","author":"sontag","year":"2009","journal-title":"J Mach Learn Res -Proc Track"},{"key":"ref25","first-page":"4822","article-title":"Message passing for maximum weight independent set","author":"sanghavi","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09393375.pdf?arnumber=9393375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T11:26:24Z","timestamp":1643196384000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9393375\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3070490","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}