{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T04:49:54Z","timestamp":1768711794469,"version":"3.49.0"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Fudan University Startup Research Grant and the Program for Professor of Special Appointment"},{"name":"Shanghai Institutions of Higher Learning"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,5,1]]},"DOI":"10.1109\/tkde.2017.2782278","type":"journal-article","created":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T19:38:16Z","timestamp":1513193896000},"page":"936-949","source":"Crossref","is-referenced-by-count":21,"title":["$K$ -Ary Tree Hashing for Fast Graph Classification"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0975-4613","authenticated-orcid":false,"given":"Wei","family":"Wu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9633-0033","authenticated-orcid":false,"given":"Bin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xingquan","family":"Zhu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5715-7154","authenticated-orcid":false,"given":"Chengqi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-3-642-37453-1_19","article-title":"Fast graph stream\n classification using discriminative clique hashing","author":"chi","year":"2013","journal-title":"Proc Pacific-Asia Conf Adv Knowledge Discovery Data Mining"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.101"},{"key":"ref33","article-title":"HistoSketch: Fast\n similarity-preserving sketching of streaming histograms with concept drift","author":"yang","year":"2017","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref32","first-page":"2672","article-title":"Hashing algorithms for large-scale learning","author":"li","year":"2011","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref31","first-page":"886","article-title":"In defense of minhash over SimHash","author":"shrivastava","year":"2014","journal-title":"Proc Conf Artif Intell Statist"},{"key":"ref30","first-page":"3113","article-title":"One permutation hashing","author":"li","year":"2012","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.56"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147955"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"ref34","first-page":"2697","article-title":"POIsketch: Semantic place labeling over user activity streams","author":"yang","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772759"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783406"},{"key":"ref29","first-page":"557","article-title":"Densifying one permutation hashing via rotation for fast near neighbor search","author":"shrivastava","year":"2014","journal-title":"Proc Int Conf Mach Learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.42"},{"key":"ref1","volume":"40","author":"aggarwal","year":"2010","journal-title":"Managing and Mining Graph Data"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2302018"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2283497"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31753-3_17"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2289351"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052598"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0174"},{"key":"ref50","first-page":"227","article-title":"Min-hash\n fingerprints for graph kernels: A trade-off among accuracy, efficiency, and compression","volume":"3","author":"teixiera","year":"2012","journal-title":"J Inf Data Management"},{"key":"ref51","first-page":"211","article-title":"The power of two min-hashes for similarity search among heirarchical data objects","author":"gollapudi","year":"2008","journal-title":"Proc Symp Principles Database Syst"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447882"},{"key":"ref10","author":"vapnik","year":"1998","journal-title":"Statistical Learning Theory"},{"key":"ref11","first-page":"321","article-title":"Marginalized kernels between labeled graphs","author":"kashima","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref40","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":"ref12","first-page":"129","article-title":"On graph\n kernels: Hardness results and efficient alternatives","author":"g\u00e4rtner","year":"2003","journal-title":"Proc Ann Conf Learning Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5086-2"},{"key":"ref15","first-page":"1660","article-title":"Fast subtree kernels on graphs","author":"shervashidze","year":"2009","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref16","first-page":"1201","article-title":"Graph Kernels","volume":"11","author":"vishwanathan","year":"2010","journal-title":"J Mach Learning Res"},{"key":"ref17","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"shervashidze","year":"2011","journal-title":"J Mach Learning Res"},{"key":"ref18","first-page":"2615","article-title":"Hash kernels for structured data","volume":"10","author":"shi","year":"2009","journal-title":"J Mach Learning Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"ref4","first-page":"430","article-title":"Boosting for multi-graph classification","volume":"45","author":"wu","year":"2015","journal-title":"IEEE Trans Cybern"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.56"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2300489"},{"key":"ref5","first-page":"940","article-title":"Graph ensemble boosting for imbalanced noisy graph\n stream classification","volume":"45","author":"pan","year":"2015","journal-title":"IEEE Trans Cybern"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2391115"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2019264"},{"key":"ref49","article-title":"Hashing for similarity search: A survey","author":"wang","year":"2014"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2526058"},{"key":"ref46","article-title":"Convolution kernels on discrete structures","author":"haussler","year":"1999"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401922"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.30"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2005.07.009"},{"key":"ref41","first-page":"327","article-title":"Min-wise independent permutations","author":"broder","year":"1998","journal-title":"Proc Annu ACM Symp Theory Comput"},{"key":"ref44","first-page":"721","article-title":"gSpan: Graph-based substructure pattern mining","author":"yan","year":"2002","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref43","first-page":"398","article-title":"Graph stream classification using labeled and\n unlabeled graphs","author":"pan","year":"2013","journal-title":"Proc IEEE Int Conf Data Eng"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8329400\/08186208.pdf?arnumber=8186208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T07:55:53Z","timestamp":1643183753000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8186208\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,1]]},"references-count":52,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2782278","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2018,5,1]]}}}