{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T21:15:44Z","timestamp":1770153344724,"version":"3.49.0"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,12,1]]},"DOI":"10.1109\/tkde.2017.2743075","type":"journal-article","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T18:20:30Z","timestamp":1503426030000},"page":"2710-2723","source":"Crossref","is-referenced-by-count":41,"title":["Incremental Frequent Subgraph Mining on Large Evolving Graphs"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8708-0642","authenticated-orcid":false,"given":"Ehab","family":"Abdelhamid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustafa","family":"Canim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Sadoghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bishwaranjan","family":"Bhattacharjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan-Chi","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Kalnis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816681"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.132"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297918"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989420"},{"key":"ref30","article-title":"Social computing data repository at ASU","author":"zafarani","year":"2009"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22351-8_20"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(79)90023-9"},{"key":"ref10","article-title":"gSpan: Graph-based substructure pattern mining","author":"yan","year":"2002","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref40","first-page":"191","article-title":"Mining frequent patterns in data streams at multiple time granularities","volume":"212","author":"giannella","year":"2003","journal-title":"Next Generation Data Mining"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732289"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020501"},{"key":"ref15","first-page":"166","article-title":"Frequent subgraph\n discovery in large attributed streaming graphs","volume":"36","author":"ray","year":"2014","journal-title":"Proc 3rd Int Conf Big Data Streams Heterogeneous Source Mining Algorithms Syst Programming Models Appl"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/19361610903176310"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88735-7_4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0528-3"},{"key":"ref19","first-page":"266","article-title":"Finding maximal frequent itemsets over online data streams adaptively","author":"lee","year":"2005","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"ref4","first-page":"30","article-title":"Predicting protein function by frequent functional association pattern mining in protein\n interaction networks","volume":"14","author":"cho","year":"2010","journal-title":"IEEE TITB"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2007.74"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2324796.2324831"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014134"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687734"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.133"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014123"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15939-8_14"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376662"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1830252.1830272"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50021-8"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920964"},{"key":"ref48","first-page":"1","article-title":"Mining temporally evolving graphs","volume":"22","author":"desikan","year":"2004","journal-title":"proc 8th International Workshop on Knowledge Discovery on the Web"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.4304\/jsw.7.1.25-32"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.124"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150473"},{"key":"ref42","first-page":"263","article-title":"An efficient algorithm for the incremental\n updation of association rules in large databases","author":"thomas","year":"1997","journal-title":"Proc 10th ACM SIGKDD Int Conf Knowl Discovery Data Mining"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1177\/0165551506068179"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646000"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.12.054"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref26","first-page":"59","article-title":"Moment: Maintaining closed frequent itemsets over a\n stream sliding window","author":"chi","year":"2004","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/319950.320010"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2012.10.011"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8097365\/08014497.pdf?arnumber=8014497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:24:15Z","timestamp":1642004655000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8014497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,1]]},"references-count":48,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2743075","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2017,12,1]]}}}