{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T00:53:17Z","timestamp":1767919997552,"version":"3.49.0"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-12-1-0385"],"award-info":[{"award-number":["W911NF-12-1-0385"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005423","name":"ARL under Cooperative","doi-asserted-by":"publisher","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100005423","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005423","name":"ARL","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005423","id-type":"DOI","asserted-by":"publisher"}]},{"name":"U.S. Government"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1301254"],"award-info":[{"award-number":["U1301254"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61603290"],"award-info":[{"award-number":["61603290"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602371"],"award-info":[{"award-number":["61602371"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Education & China Mobile Research Fund","award":["MCM20160311"],"award-info":[{"award-number":["MCM20160311"]}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["SBK2014021758"],"award-info":[{"award-number":["SBK2014021758"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"name":"111 International Collaboration Program of China"},{"name":"Prospective Joint Research of Industry-Academia-Research Joint Innovation Funding of Jiangsu Province","award":["BY2014074"],"award-info":[{"award-number":["BY2014074"]}]},{"name":"Shenzhen Basic Research","award":["JCYJ20160229195940462"],"award-info":[{"award-number":["JCYJ20160229195940462"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2015M582663"],"award-info":[{"award-number":["2015M582663"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Basic Research Plan in Shaanxi Province of China","award":["2016JQ6034"],"award-info":[{"award-number":["2016JQ6034"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,1,1]]},"DOI":"10.1109\/tkde.2017.2756836","type":"journal-article","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T18:21:20Z","timestamp":1506450080000},"page":"73-86","source":"Crossref","is-referenced-by-count":49,"title":["MOSS-5: A Fast Method of Approximating Counts of 5-Node Graphlets in Large Graphs"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1434-837X","authenticated-orcid":false,"given":"Pinghui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junzhou","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3574-5665","authenticated-orcid":false,"given":"Xiangliang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenguo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiefeng","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C.S.","family":"Lui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2629564"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297929"},{"key":"ref33","first-page":"1","article-title":"Sampling content distributed over graphs","volume":"abs 1311 3882","author":"wang","year":"2013","journal-title":"CoRR"},{"key":"ref32","first-page":"1","article-title":"Data analysis in public social networks.","author":"takac","year":"2012","journal-title":"Proc Int Sci Conf Int Workshop Present Day Trends Innovations"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref30","first-page":"745","article-title":"Defining and evaluating network communities based on ground-truth","author":"yang","year":"2012","journal-title":"Proc 12th IEEE Int Conf Data Min"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.87"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"ref35","article-title":"Google programming contest","year":"2002"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"ref28","first-page":"1431","article-title":"Escape: Efficiently counting all 5-vertex subgraphs","author":"pinar","year":"2017","journal-title":"Proc World Wide Web"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2307\/2527652"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/ng881"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","article-title":"Network motifs: Simple building blocks of complex networks","volume":"298","author":"milo","year":"2002","journal-title":"Sci"},{"key":"ref20","first-page":"351","article-title":"Trust management for the semantic web","author":"richardson","year":"2003","journal-title":"Proc 2nd Int Semantic Web Conf"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623757"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487678"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2556663"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11224"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1266\/ggs.84.385"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021940"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983832"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113337"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0018"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498312"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(03)00628-4"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687710"},{"key":"ref12","first-page":"1201","article-title":"Graph kernels","volume":"11","author":"vishwanathan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.39"},{"key":"ref14","first-page":"1","article-title":"A submodular framework for graph comparison","author":"yanardag","year":"2015","journal-title":"Proc NIPS Workshop on Networks"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref16","first-page":"659","article-title":"Finding unknown malice in 10 seconds: Mass vetting for new threats at the Google-play scale","author":"chen","year":"2015","journal-title":"Proc 24th USENIX Conf Security Symp"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2014.52"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2517312.2517315"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526809"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/1452520.1452528","article-title":"Comparison of online social relations in terms of volume versus interaction: A case study of cyworld","author":"chun","year":"2008","journal-title":"Proc ACM SIGCOMM Internet Meas Conf"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488502"},{"key":"ref5","first-page":"941","article-title":"Empirical analysis of the evolution of follower network: A case study on douban","author":"zhao","year":"2011","journal-title":"Proc NetSciCom"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658967"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555356"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.51"},{"key":"ref9","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","author":"shervashidze","year":"2009","journal-title":"Proc 12th Int Conf Artif Intell Stat"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.08.019"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883082"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth163"},{"key":"ref47","first-page":"1","article-title":"Efficient counting for large networks","author":"ahmed","year":"2015","journal-title":"Proc IEEE Int Conf Data Min"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020513"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783413"},{"key":"ref43","article-title":"Algorithmic aspects of triangle-based network analysis","author":"schank","year":"2007"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8168803\/08051106.pdf?arnumber=8051106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T13:38:46Z","timestamp":1659533926000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8051106\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,1]]},"references-count":56,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2756836","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2018,1,1]]}}}