{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:18:06Z","timestamp":1778563086296,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T00:00:00Z","timestamp":1507248000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502504"],"award-info":[{"award-number":["61502504"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Fundamental Research Funds for the Central Universities, and the Research Funds of Renmin University of China","award":["No. 15XNLF09"],"award-info":[{"award-number":["No. 15XNLF09"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61432006"],"award-info":[{"award-number":["61432006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Ministry of Science and Technology of China, National Key Research and Development Program","award":["2016YFB1000700"],"award-info":[{"award-number":["2016YFB1000700"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502347"],"award-info":[{"award-number":["61502347"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Nature Science Foundation of Hubei Province of China","award":["2016CFB384"],"award-info":[{"award-number":["2016CFB384"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10115-017-1104-7","type":"journal-article","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T01:05:53Z","timestamp":1507251953000},"page":"663-690","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Mining frequent subgraphs from tremendous amount of small graphs using MapReduce"],"prefix":"10.1007","volume":"56","author":[{"given":"Zhe","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongtong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony K. H.","family":"Tung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,6]]},"reference":[{"key":"1104_CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.is.2013.08.005","volume":"48","author":"S Aridhi","year":"2015","unstructured":"Aridhi S, d\u2019Orazio L, Maddouri M, Nguifo EM (2015) Density-based data partitioning strategy to approximate large-scale subgraph mining. Inf Syst 48:213\u2013223","journal-title":"Inf Syst"},{"key":"1104_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"HM Berman","year":"2000","unstructured":"Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne PE (2000) The protein data bank. Nucleic Acids Res 28:235\u2013242","journal-title":"Nucleic Acids Res"},{"issue":"3","key":"1104_CR3","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/TKDE.2014.2345408","volume":"27","author":"M Bhuiyan","year":"2015","unstructured":"Bhuiyan M, Hasan MA (2015) An iterative mapreduce based frequent subgraph mining algorithm. IEEE Trans Knowl Data Eng 27(3):608\u2013620","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1104_CR4","doi-asserted-by":"crossref","unstructured":"Borgelt C, Berthold MR (2002) Mining molecular fragments: finding relevant substructures of molecules. In: ICDM, pp 51\u201358","DOI":"10.1109\/ICDM.2002.1183885"},{"issue":"3","key":"1104_CR5","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10618-008-0098-x","volume":"17","author":"V Chaoji","year":"2008","unstructured":"Chaoji V, Hasan MA, Salem S, Zaki MJ (2008) An integrated, generic approach to pattern mining: data mining template library. Data Min Knowl Discov 17(3):457\u2013495","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"1104_CR6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1508857.1508859","volume":"34","author":"J Cheng","year":"2009","unstructured":"Cheng J, Ke Y, Ng W (2009) Efficient query processing on graph databases. ACM Trans Database Syst 34(1):2","journal-title":"ACM Trans Database Syst"},{"key":"1104_CR7","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Ng W, Lu A(2007) Fg-index: towards verification-free query processing on graph databases. In: SIGMOD conference, pp 857\u2013872","DOI":"10.1145\/1247480.1247574"},{"key":"1104_CR8","unstructured":"Dean J, Ghemawat S (2004) MapReduce: simplified data processing on large clusters. In: OSDI, pp 137\u2013150"},{"key":"1104_CR9","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2005","unstructured":"Han J (2005) Data mining: concepts and techniques. Morgan Kaufmann Publishers Inc., San Francisco"},{"key":"1104_CR10","doi-asserted-by":"crossref","unstructured":"Hill S, Srichandan B, Sunderraman R (2012) An iterative mapreduce approach to frequent subgraph mining in biological datasets. In: BCB, pp 661\u2013666","DOI":"10.1145\/2382936.2383055"},{"key":"1104_CR11","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraphs in the presence of isomorphism. In: ICDM, pp 549\u2013552","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"1104_CR12","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J, Yang J (2004) Spin: mining maximal frequent subgraphs from graph databases. In: KDD, pp 581\u2013586","DOI":"10.1145\/1014052.1014123"},{"key":"1104_CR13","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: PKDD, pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"issue":"1","key":"1104_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1093\/nar\/28.1.27","volume":"28","author":"M Kanehisa","year":"2000","unstructured":"Kanehisa M, Goto S (2000) KEGG: Kyoto encyclopedia of genes and genomes. Nucleic Acids Res 28(1):27\u201330","journal-title":"Nucleic Acids Res"},{"key":"1104_CR15","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: ICDM, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"key":"1104_CR16","doi-asserted-by":"crossref","unstructured":"Lin W, Xiao X, Ghinita G (2014) Large-scale frequent subgraph mining in mapreduce. In: IEEE 30th international conference on data engineering, Chicago, ICDE 2014, IL, USA, 31 March\u20134 April, pp 844\u2013855","DOI":"10.1109\/ICDE.2014.6816705"},{"key":"1104_CR17","doi-asserted-by":"crossref","unstructured":"Liu Y, Jiang X, Chen H, Ma J, Zhang X (2009) Mapreduce-based pattern finding algorithm applied in motif detection for prescription compatibility network. In: Advanced parallel processing technologies, 8th international symposium, APPT 2009, Rapperswil, Switzerland, Proceedings, 24\u201325 Aug, pp 341\u2013355","DOI":"10.1007\/978-3-642-03644-6_27"},{"key":"1104_CR18","doi-asserted-by":"crossref","unstructured":"Lowe DG (2001) Local feature view clustering for 3D object recognition. In: CVPR, pp 682\u2013688","DOI":"10.1109\/CVPR.2001.990541"},{"key":"1104_CR19","doi-asserted-by":"crossref","unstructured":"Lu W, Chen G, Tung AKH, Zhao F (2013) Efficiently extracting frequent subgraphs using mapreduce. In: Proceedings of the 2013 IEEE international conference on big data, Santa Clara, CA, USA, 6\u20139 Oct 2013, pp 639\u2013647","DOI":"10.1109\/BigData.2013.6691633"},{"key":"1104_CR20","unstructured":"National library of medicine. http:\/\/chem.sis.nlm.nih.gov\/chemidplus"},{"key":"1104_CR21","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok JN (2004) A quickstart in frequent structure mining can make a difference. In: KDD, pp 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"issue":"3","key":"1104_CR22","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/69.599932","volume":"9","author":"EGM Petrakis","year":"1997","unstructured":"Petrakis EGM, Faloutsos C (1997) Similarity searching in medical image databases. IEEE Trans Knowl Data Eng 9(3):435\u2013447","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1104_CR23","doi-asserted-by":"crossref","unstructured":"Wang C, Wang W, Pei J, Zhu Y, Shi B (2004) Scalable mining of large disk-based graph databases. In: KDD, pp 316\u2013325","DOI":"10.1145\/1014052.1014088"},{"key":"1104_CR24","unstructured":"Yan X, Han J (2002) gspan: graph-based substructure pattern mining. In: ICDM, pp 721\u2013724"},{"key":"1104_CR25","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: SIGMOD conference, pp 335\u2013346","DOI":"10.1145\/1007568.1007607"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1104-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1104-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1104-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T05:19:48Z","timestamp":1570166388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1104-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,6]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1104"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1104-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,6]]}}}