{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T04:13:06Z","timestamp":1683000786608},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-1149372"],"award-info":[{"award-number":["IIS-1149372"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tkde.2022.3178925","type":"journal-article","created":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:47:59Z","timestamp":1654112879000},"page":"1-1","source":"Crossref","is-referenced-by-count":0,"title":["PRESTO: Fast and Effective Group Closeness Maximization"],"prefix":"10.1109","author":[{"given":"Baibhav","family":"Rajbhandari","sequence":"first","affiliation":[{"name":"Department of Computer Science, University at Albany - State University of New York, Albany, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Olsen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The College of Saint Rose, Albany, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Birnbaum","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University at Albany - State University of New York, Albany, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeong-Hyon","family":"Hwang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University at Albany - State University of New York, Albany, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46922-5_4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975055.18"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732945"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006206"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811395.004"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1999.9990219"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.128"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00059"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00013"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16468-7_2"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/0137041"},{"key":"ref45","article-title":"Global rank estimation","author":"saxena","year":"2017"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5355-6"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/S0966-8349(98)00030-8"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.11"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69311-6_21"},{"key":"ref44","first-page":"80","article-title":"Fast Estimation of Closeness Centrality Ranking","author":"saxena","year":"2017","journal-title":"International Conference on Advances in Social Network Analysis and Mining (ASONAM)"},{"key":"ref43","article-title":"A faster method to estimate closeness centrality ranking","author":"saxena","year":"2017"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1002\/net.20128"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.03.017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2019.8714773"},{"key":"ref9","first-page":"1","article-title":"Degree, closeness, and betweenness: Application of group centrality measurements to explore macro-disciplinary evolution diachronically","author":"ni","year":"2011","journal-title":"Proc Conf Int Soc Scientometrics Informetrics"},{"key":"ref4","year":"2006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2579356"},{"key":"ref5","year":"2005"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/NSW.2011.6004633"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.11.001"},{"key":"ref37","article-title":"The PageRank citation ranking: Bringing order to the web","author":"page","year":"1999"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2307\/270732"},{"key":"ref31","year":"2018"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3344719"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623626"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.056709"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"ref1","article-title":"SNAP datasets: Stanford large network dataset collection","author":"leskovec","year":"2014"},{"key":"ref39","article-title":"Fast and simple computation of top-$k$k closeness centralities","author":"borassi","year":"2015"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976472.12"},{"key":"ref23","article-title":"Closeness centrality extended to unconnected graphs: The harmonic centrality index","author":"rochat","year":"2009","journal-title":"Proc Appl Social Netw Anal"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816651"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.865686"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402713"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/3090163.3090166"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1083784.1083791"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"ref27","author":"lin","year":"1976","journal-title":"Foundations of Social Research"},{"key":"ref29","first-page":"228","article-title":"Fast approximation of centrality","author":"eppstein","year":"2001","journal-title":"Proc 12th Annu Symp Discrete Algorithms"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09785891.pdf?arnumber=9785891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T00:24:11Z","timestamp":1682987051000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9785891\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/tkde.2022.3178925","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}