{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T10:03:44Z","timestamp":1780913024187,"version":"3.54.1"},"reference-count":133,"publisher":"Maximum Academic Press","issue":"1","license":[{"start":{"date-parts":[[2012,11,20]],"date-time":"2012-11-20T00:00:00Z","timestamp":1353369600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2013,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Graph mining is an important research area within the domain of data mining. The field of study concentrates on the identification of frequent subgraphs within graph data sets. The research goals are directed at: (i) effective mechanisms for generating candidate subgraphs (without generating duplicates) and (ii) how best to process the generated candidate subgraphs so as to identify the desired frequent subgraphs in a way that is computationally efficient and procedurally effective. This paper presents a survey of current research in the field of frequent subgraph mining and proposes solutions to address the main research issues.<\/jats:p>","DOI":"10.1017\/s0269888912000331","type":"journal-article","created":{"date-parts":[[2012,11,20]],"date-time":"2012-11-20T09:38:34Z","timestamp":1353404314000},"page":"75-105","source":"Crossref","is-referenced-by-count":243,"title":["A survey of frequent subgraph mining algorithms"],"prefix":"10.48130","volume":"28","author":[{"given":"Chuntao","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frans","family":"Coenen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michele","family":"Zito","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"27968","published-online":{"date-parts":[[2012,11,20]]},"reference":[{"key":"S0269888912000331_ref137","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.125"},{"key":"S0269888912000331_ref46","unstructured":"G\u00e4rtner T. , Flach P. , Wrobel S. 2003. On graph kernels: hardness results and efficient alternatives. In Proceedings of the 16th Annual Conference on Learning Theory (COLT'03), 129\u2013143."},{"key":"S0269888912000331_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0959-440X(03)00031-9"},{"key":"S0269888912000331_ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1693"},{"key":"S0269888912000331_ref39","unstructured":"Fatta G. D. , Berthold M. R. 2005. High performance subgraph mining in molecular compounds. In Proceedings of the 2005 International Conference on High Performance Computing and Communications (HPCC'05), 866\u2013877."},{"key":"S0269888912000331_ref127","unstructured":"Yan X. , Han J. 2003. CloseGraph: mining closed frequent graph patterns. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, D.C., USA, 286\u2013295."},{"key":"S0269888912000331_ref115","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04921-1"},{"key":"S0269888912000331_ref93","unstructured":"Pei J. , Han J. , Mortazavi-Asl B. , Pinto H. , Chen Q. , Dayal U. , Hsu M. C. 2001. PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In Proceedings of 12th IEEE International Conference on Data Engineering (ICDE 01), Heidelberg, Germany, 215\u2013224."},{"key":"S0269888912000331_ref96","first-page":"742","article-title":"Neuer beweis eines satzes \u00fcber permutationen","volume":"27","author":"Pr\u00fcfer","year":"1918","journal-title":"Archiv f\u00fcr Mathematik und Physik"},{"key":"S0269888912000331_ref99","unstructured":"R\u00fcckert U. , Kramer S. 2004. Frequent free tree discovery in graph data. In Proceedings of Special Track on Data Mining, ACM Symposium on Applied Computing, 564\u2013570."},{"key":"S0269888912000331_ref18","unstructured":"Chen C. , Yan X. , Yu P. S. , Han J. , Zhang D. , Gu X. 2007b. Towards graph containment search and indexing. In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB'07), 926\u2013937."},{"key":"S0269888912000331_ref71","unstructured":"Kleinberg J. M. 1998. Authoritative sources in a hyper-linked environment. In Proceedings of ACM-SIAM Symposium Discrete Algorithms, 668\u2013677."},{"key":"S0269888912000331_ref133","unstructured":"Zaki M. J. 2002. Efficiently Mining Frequent Trees in a Forest. In Proceedings of the SIGKDD 2002. ACM, 71\u201380."},{"key":"S0269888912000331_ref40","unstructured":"Fischer I. , Meinl T. 2004. Graph based molecular data mining \u2013 an overview. In Proceedings of the 2004 IEEE International Conference on Systems,Man and Cybernetics, 4578\u20134582."},{"key":"S0269888912000331_ref142","unstructured":"Zhu F. , Yan X. , Han J. , Yu P. S. 2007. gPrune: a constraint pushing framework for graph pattern mining. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining, 388\u2013400."},{"key":"S0269888912000331_ref56","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00062-5"},{"key":"S0269888912000331_ref110","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183680"},{"key":"S0269888912000331_ref129","unstructured":"Yan X. , Zhou X. , Han J. 2005a. Mining closed relational graphs with connectivity constraints. In Proceeding of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, 324\u2013333."},{"key":"S0269888912000331_ref141","unstructured":"Zhao P. , Yu J. 2007. Mining closed frequent free trees in graph databases. In Proceedings of the 12th International Conference on Database Systems for Advanced Applications, Thailand, 91\u2013102."},{"key":"S0269888912000331_ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117456"},{"key":"S0269888912000331_ref42","volume-title":"The Graph Isomorphism Problem","author":"Fortin","year":"1996"},{"key":"S0269888912000331_ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-004-4433-8"},{"key":"S0269888912000331_ref23","unstructured":"Chi Y. , Yang Y. , Xia Y. , Muntz R. R. 2004a. HybridTreeMiner: an efficient algorithm for mining frequent rooted trees and trees using canonical forms. In Proceedings of the 16th International Conference on Scientific and Statistical Database Management, 11\u201320."},{"key":"S0269888912000331_ref79","unstructured":"Kuramochi M. , Karypis G. 2004c. Finding frequent patterns in a large sparse graph. In Proceedings of the SIAM International Conference on Data Mining, 345\u2013356."},{"key":"S0269888912000331_ref135","unstructured":"Zaki M. J. , Aggarwal C. C. 2003. XRules: an effective structural classifier for XML data. In Proceedings of the 2003 International Conference on Knowledge Discovery and Data Mining, 316\u2013325."},{"key":"S0269888912000331_ref88","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2004-00124-y"},{"key":"S0269888912000331_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0180-7"},{"key":"S0269888912000331_ref11","first-page":"1","article-title":"The maximum clique problem","author":"Bomze","year":"1999","journal-title":"Handbook of Combinatorial Optimization"},{"key":"S0269888912000331_ref49","doi-asserted-by":"crossref","unstructured":"Greco G. , Guzzo A. , Manco G. , Pontieri L. , Sacc\u00e1 D. 2005. Mining Constrained Graphs: the case of workflow systems, constraint based mining and inductive databases, Lecture Notes in Computer Science, 155\u2013171. Springer.","DOI":"10.1007\/11615576_8"},{"key":"S0269888912000331_ref55","doi-asserted-by":"publisher","DOI":"10.2307\/2785673"},{"key":"S0269888912000331_ref63","unstructured":"Inokuchi A. , Washio T. , Motoda H. 2000. An Apriori-based algorithm for mining frequent substructures from graph data. In Proceedings of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases, 13\u201323."},{"key":"S0269888912000331_ref81","volume-title":"Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data","author":"Liu","year":"2008"},{"key":"S0269888912000331_ref102","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/11599128_7","article-title":"Frequency concepts and pattern detection for the analysis of motifs in networks","volume":"3","author":"Schreiber","year":"2005","journal-title":"Transactions on Computational Systems Biology"},{"key":"S0269888912000331_ref26","doi-asserted-by":"publisher","DOI":"10.1109\/34.400565"},{"key":"S0269888912000331_ref82","unstructured":"Liu T. L. , Geiger D. 1999. Approximate tree matching and shape similarity. In Proceedings of 7th International Conference on Computer Vision, 456\u2013462."},{"key":"S0269888912000331_ref48","volume-title":"Algorithmic Graph Theory","author":"Gibbons","year":"1985"},{"key":"S0269888912000331_ref72","doi-asserted-by":"publisher","DOI":"10.1145\/360402.360406"},{"key":"S0269888912000331_ref114","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"S0269888912000331_ref106","unstructured":"Shasha D. , Wang J. T. L. , Giugno R. 2002. Algorithms and applications of tree and graph searching. In Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles on Database Systems, 39\u201352."},{"key":"S0269888912000331_ref136","first-page":"33","article-title":"Efficiently mining frequent embedded unordered trees","volume":"66","author":"Zaki","year":"2005a.","journal-title":"Fundamenta Informaticae"},{"key":"S0269888912000331_ref17","unstructured":"Chen C. , Yan X. , Zhu F. , Han J. 2007a. gApprox: mining frequent approximate patterns from a massive network. In Proceedings of the 7th IEEE International Conference on Data Mining, 445\u2013450."},{"key":"S0269888912000331_ref76","unstructured":"Kuramochi M. , Karypis G. 2002. Discovering frequent geometric subgraphs. In Proceedings of the IEEE International Conference on Data Mining, 258\u2013265."},{"key":"S0269888912000331_ref101","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321963"},{"key":"S0269888912000331_ref140","unstructured":"Zhang S. , Yang J. 2008. RAM: Randomized Approximate Graph Mining. In Proceedings of the 20th International Conference on Scientific and Statistical Database Management, 187\u2013203."},{"key":"S0269888912000331_ref125","unstructured":"Xin D. , Cheng H. , Yan X. , Han J. 2006. Extracting redundancy aware top K patterns. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 444\u2013453."},{"key":"S0269888912000331_ref52","unstructured":"Han J. , Pei J. , Yin Y. 2000. Mining frequent patterns without candidate generation. In Proceedings of ACM SIGMOD International Conference on Management of Data, 1\u201312."},{"key":"S0269888912000331_ref98","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010410"},{"key":"S0269888912000331_ref122","doi-asserted-by":"publisher","DOI":"10.1145\/959242.959249"},{"key":"S0269888912000331_ref73","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth919"},{"key":"S0269888912000331_ref51","first-page":"389","volume-title":"Handbook of Graph Theory, Discrete Mathematics and Its Applications","author":"Gutin","year":"2004"},{"key":"S0269888912000331_ref1","unstructured":"Abello A. , Resende M. G. C. , Sundarsky S. 2002. Massive quasi-clique detection. In Proceedings of the 5th Latin America Symposium on Theoretical Informatics, Cancun, Mexico, 598\u2013612."},{"key":"S0269888912000331_ref2","unstructured":"Agrawal R. , Srikant R. 1994. Fast algorithm for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases (VLDB). Morgan Kaufmann, 487\u2013499."},{"key":"S0269888912000331_ref20","unstructured":"Chen C. , Lin C. X. , Yan X. , Han J. 2008. On effective presentation of graph patterns: a structural representative approach. In Proceedings of the 17th ACM Conference on Information and Knowledge Management, 299\u2013308."},{"key":"S0269888912000331_ref6","unstructured":"Asai T. , Abe K. , Kawasoe S. , Arimura H. , Satamoto H. , Arikawa S. 2002. Efficient substructure discovery from large semi-structured data. In Proceedings of the 2nd SIAM International Conference on Data Mining, Fukuoka, Japan, 158\u2013174."},{"key":"S0269888912000331_ref80","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"S0269888912000331_ref7","unstructured":"Asai T. , Arimura H. , Uno T. , Nakano S. 2003. Discovering frequent substructures in large unordered trees. In Proceedings of the 6th International Conference on Discovery Science, Fukuoka, Japan, 47\u201361."},{"key":"S0269888912000331_ref8","doi-asserted-by":"crossref","unstructured":"Bayardo R. J. Jr 1998. Efficiently Mining Long Patterns from Databases. In Proceedings of the 1998 International Conference on Management of Data, 85\u201393.","DOI":"10.1145\/276305.276313"},{"key":"S0269888912000331_ref94","unstructured":"Pei J. , Jiang D. , Zhang A. 2005. On mining cross-graph quasi-cliques. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, USA, 228\u2013238."},{"key":"S0269888912000331_ref9","unstructured":"Borgelt C. , Berthold M. 2002. Mining molecular fragments: finding relevant substructures of molecules. In Proceedings of International Conference on Data Mining, 211\u2013218."},{"key":"S0269888912000331_ref10","unstructured":"Borgwardt K. M. , Kriegel H. P. 2005. Shortest-path kernels on graphs. In Proceedings of the 2005 International Conference on Data Mining, 74\u201381."},{"key":"S0269888912000331_ref12","unstructured":"Brin S. , Page L. 1998. The anatomy of a large-scale hyper-textual web search engine. In Proceedings of the 7th International World Wide Web Conference, 107\u2013117."},{"key":"S0269888912000331_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(83)90033-8"},{"key":"S0269888912000331_ref91","unstructured":"Ozaki T. , Ohkawa T. 2008. Mining correlated subgraphs in graph databases. In Proceedings of the 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'08), 272\u2013283."},{"key":"S0269888912000331_ref143","unstructured":"Zhao P. , Yu J. 2006. Fast frequent free tree mining in graph databases. In Proceedings of the 6th IEEE International Conference on Data Mining Workshop, 315\u2013319."},{"key":"S0269888912000331_ref15","unstructured":"Calders T. , Ramon J. , van Dyck D. 2008. Anti-monotonic overlap-graph support measures. In Proceedings of the Eighth IEEE International Conference on Data Mining, 73\u201382."},{"key":"S0269888912000331_ref19","doi-asserted-by":"publisher","DOI":"10.1109\/69.553155"},{"key":"S0269888912000331_ref21","unstructured":"Chi Y. , Yang Y. , Xia Y. , Muntz R. R. 2003. Indexing and mining free trees. In Proceedings of the 2003 IEEE International Conference on Data Mining, 509\u2013512."},{"key":"S0269888912000331_ref22","first-page":"161","article-title":"Frequent subtree mining \u2013 an overview","volume":"66","author":"Chi","year":"2004","journal-title":"Fundamenta Informaticae, Special Issue on Graph and Tree Mining"},{"key":"S0269888912000331_ref24","unstructured":"Chi Y. , Yang Y. , Xia Y. , Muntz R. R. 2004b. CMTreeMiner: mining both closed and maximal frequent subtrees. In Proceedings of the 8th Pacific Asia Conference on Knowledge Discovery and Data Mining, 63\u201373."},{"key":"S0269888912000331_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90030-7"},{"key":"S0269888912000331_ref28","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"S0269888912000331_ref29","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","article-title":"Substructure discovery using minimum description length and background knowledge","volume":"1","author":"Cook","year":"1994","journal-title":"Journal of Artificial Intelligence Research"},{"key":"S0269888912000331_ref30","doi-asserted-by":"publisher","DOI":"10.1109\/5254.850825"},{"key":"S0269888912000331_ref32","unstructured":"Cordella L. P. , Foggia P. , Sansone C. , Vento M. 2001. An improved algorithm for matching large graphs. In Proceedings of the 3rd IAPR-TC15 Workshop on Graph-based Representation in Pattern Recognition, 149\u2013159."},{"key":"S0269888912000331_ref31","unstructured":"Cordella L. P. , Foggia P. , Sansone C. , Tortorella F. , Vento M. 1998. Graph Matching: a fast algorithm and its evaluation. In Proceedings of the 14th Conference on Pattern Recognition, 1582\u20131584."},{"key":"S0269888912000331_ref45","volume-title":"Computers and intractability \u2013 a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"S0269888912000331_ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"S0269888912000331_ref38","unstructured":"Fan W. , Zhang K. , Cheng H. , Gao J. , Yan X. , Han J. , Yu P. S. , Verscheure O. 2008. Direct mining of discriminative and essential frequent patterns via model-based search tree. In Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, USA, 230\u2013238."},{"key":"S0269888912000331_ref41","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129093"},{"key":"S0269888912000331_ref43","unstructured":"Foggia P. , Genna R. , Vento M. 2001. A performance comparison of five algorithms for graph isomorphism. In Proceedings of the 3rd IAPR-TC15 Workshop on Graph-based Representation in Pattern Recognition, 188\u2013199."},{"key":"S0269888912000331_ref54","volume-title":"Data Mining Concepts and Techniques","author":"Han","year":"2006"},{"key":"S0269888912000331_ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"S0269888912000331_ref57","unstructured":"Hido S. , Kawano H. 2005. AMIOT:induced ordered tree mining in tree-structured databases. In Proceedings of the 5th IEEE International Conference on Data Mining, 170\u2013177."},{"key":"S0269888912000331_ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_13"},{"key":"S0269888912000331_ref89","unstructured":"Nijssen S. , Kok J. N. 2003. Efficient discovery of frequent unordered trees. In Proceedings of the 1st International Workshop on Mining Graphs, Trees and Sequences, 55\u201364."},{"key":"S0269888912000331_ref59","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1049"},{"key":"S0269888912000331_ref119","unstructured":"Wang C. , Hong M. , Pei J. , Zhou H. , Wang W. , Shi B. 2004a. Efficient pattern-growth methods for frequent tree pattern mining. In Proceedings of the 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 441\u2013451."},{"key":"S0269888912000331_ref64","unstructured":"Inokuchi A. , Washio T. , Nishimura K. , Motoda H. 2002. A Fast Algorithm for Mining Frequent Connected Subgraphs. Technical report RT0448, IBM Research, Tokyo Research Laboratory, Japan."},{"key":"S0269888912000331_ref60","unstructured":"Huan J. , Wang W. , Prins J. 2003. Efficient mining of frequent subgraph in the presence of isomorphism. In Proceedings of the 2003 International Conference on Data Mining, 549\u2013552."},{"key":"S0269888912000331_ref61","unstructured":"Huan J. , Wang W. , Prins J. , Yang J. 2004. SPIN: mining maximal frequent subgraphs from graph databases. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 581\u2013586."},{"key":"S0269888912000331_ref116","unstructured":"Vanetik N. , Gudes E. , Shimony S. E. 2002. Computing frequent graph patterns from semi-structured data. In Proceedings of the 2nd International Conference on Data Mining, 458\u2013465."},{"key":"S0269888912000331_ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvlc.2005.10.003"},{"key":"S0269888912000331_ref65","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021726221443"},{"key":"S0269888912000331_ref66","unstructured":"Jahn K. , Kramer S. 2005. Optimizing gSpan for molecular datasets. In Proceedings of the 3rd International Workshop on Mining Graphs, Trees and Sequences, 509\u2013523."},{"key":"S0269888912000331_ref69","unstructured":"Ke Y. , Cheng J. ,, Ng W. 2007. Correlated search in graph databases. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 390\u2013399."},{"key":"S0269888912000331_ref70","unstructured":"Ke Y. , Cheng J. , Yu J. 2009. Efficient discovery of frequent correlated subgraph pairs. In Proceedings of the 9th IEEE International Conference on Data Mining, 239\u2013248."},{"key":"S0269888912000331_ref68","unstructured":"Kelley B. , Sharan R. , Karp R. , Sittler E. , Root D. , Stockwell B. , Tdeker T. 2003. Conserved pathways within bacteria and yeast as revealed by Global Protein Network alignment. In Proceedings of the National Academy of Science of the United States of America (PNAS'03) 100(20), 11394\u201311399."},{"key":"S0269888912000331_ref74","unstructured":"Kudo T. , Maeda E. , Matsumoto Y. 2004. An application to boosting to graph classification. In Proceedings of the 8th Annual Conference on Neural Information Processing Systems, 729\u2013736."},{"key":"S0269888912000331_ref75","unstructured":"Kuramochi M. , Karypis G. 2001. Frequent subgraph discovery. In Proceedings of the International Conference on Data Mining, 313\u2013320."},{"key":"S0269888912000331_ref77","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.33"},{"key":"S0269888912000331_ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.173"},{"key":"S0269888912000331_ref103","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1044"},{"key":"S0269888912000331_ref78","unstructured":"Kuramochi M. , Karypis G. 2004b. GREW-A scalable frequent subgraph discovery algorithm. In Proceedings of the 4th IEEE International Conference on Data Mining, 439\u2013442."},{"key":"S0269888912000331_ref112","unstructured":"Thomas L. T. , Valluri S. R. , Karlapalem K. 2006. MARGIN: maximal frequent subgraph mining. In Proceedings of the 6th International Conference on Data Mining (ICDM 06), Hong Kong, 1097\u20131101."},{"key":"S0269888912000331_ref83","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70324-8"},{"key":"S0269888912000331_ref84","first-page":"45","article-title":"Practical graph isomorphism","volume":"30","author":"McKay","year":"1981","journal-title":"Congressus Numerantium"},{"key":"S0269888912000331_ref139","unstructured":"Zhang S. , Wang J. T. L. 2006. Mining frequent agreement subtrees in phylogenetic databases. In Proceedings of the 6th SIAM International Conference on Data Mining, 222\u2013233."},{"key":"S0269888912000331_ref85","doi-asserted-by":"publisher","DOI":"10.1109\/34.682179"},{"key":"S0269888912000331_ref86","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"S0269888912000331_ref87","unstructured":"Miyazaki T. 1997. The complexity of McKay's canonical labelling algorithm, Groups and Computation II, DIMACS Series Discrete Mathematics Theoretical Computer Science, American Mathematical Society, 28, 239\u2013256."},{"key":"S0269888912000331_ref90","unstructured":"Nijssen S. , Kok J. N. 2004. A quickstart in frequent structure mining can make a difference. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 647\u2013652."},{"key":"S0269888912000331_ref92","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5713-5"},{"key":"S0269888912000331_ref95","volume-title":"Data Structures and Algorithms with Object-Oriented Design Patterns in C++","author":"Preiss","year":"1998"},{"key":"S0269888912000331_ref104","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1981.4767144"},{"key":"S0269888912000331_ref121","unstructured":"Wang J. , Zeng Z. , Zhou L. 2006. CLAN: an algorithm for mining closed cliques from large dense graph databases. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, USA, 797\u2013802."},{"key":"S0269888912000331_ref105","unstructured":"Shasha D. , Wang J. , Zhang S. 2004. Unordered tree mining with applications to phylogeny. In Proceedings of the 20th International Conference on Data Engineering (ICDE 04), 708\u2013719."},{"key":"S0269888912000331_ref107","unstructured":"Sharan R. , Suthram S. , Kelley R. , Kuhn T. , McCuine S. , Uetz P. , Sittler T. , Karp R. , Ideker T. 2005. Conserved patterns of protein interaction in multiple species. In Proceedings of the National Academy of Science of the United States of America (PNAS'05), 102(6), 1974\u20131979."},{"key":"S0269888912000331_ref109","unstructured":"Tan H. , Dillon T. S. , Feng L. , Chang E. , Hadzic F. 2005. X3-Miner: mining patterns from XML database. In Proceedings of the 6th International Data Mining, 287\u2013297."},{"key":"S0269888912000331_ref108","unstructured":"Tan H. , Dillon T. S. , Hadzic F. , Chang E. , Feng L. 2006. IMB3-Miner: mining induced\/embedded subtrees by constraining the level of embedding. In Proceedings of the 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 450\u2013461."},{"key":"S0269888912000331_ref111","unstructured":"Termier A. , Rousset M. C. , Sebag M. 2002. Treefinder: a first step towards XML data mining. In Proceedings of the 2002 IEEE International Conference on Data Mining, 450\u2013457."},{"key":"S0269888912000331_ref117","volume-title":"Discovery of Frequent Patterns in Semi-structured Data","author":"Vanetik","year":"2002"},{"key":"S0269888912000331_ref118","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0044-8"},{"key":"S0269888912000331_ref120","unstructured":"Wang C. , Wang W. , Pei J. , Zhu Y. , Shi B. 2004b. Scalable mining of large disk-based graph databases. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 316\u2013325."},{"key":"S0269888912000331_ref131","unstructured":"Yan X. , Zhu F. , Han J. , Yu P. S. 2006. Searching substructures with superimposed distance. In Proceedings of the 22nd International Conference on Data Engineering, 88\u201397."},{"key":"S0269888912000331_ref123","volume-title":"Introduction to Graph Theory","author":"West","year":"2000"},{"key":"S0269888912000331_ref124","unstructured":"W\u00f6rlein M. , Meinl T. , Fischer I. , Philippsen M. 2005. A quantitative comparison of the subgraph miners MoFa, gSpan, FFSM and Gaston. In Proceedings of the 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, 392\u2013404."},{"key":"S0269888912000331_ref126","unstructured":"Yan X. , Han J. W. 2002. gSpan: graph-based substructure pattern mining. In Proceedings of the International Conference on Data Mining, 721\u2013724."},{"key":"S0269888912000331_ref128","unstructured":"Yan X. , Yu P. S. , Han J. 2004. Graph Indexing: a frequent structure-based approach. In Proceedings of ACM-SIGMOD International Conference on Management of Data, Paris, France, 335\u2013346."},{"key":"S0269888912000331_ref130","unstructured":"Yan X. , Yu P. S. , Han J. 2005b. Sub-structure similarity search in graph databases. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, 766\u2013777."},{"key":"S0269888912000331_ref132","unstructured":"Yan X. , Cheng H. , Han J. , Yu P. S. 2008. Mining significant graph patterns by leap search. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, Vancouver, Canada, 433\u2013444."},{"key":"S0269888912000331_ref138","unstructured":"Zeng Z. , Wang J. , Zhou L. , Karypis G. 2006. Coherent closed quasi-clique discovery from large dense graph databases. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, USA, 797\u2013802."},{"key":"S0269888912000331_ref16","doi-asserted-by":"publisher","DOI":"10.1109\/2.781636"},{"key":"S0269888912000331_ref67","unstructured":"Kashima H. , Tsuda K. , Inokuchi A. 2003. Marginalized kernels between labelled graphs. In Proceedings of the 20th International Conference on Machine Learning (ICML'03), 321\u2013328."}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888912000331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:41:56Z","timestamp":1767624116000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888912000331\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,20]]},"references-count":133,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["S0269888912000331"],"URL":"https:\/\/doi.org\/10.1017\/s0269888912000331","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"value":"0269-8889","type":"print"},{"value":"1469-8005","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,20]]}}}