{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:37:59Z","timestamp":1725482279304},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709800"},{"type":"electronic","value":"9783540709817"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70981-7_38","type":"book-chapter","created":{"date-parts":[[2007,3,23]],"date-time":"2007-03-23T13:49:52Z","timestamp":1174657792000},"page":"337-349","source":"Crossref","is-referenced-by-count":8,"title":["Canonical Forms for Frequent Graph Mining"],"prefix":"10.1007","author":[{"given":"Christian","family":"Borgelt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","first-page":"51","volume-title":"Proc. 2nd IEEE Int. Conf. on Data Mining","author":"C. Borgelt","year":"2002","unstructured":"BORGELT, C. and BERTHOLD, M.R. (2002): Mining Molecular Fragments: Finding Relevant Substructures of Molecules. Proc. 2nd IEEE Int. Conf. on Data Mining. IEEE Press, Piscataway, 51\u201358."},{"key":"38_CR2","volume-title":"Proc. IEEE Conf. on Systems, Man and Cybernetics, CD-ROM","author":"C. Borgelt","year":"2004","unstructured":"BORGELT, C., MEINL, T. and BERTHOLD, M.R. (2004): Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments. Proc. IEEE Conf. on Systems, Man and Cybernetics, CD-ROM. IEEE Press, Piscataway."},{"key":"38_CR3","first-page":"6","volume-title":"Proc. Open Source Data Mining Workshop","author":"C. Borgelt","year":"2005","unstructured":"BORGELT, C., MEINL, T. and BERTHOLD, M.R. (2005): MoSS: A Program for Molecular Substructure Mining. Proc. Open Source Data Mining Workshop. ACM Press, New York, 6\u201315."},{"issue":"2","key":"38_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D.J. Cook","year":"2000","unstructured":"COOK, D.J. and HOLDER, L.B. (2000): Graph-based Data Mining. IEEE Trans. on Intelligent Systems 15,2, 32\u201341.","journal-title":"IEEE Trans. on Intelligent Systems"},{"issue":"2\u20133","key":"38_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1007460424845","volume":"30","author":"P.W. Finn","year":"1998","unstructured":"FINN, P.W., MUGGLETON, S., PAGE, D. and SRINIVASAN, A. (1998): Pharmacore Discovery Using the Inductive Logic Programming System PROGOL. Machine Learning 30,2\u20133, 241\u2013270.","journal-title":"Machine Learning"},{"key":"38_CR6","unstructured":"GOETHALS, B. and ZAKI, M. (2003\/2004): Proc. 1st and 2nd IEEE ICDM Workshop on Frequent Itemset Mining Implementations. CEUR Workshop Proceedings 90 and 126. Sun SITE Central Europe and RWTH Aachen http:\/\/www.ceur-ws.org\/Vol-90\/, http:\/\/www.ceur-ws.org\/Vol-126\/."},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1109\/ICDM.2003.1250974","volume-title":"Proc. 3rd IEEE Int. Conf. on Data Mining","author":"J. Huan","year":"2003","unstructured":"HUAN, J., WANG, W. and PRINS, J. (2003): Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. Proc. 3rd IEEE Int. Conf. on Data Mining. IEEE Press, Piscataway, 549\u2013552."},{"key":"38_CR8","unstructured":"INDEX CHEMICUS \u2014 Subset from 1993. Institute of Scientific Information, Inc. (ISI). Thomson Scientific, Philadelphia."},{"key":"38_CR9","first-page":"136","volume-title":"Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"S. Kramer","year":"2001","unstructured":"KRAMER, S., DE RAEDT, L. and HELMA, C. (2001): Molecular Feature Mining in HIV Data. Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining. ACM Press, New York, 136\u2013143."},{"key":"38_CR10","first-page":"313","volume-title":"Proc. 1st IEEE Int. Conf. on Data Mining","author":"M. Kuramochi","year":"2001","unstructured":"KURAMOCHI, M. and KARYPIS, G. (2001): Frequent Subgraph Discovery. Proc. 1st IEEE Int. Conf. on Data Mining. IEEE Press, Piscataway, 313\u2013320."},{"key":"38_CR11","first-page":"647","volume-title":"Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"S. Nijssen","year":"2004","unstructured":"NIJSSEN, S. and KOK, J.N. (2004): A Quickstart in Frequent Structure Mining can Make a Difference. Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining. ACM Press, New York, 647\u2013652."},{"issue":"1","key":"38_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T. Washio","year":"2003","unstructured":"WASHIO, T. and MOTODA, H. (2003): State of the Art of Graph-based Data Mining. SIGKDD Explorations Newsletter 5,1, 59\u201368.","journal-title":"SIGKDD Explorations Newsletter"},{"key":"38_CR13","first-page":"721","volume-title":"Proc. 2nd IEEE Int. Conf. on Data Mining","author":"X. Yan","year":"2002","unstructured":"YAN, X. and HAN, J. (2002): gSpan: Graph-based Substructure Pattern Mining. Proc. 2nd IEEE Int. Conf. on Data Mining. IEEE Press, Piscataway, 721\u2013724."},{"key":"38_CR14","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/956750.956784","volume-title":"Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"X. Yan","year":"2003","unstructured":"YAN, X. and HAN, J. (2003): CloseGraph: Mining Closed Frequent Graph Patterns. Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining. ACM Press, New York, 286\u2013295."}],"container-title":["Studies in Classification, Data Analysis, and Knowledge Organization","Advances in Data Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70981-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T19:12:50Z","timestamp":1628709170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70981-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709800","9783540709817"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70981-7_38","relation":{},"ISSN":["1431-8814","2198-3321"],"issn-type":[{"type":"print","value":"1431-8814"},{"type":"electronic","value":"2198-3321"}],"subject":[],"published":{"date-parts":[[2007]]}}}