{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,16]],"date-time":"2026-09-16T07:54:07Z","timestamp":1789545247426,"version":"build-2803163510"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1149851"],"award-info":[{"award-number":["IIS-1149851"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,3,1]]},"DOI":"10.1109\/tkde.2014.2345408","type":"journal-article","created":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T14:42:36Z","timestamp":1407249756000},"page":"608-620","source":"Crossref","is-referenced-by-count":63,"title":["An Iterative MapReduce Based Frequent Subgraph Mining Algorithm"],"prefix":"10.1109","volume":"27","author":[{"given":"Mansurul A.","family":"Bhuiyan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Al Hasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"844","article-title":"Large-scale frequent subgraph mining in Mapreduce","author":"xiao","year":"0","journal-title":"Proc Int Conf Data Eng"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2382936.2383055"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2012.19"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.15"},{"key":"ref31","first-page":"31","article-title":"Graph mining based on a data partitioning approach","author":"nguyen","year":"0","journal-title":"Proceedings of the 19th Conference on Australasian Database"},{"key":"ref30","first-page":"74","article-title":"A partition-based approach to graph mining","author":"wang","year":"0","journal-title":"Proc 2nd Int Conf Data Eng"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"162","DOI":"10.4103\/0256-4602.95388","article-title":"A MapReduce framework for mining maximal contiguous frequent patterns in large DNA sequence datasets","volume":"29","author":"jeong","year":"2012","journal-title":"IETE Tech Rev"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454027"},{"key":"ref35","first-page":"243","article-title":"Balanced parallel FP-growth with Mapreduce","author":"zhou","year":"0","journal-title":"Proc IEEE Youth Conf Inf Comput Telecommun"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2012.24"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/974614.974655"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502533"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11891321_2"},{"key":"ref14","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawal","year":"0","journal-title":"Proc 20th Int Conf Very Large Data Bases"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","article-title":"An apriori-based algorithm for mining frequent substructures from graph data","author":"inokuchi","year":"0","journal-title":"Proc 5th Eur Conf Principles Data Mining Knowl Discov"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989534"},{"key":"ref17","first-page":"721","article-title":"gSpan: Graph-based substructure pattern mining","author":"yan","year":"0","journal-title":"Proc Int Conf Data Min"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014134"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0098-x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CASoN.2010.115"},{"key":"ref6","first-page":"13","article-title":"Spectral analysis for billion-scale graphs: Discoveries and implementation","author":"kang","year":"0","journal-title":"Proc 12th Pacific-Asia Conf Adv Knowl Discovery Data Mining"},{"key":"ref29","author":"philippsen","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367520"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544814"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2009.08.014"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24775-3_42"},{"key":"ref22","first-page":"221","article-title":"Oo-FSG: An object-oriented approach to mine frequent subgraphs","author":"sunderraman","year":"0","journal-title":"Proceedings of the Australasian Data Mining Conference"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85654-2_59"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.3115\/1620950.1620951"},{"key":"ref24","first-page":"31","article-title":"Parallel algorithms for mining frequent structural motifs in scientific data","author":"parthasarathy","year":"0","journal-title":"Proc of the 18th Annual Intl Conf on Supercomputing"},{"key":"ref41","first-page":"517","article-title":"Grami: Frequent subgraph and pattern mining in a single large graph","volume":"7","author":"skiadopoulos","year":"0","journal-title":"Proc Very Large Databases Endowment"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1696"},{"key":"ref26","first-page":"1","article-title":"The parmol package for frequent subgraph mining.","volume":"1","author":"meinl","year":"2006","journal-title":"Electronic Communications of the EASST"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183924"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7029750\/06871430.pdf?arnumber=6871430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:25Z","timestamp":1641987685000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6871430\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,1]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2345408","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2015,3,1]]}}}