{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T10:29:50Z","timestamp":1742639390424,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000002","name":"NIH BD2K","doi-asserted-by":"publisher","award":["1U01CA198943-01"],"award-info":[{"award-number":["1U01CA198943-01"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IOS 1339388","NSF 239 SBC Purdue 41010-38050"],"award-info":[{"award-number":["IOS 1339388","NSF 239 SBC Purdue 41010-38050"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/tnet.2017.2728638","type":"journal-article","created":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T18:25:46Z","timestamp":1502216746000},"page":"3219-3234","source":"Crossref","is-referenced-by-count":8,"title":["Latent Network Features and Overlapping Community Discovery via Boolean Intersection Representations"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2276-017X","authenticated-orcid":false,"given":"Hoang","family":"Dau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90039-1"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1412236"},{"key":"ref30","first-page":"231","article-title":"On coverings of graphs","author":"lov\u00e4sz","year":"1968","journal-title":"Proceedings of the Colloquium held at Tihany Hungary"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(91)90002-E"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01302966"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.114"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0071509"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90061-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/586115.586117"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<377::AID-JGT3>3.0.CO;2-M"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579381"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000808"},{"key":"ref19","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions","volume":"11","author":"erd\u00f6s","year":"1975","journal-title":"Infinite and Finite Sets Colloquia Mathematica Societatis J&#x00E1;nos Bolyai"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2013.99"},{"key":"ref4","first-page":"1607","article-title":"An infinite latent attribute model for network data","author":"palla","year":"2012","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref27","first-page":"502","article-title":"An extensible SAT-solver","author":"e\u00e9n","year":"2003","journal-title":"Proc Int Conf Theory and Appl Satisfiability Testing"},{"key":"ref3","first-page":"1276","article-title":"Nonparametric latent feature models for link prediction","author":"miller","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.139"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"ref5","first-page":"400","article-title":"Modeling social networks with node attributes using the multiplicative attribute graph model","author":"kim","year":"2011","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741128"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433471"},{"key":"ref2","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"airoldi","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-014-3"},{"key":"ref1","first-page":"977","article-title":"Modeling dyadic data with binary latent factors","author":"meeds","year":"2006","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0375-9601(99)00757-4"},{"key":"ref21","first-page":"290","article-title":"On random graphs","volume":"6","author":"erd\u00f6s","year":"1959","journal-title":"Publicationes Math"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90125-X"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1201\/CHDISMTHAPP"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(77)90055-5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00043-6"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/90\/8071075\/8004484-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8071075\/08004484.pdf?arnumber=8004484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:14Z","timestamp":1649443754000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8004484\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":32,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2017.2728638","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}