{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T14:25:01Z","timestamp":1759674301016},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292449"},{"type":"electronic","value":"9783540316657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564126_39","type":"book-chapter","created":{"date-parts":[[2005,11,4]],"date-time":"2005-11-04T10:24:55Z","timestamp":1131099895000},"page":"392-403","source":"Crossref","is-referenced-by-count":63,"title":["A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston"],"prefix":"10.1007","author":[{"given":"Marc","family":"W\u00f6rlein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Meinl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingrid","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Philippsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Fischer, I., Meinl, T.: Subgraph Mining. In: Wang, J. (ed.) Encyclopedia of Data Warehousing and Mining. Idea Group Reference, Hershey, PA, USA (2005)","DOI":"10.4018\/978-1-59140-557-3.ch199"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T. Washio","year":"2003","unstructured":"Washio, T., Motoda, H.: State of the Art of Graph\u2013based Data Mining. SIGKDD Explorations Newsletter\u00a05, 59\u201368 (2003)","journal-title":"SIGKDD Explorations Newsletter"},{"key":"39_CR3","unstructured":"McKay, B.: Practical graph isomorphism. Congressus Numerantium\u00a030 (1981)"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170035.170072","volume-title":"Proc. 1993 ACM SIGMOD Int\u2019l Conf. on Management of Data, Washington, D.C., USA","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining Association Rules between Sets of Items in Large Databases. In: Buneman, P., Jajodia, S. (eds.) Proc. 1993 ACM SIGMOD Int\u2019l Conf. on Management of Data, Washington, D.C., USA, pp. 207\u2013216. ACM Press, New York (1993)"},{"key":"39_CR5","first-page":"283","volume-title":"3rd Int\u2019l Conf. on Knowledge Discovery and Data Mining","author":"M.J. Zaki","year":"1997","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New Algorithms for Fast Discovery of Association Rules. In: Heckerman, D., Mannila, H., Pregibon, D., Uthurusamy, R., Park, M. (eds.) 3rd Int\u2019l Conf. on Knowledge Discovery and Data Mining, pp. 283\u2013296. AAAI Press, Menlo Park (1997)"},{"key":"39_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D.J. Cook","year":"1994","unstructured":"Cook, D.J., Holder, L.B.: Substructure Discovery Using Minimum Description Length and Background Knowledge. J. of Artificial Intelligence Research\u00a01, 231\u2013255 (1994)","journal-title":"J. of Artificial Intelligence Research"},{"key":"39_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/ICDM.2001.989534","volume-title":"Proceedings of the IEEE Intl. Conf. on Data Mining ICDM","author":"M. Kuramochi","year":"2001","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the IEEE Intl. Conf. on Data Mining ICDM, Piscataway, NJ, USA, pp. 313\u2013320. IEEE Press, Los Alamitos (2001)"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Berthold, M.R.: Mining Molecular Fragments: Finding Relevant Substructures of Molecules. In: Proc. IEEE Int\u2019l Conf. on Data Mining ICDM, Maebashi City, Japan, pp. 51\u201358 (2002)","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"39_CR10","unstructured":"Yan, X., Han, J.: gSpan: Graph\u2013Based Substructure Pattern Mining. In: Proc. IEEE Int\u2019l Conf. on Data Mining ICDM, Maebashi City, Japan, pp. 721\u2013723 (2002)"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/ICDM.2003.1250974","volume-title":"Proceedings of the 3rd IEEE Intl. Conf. on Data Mining ICDM, Piscataway, NJ, USA","author":"J. Huan","year":"2003","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proceedings of the 3rd IEEE Intl. Conf. on Data Mining ICDM, Piscataway, NJ, USA, pp. 549\u2013552. IEEE Press, Los Alamitos (2003)"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.N.: Frequent Graph Mining and its Application to Molecular Databases. In: Thissen, W., Wieringa, P., Pantic, M., Ludema, M. (eds.) Proc. of the 2004 IEEE Conf. on Systems, Man and Cybernetics, SMC 2004, Den Haag, The Netherlands, pp. 4571\u20134577 (2004)","DOI":"10.1109\/ICSMC.2004.1401252"},{"key":"39_CR13","unstructured":"Institute of Scientific Information, Inc. (ISI): Index chemicus - subset from 1993 (1993)"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. Technical report, Leiden Institute of Advanced Computer Science, Leiden University (2004)","DOI":"10.1145\/1014052.1014134"},{"key":"39_CR15","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. Technical report, Department of Computer Science at the University of North Carolina, Chapel Hill (2003)"},{"key":"39_CR16","first-page":"1","volume-title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI 1997)","author":"A. Srinivasan","year":"1997","unstructured":"Srinivasan, A., King, R.D., Muggleton, S.H., Sternberg, M.: The predictive toxicology evaluation challenge. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 1\u20136. Morgan-Kaufmann, San Francisco (1997)"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/956750.956784","volume-title":"Proc. of the 9th ACM SIGKDD Int\u2019l Conf. on Knowledge Discovery and Data Mining, Washington, DC, USA","author":"X. Yan","year":"2003","unstructured":"Yan, X., Han, J.: Closegraph: Mining Closed Frequent Graph Patterns. In: Proc. of the 9th ACM SIGKDD Int\u2019l Conf. on Knowledge Discovery and Data Mining, Washington, DC, USA, pp. 286\u2013295. ACM Press, New York (2003)"},{"key":"39_CR18","first-page":"3","volume-title":"STAIRS 2004 - Proc. of the Second Starting AI Researchers\u2019 Symp. Frontiers in Artificial Intelligence and Applications.","author":"T. Meinl","year":"2004","unstructured":"Meinl, T., Borgelt, C., Berthold, M.R.: Discriminative Closed Fragment Mining and Pefect Extensions in MoFa. In: Onaindia, E., Staab, S. (eds.) STAIRS 2004 - Proc. of the Second Starting AI Researchers\u2019 Symp. Frontiers in Artificial Intelligence and Applications., Valencia, Spain, vol.\u00a0109, pp. 3\u201314. IOS Press, Amsterdam (2004)"},{"key":"39_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-540-45231-7_35","volume-title":"Advances in Intelligent Data Analysis V","author":"H. Hofer","year":"2003","unstructured":"Hofer, H., Borgelt, C., Berthold, M.R.: Large Scale Mining of Molecular Fragments with Wildcards. In: R. Berthold, M., Lenz, H.-J., Bradley, E., Kruse, R., Borgelt, C. (eds.) IDA 2003. LNCS, vol.\u00a02810, pp. 380\u2013389. Springer, Heidelberg (2003)"},{"key":"39_CR20","unstructured":"Meinl, T., Borgelt, C., Berthold, M.R.: Mining Fragments with Fuzzy Chains in Molecular Databases. In: Kok, J.N., Washio, T. (eds.) Proc. of the Workshop W7 on Mining Graphs, Trees and Sequences (MGTS 2004), Pisa, Italy, pp. 49\u201360 (2004)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564126_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:52:59Z","timestamp":1605642779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564126_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292449","9783540316657"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11564126_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}