{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T19:09:48Z","timestamp":1772651388593,"version":"3.50.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["# IIS-1817046"],"award-info":[{"award-number":["# IIS-1817046"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["# W911NF-15-1-0577"],"award-info":[{"award-number":["# W911NF-15-1-0577"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021,4,1]]},"DOI":"10.1109\/tkde.2019.2946149","type":"journal-article","created":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T20:06:27Z","timestamp":1570565187000},"page":"1778-1789","source":"Crossref","is-referenced-by-count":19,"title":["Tree++: Truncated Tree Based Graph Kernels"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3784-7788","authenticated-orcid":false,"given":"Wei","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5592-7186","authenticated-orcid":false,"given":"Rachel","family":"Redberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1997-7140","authenticated-orcid":false,"given":"Ambuj","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0103-5"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1021\/ci034143r"},{"key":"ref33","first-page":"3756","article-title":"Graph invariant kernels","author":"orsini","year":"2015","journal-title":"Proc 24th Int Joint Conf Artif Intell"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0142"},{"key":"ref31","first-page":"505","article-title":"Approximate correspondences in high dimensions","author":"grauman","year":"2007","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.55"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref36","article-title":"Grakel: A graph kernel library in python","author":"siglidis","year":"2018","journal-title":"arXiv 1806 02193"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1086\/228631"},{"key":"ref34","article-title":"Graph theory","author":"harary","year":"1971"},{"key":"ref10","first-page":"2990","article-title":"The multiscale laplacian graph kernel","author":"kondor","year":"2016","journal-title":"Proc 30th Int Conf Neural Inf Process Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"ref12","first-page":"321","article-title":"Marginalized kernels between labeled graphs","author":"kashima","year":"2003","journal-title":"Proc 20th Int Conf Int Conf Mach Learn"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33460-3_30"},{"key":"ref14","first-page":"3964","article-title":"RetGK: Graph kernels based on return probabilities of random walks","author":"zhang","year":"2018","journal-title":"Proc 32nd Int Conf Neural Inf Process Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5517-9"},{"key":"ref16","first-page":"255","article-title":"Fast neighborhood subgraph pairwise distance kernel","author":"costa","year":"2010","journal-title":"Proc 27th Int Conf Int Conf Mach Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014072"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"ref19","first-page":"65","article-title":"Expressivity versus efficiency of graph kernels","author":"ramon","year":"2003","journal-title":"Proc 1st Int Workshop Mining Graphs Trees Sequences"},{"key":"ref28","first-page":"88","article-title":"Hunt for the unique, stable, sparse and fast feature learning on graphs","author":"verma","year":"2017","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref4","article-title":"Convolution kernels on discrete structures","author":"haussler","year":"1999"},{"key":"ref27","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","author":"niepert","year":"2016","journal-title":"Proc 33rd Int Conf Int Conf Mach Learn"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219991"},{"key":"ref6","first-page":"1660","article-title":"Fast subtree kernels on graphs","author":"shervashidze","year":"2009","journal-title":"Proc 22nd Int Conf Neural Inf Process Syst"},{"key":"ref29","first-page":"216","article-title":"Scalable kernels for graphs with continuous attributes","author":"feragen","year":"2013","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref5","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","author":"shervashidze","year":"2009","journal-title":"Proc 12th Int Conf Artif Intell Statist"},{"key":"ref8","first-page":"1201","article-title":"Graph kernels","volume":"11","author":"vishwanathan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref7","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"shervashidze","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref1","first-page":"291","article-title":"Subgraph matching kernels for attributed graphs","author":"kriege","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref46","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc 21st Int Conf Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5086-2"},{"key":"ref45","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc 28th Int Conf Mach Learn"},{"key":"ref48","first-page":"723","article-title":"A kernel two-sample test","volume":"13","author":"gretton","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref21","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"weisfeiler","year":"1968","journal-title":"Nauchno- Technicheskaya Informatsia"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2526058"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020511"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"ref23","first-page":"1623","article-title":"On valid optimal assignment kernels and applications to graph classification","author":"kriege","year":"2016","journal-title":"Proc 30th Int Conf Neural Inf Process Syst"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"ref26","first-page":"2429","article-title":"Matching node embeddings for graph similarity","author":"nikolentzos","year":"2017","journal-title":"Proc 31st AAAI Conf Artif Intell"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289527"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219980"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/69\/9371488\/8862853-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9371488\/08862853.pdf?arnumber=8862853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:52Z","timestamp":1652194252000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8862853\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,1]]},"references-count":48,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2946149","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":[[2021,4,1]]}}}