{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:50Z","timestamp":1740169130372,"version":"3.37.3"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61832020","61772216"],"award-info":[{"award-number":["61832020","61772216"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Program of China","award":["2018YFB10033005"],"award-info":[{"award-number":["2018YFB10033005"]}]},{"name":"National Defense Preliminary Research Project","award":["31511010202"],"award-info":[{"award-number":["31511010202"]}]},{"name":"Hubei Province Technical Innovation Special Project","award":["2017AAA129"],"award-info":[{"award-number":["2017AAA129"]}]},{"name":"Wuhan Application Basic Research Project","award":["2017010201010103"],"award-info":[{"award-number":["2017010201010103"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2942216","type":"journal-article","created":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T20:00:27Z","timestamp":1568836827000},"page":"139827-139838","source":"Crossref","is-referenced-by-count":1,"title":["2-Hopper: Accurately Estimate Individual and Social Attributes of Social Networks With Fewer Repeats via Random Walk"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4845-9868","authenticated-orcid":false,"given":"Lingling","family":"Zhang","sequence":"first","affiliation":[{"name":"Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Jiang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Wang","sequence":"additional","affiliation":[{"name":"Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Feng","sequence":"additional","affiliation":[{"name":"Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718519"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.10.017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/2945.841119"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794373"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057169"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"ref18","first-page":"569","article-title":"An improved branch and bound algorithm for the maximum clique problem","volume":"58","author":"konc","year":"2007","journal-title":"MATCH Commun Math Comput Chem"},{"key":"ref19","first-page":"830","article-title":"An exact algorithm for the maximum weight clique problem in large graphs","author":"jiang","year":"2017","journal-title":"Proc AAAI"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816696"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254795"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-018-0587-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18009-5_10"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195540"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1993744.1993773"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111012"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref20","first-page":"1","article-title":"Random walks on graphs: A survey","volume":"2","author":"lov\u00e1sz","year":"1993","journal-title":"Combinatorics Paul Erdos Is Eighty"},{"year":"0","key":"ref22"},{"journal-title":"Markov Chains and Stochastic Stability","year":"2012","author":"meyn","key":"ref21"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08843922.pdf?arnumber=8843922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T19:45:31Z","timestamp":1662666331000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8843922\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2942216","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}