{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:40:46Z","timestamp":1764783646648},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1109\/infocom.2014.6848166","type":"proceedings-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T11:18:13Z","timestamp":1406632693000},"page":"2229-2237","source":"Crossref","is-referenced-by-count":6,"title":["Modeling social network relationships via t-cherry junction trees"],"prefix":"10.1109","author":[{"given":"Brian","family":"Proulx","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junshan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.66"},{"journal-title":"Metis 5 1 0 Software","year":"2013","key":"18"},{"key":"15","first-page":"825","article-title":"A backward selection procedure for approximating a discrete probability distribution by decomposable models","author":"malvestuto","year":"2012","journal-title":"Proc Kybernetika"},{"journal-title":"Social Computing Data Repository at ASU","year":"2009","author":"zafarani","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"14","first-page":"128","article-title":"Efficient stepwise selection in decomposable models","author":"deshpande","year":"2001","journal-title":"Proc UAI"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/999188323"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-013-9232-8"},{"key":"21","article-title":"Graphlab: A new parallel framework for machine learning","author":"low","year":"2010","journal-title":"Conference on Uncertainty in Artificial Intelligence (UAI)"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03735-1_3"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.278"},{"journal-title":"Twitter Statistics","year":"2013","key":"2"},{"journal-title":"Facebook Reports First Quarter 2013 Results","year":"2013","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1287\/moor.26.1.174.10596"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35176-1_30"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"5","first-page":"467","article-title":"Loopy belief propagation for approximate inference: An empirical study","author":"murphy","year":"1999","journal-title":"Proceedings of Uncertainty in AI"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0274-x"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0814-y"}],"event":{"name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","start":{"date-parts":[[2014,4,27]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2014,5,2]]}},"container-title":["IEEE INFOCOM 2014 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6839150\/6847911\/06848166.pdf?arnumber=6848166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T13:48:40Z","timestamp":1490276920000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6848166\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/infocom.2014.6848166","relation":{},"subject":[],"published":{"date-parts":[[2014,4]]}}}