{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:45:59Z","timestamp":1761896759012,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","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\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61741215","61373044","61173025"],"award-info":[{"award-number":["61741215","61373044","61173025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2819426","type":"journal-article","created":{"date-parts":[[2018,3,26]],"date-time":"2018-03-26T18:05:06Z","timestamp":1522087506000},"page":"21408-21417","source":"Crossref","is-referenced-by-count":8,"title":["Fast Top-K Graph Similarity Search Via Representative Matrices"],"prefix":"10.1109","volume":"6","author":[{"given":"Zhigang","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5436-1851","authenticated-orcid":false,"given":"Hongwei","family":"Huo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"38","article-title":"Closure-tree: An index structure for graph queries","author":"he","year":"2006","journal-title":"Proc ICDE"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2010.03.008"},{"key":"ref12","first-page":"321","article-title":"Marginalized kernels between labeled graphs","author":"kashima","year":"2003","journal-title":"Proc ICML"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610524"},{"key":"ref14","first-page":"1660","article-title":"Fast subtree kernels on graphs","author":"shervashidze","year":"2009","journal-title":"Proc NIPS"},{"key":"ref15","first-page":"2539","article-title":"Weisfeiler–Lehman graph kernels","volume":"12","author":"shervashidze","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref16","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","author":"shervashidze","year":"2009","journal-title":"Proc AISTATS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.14"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2690456"},{"key":"ref19","first-page":"1201","article-title":"Graph kernels","volume":"11","author":"vishwanathan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505723"},{"key":"ref4","first-page":"1033","article-title":"Top-k graph pattern matching over large graphs","author":"cheng","year":"2013","journal-title":"Proc ICDE"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24075-6_60"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2682107"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2616285"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247650"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(03)00628-4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.02.004"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0141-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816703"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516416"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.04.071"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.28"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498307"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915216"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.03.110"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08325543.pdf?arnumber=8325543","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:54Z","timestamp":1642004154000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8325543\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2819426","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}