{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:13:09Z","timestamp":1746245589725,"version":"3.37.3"},"reference-count":38,"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":[{"DOI":"10.13039\/501100013285","name":"Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100013285","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/tcyb.2017.2708979","type":"journal-article","created":{"date-parts":[[2017,8,25]],"date-time":"2017-08-25T18:41:10Z","timestamp":1503686470000},"page":"1591-1604","source":"Crossref","is-referenced-by-count":13,"title":["Hashing for Adaptive Real-Time Graph Stream Classification With Concept Drifts"],"prefix":"10.1109","volume":"48","author":[{"given":"Lianhua","family":"Chi","sequence":"first","affiliation":[]},{"given":"Bin","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4129-9611","authenticated-orcid":false,"given":"Xingquan","family":"Zhu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0794-527X","authenticated-orcid":false,"given":"Shirui","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","first-page":"108","article-title":"scmamp: Statistical comparison of multiple algorithms in multiple problems","volume":"1","author":"calvo","year":"2016","journal-title":"R Journal"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"ref32","first-page":"2","article-title":"Approximating clique is almost NP-complete (preliminary version)","author":"feige","year":"1991","journal-title":"Proc 32th FOCS"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2360856"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.12"},{"key":"ref37","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"dem\u0161ar","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"article-title":"The problem of concept drift: Definitions and related work","year":"2004","author":"tsymbal","key":"ref35"},{"key":"ref34","first-page":"54","article-title":"Graphlet decomposition of a weighted network","author":"soufiani","year":"2012","journal-title":"Proc 14th Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref10","first-page":"225","article-title":"Fast graph stream classification using discriminative clique hashing","author":"chi","year":"2013","journal-title":"Proc PAKDD"},{"key":"ref11","first-page":"35","article-title":"Opinion extraction and classification of real time Facebook status","volume":"12","author":"shrivastava","year":"2012","journal-title":"Glob J Comput Sci Technol"},{"key":"ref12","first-page":"398","article-title":"Graph stream classification using labeled and unlabeled graphs","author":"pan","year":"2013","journal-title":"Proc ICDE"},{"key":"ref13","first-page":"1201","article-title":"Graph kernels","volume":"11","author":"vishwanathan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref14","first-page":"721","article-title":"gSpan: Graph-based substructure pattern mining","author":"yan","year":"2002","journal-title":"Proc ICDM"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1083784.1083789"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1201\/EBK1439826119","author":"gama","year":"2010","journal-title":"Knowledge Discovery from Data Streams"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2015.2471196"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/543614.543615"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376946"},{"key":"ref4","first-page":"1660","article-title":"Fast subtree kernels on graphs","author":"shervashidze","year":"2009","journal-title":"Proc NIPS"},{"key":"ref27","first-page":"2615","article-title":"Hash kernels for structured data","volume":"10","author":"shi","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5086-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/070683155"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447882"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.67"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.56"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.42"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.101"},{"key":"ref1","first-page":"321","article-title":"Marginalized kernels between labeled graphs","author":"kashima","year":"2003","journal-title":"Proc ICML"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347107"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956778"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502568"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00354-015-0401-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04180-8_27"},{"key":"ref26","first-page":"146","author":"bottou","year":"2004","journal-title":"Stochastic Learning"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1109\/TCYB.2014.2341031","article-title":"Graph ensemble boosting for imbalanced noisy graph stream classification","volume":"45","author":"pan","year":"2015","journal-title":"IEEE Trans Cybern"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8330726\/08016599.pdf?arnumber=8016599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T07:12:49Z","timestamp":1643181169000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8016599\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":38,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2017.2708979","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"type":"print","value":"2168-2267"},{"type":"electronic","value":"2168-2275"}],"subject":[],"published":{"date-parts":[[2018,5]]}}}