乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:48:42Z","timestamp":1725518922381},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540880660"},{"type":"electronic","value":"9783540880677"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-88067-7_11","type":"book-chapter","created":{"date-parts":[[2008,10,9]],"date-time":"2008-10-09T04:38:39Z","timestamp":1223527119000},"page":"189-205","source":"Crossref","is-referenced-by-count":1,"title":["Full Perfect Extension Pruning for Frequent Subgraph Mining"],"prefix":"10.1007","author":[{"given":"Christian","family":"Borgelt","sequence":"first","affiliation":[]},{"given":"Thorsten","family":"Meinl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Borgelt, C.: On Canonical Forms for Frequent Graph Mining. In: Proc. 3rd Int. Workshop on Mining Graphs, Trees and Sequences, MGTS 2005, Porto, Portugal, 1\u201312. ECML\/PKDD 2005 Organization Committee, Porto, Portugal (2005)"},{"key":"11_CR2","unstructured":"Borgelt, C.: Combining Ring Extensions and Canonical Form Pruning. In: Proceedings of the 4th International Workshop on Mining and Learning in Graphs (MLG 2006), ECML\/PKDD 2006 Organization Committee, Berlin, pp. 109\u2013116 (2006)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/ICDM.2002.1183885","volume-title":"Proc. IEEE Int. Conf. on Data Mining, ICDM 2002, Maebashi, Japan","author":"C. Borgelt","year":"2002","unstructured":"Borgelt, C., Berthold, M.R.: Mining Molecular Fragments: Finding Relevant Substructures of Molecules. In: Proc. IEEE Int. Conf. on Data Mining, ICDM 2002, Maebashi, Japan, pp. 51\u201358. IEEE Press, Piscataway (2002)"},{"key":"11_CR4","volume-title":"Proc. IEEE Conf. on Systems, Man and Cybernetics, SMC 2004, The Hague, Netherlands","author":"C. Borgelt","year":"2004","unstructured":"Borgelt, C., Meinl, T., Berthold, M.R.: Advanced Pruning Strategies to Speed Up Mining Closed Molecular Fragments. In: Proc. IEEE Conf. on Systems, Man and Cybernetics, SMC 2004, The Hague, Netherlands, IEEE Press, Piscataway (2004)"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D.J. Cook","year":"2000","unstructured":"Cook, D.J., Holder, L.B.: Graph-Based Data Mining. IEEE Trans.on Intelligent Systems\u00a015(2), 32\u201341 (2000)","journal-title":"IEEE Trans.on Intelligent Systems"},{"key":"11_CR6","first-page":"1","volume-title":"Workshop on Data Mining and the Grid, IEEE Int. Conf. on Data Mining","author":"G. Fatta Di","year":"2004","unstructured":"Di Fatta, G., Berthold, M.R.: Distributed Mining of Molecular Fragments. In: Workshop on Data Mining and the Grid, IEEE Int. Conf. on Data Mining, pp. 1\u20139. IEEE Press, Piscataway (2004)"},{"issue":"2-3","key":"11_CR7","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., Srinivasan, A.: Pharmacore Discovery Using the Inductive Logic Programming System PROGOL. Machine Learning\u00a030(2-3), 241\u2013270 (1998)","journal-title":"Machine Learning"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"495","DOI":"10.3233\/IDA-2004-8506","volume":"8","author":"H. Hofer","year":"2004","unstructured":"Hofer, H., Borgelt, C., Berthold, M.R.: Large Scale Mining of Molecular Fragments with Wildcards. Intelligent Data Analysis\u00a08, 495\u2013504 (2004)","journal-title":"Intelligent Data Analysis"},{"key":"11_CR9","first-page":"549","volume-title":"Proc. 3rd IEEE Int. Conf. on Data Mining, ICDM 2003, Melbourne, FL","author":"J. Huan","year":"2003","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. In: Proc. 3rd IEEE Int. Conf. on Data Mining, ICDM 2003, Melbourne, FL, pp. 549\u2013552. IEEE Press, Piscataway (2003)"},{"key":"11_CR10","unstructured":"Index Chemicus \u2014 Subset from 1993. Institute of Scientific Information, Inc (ISI). Thomson Scientific, Philadelphia, PA, USA (1993), \n \n http:\/\/www.thomsonscientific.com\/products\/indexchemicus\/"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1145\/502512.502533","volume-title":"Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, KDD 2001, San Francisco, CA","author":"S. Kramer","year":"2001","unstructured":"Kramer, S., de Raedt, L., Helma, C.: Molecular Feature Mining in HIV Data. In: Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, KDD 2001, San Francisco, CA, pp. 136\u2013143. ACM Press, New York (2001)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/ICDM.2001.989534","volume-title":"Proc. 1st IEEE Int. Conf. on Data Mining, ICDM 2001, San Jose, CA","author":"M. Kuramochi","year":"2001","unstructured":"Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: Proc. 1st IEEE Int. Conf. on Data Mining, ICDM 2001, San Jose, CA, pp. 313\u2013320. IEEE Press, Piscataway (2001)"},{"key":"11_CR13","unstructured":"DTP AIDS Antiviral Screen (HIV Data Set) \u2014 Subset from 2001. Developmental Therapeutics Program (DTP), National Cancer Institute, USA (2001), \n \n http:\/\/dtp.nci.nih.gov\/docs\/aids\/aids_data.html"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/1014052.1014134","volume-title":"Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, KDD 2004, Seattle, WA","author":"S. Nijssen","year":"2004","unstructured":"Nijssen, S., Kok, J.N.: A Quickstart in Frequent Structure Mining Can Make a Difference. In: Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, KDD 2004, Seattle, WA, pp. 647\u2013652. ACM Press, New York (2004)"},{"issue":"1","key":"11_CR15","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-Based Data Mining. SIGKDD Explorations Newsletter\u00a05(1), 59\u201368 (2003)","journal-title":"SIGKDD Explorations Newsletter"},{"key":"11_CR16","first-page":"721","volume-title":"Proc. 2nd IEEE Int. Conf. on Data Mining, ICDM 2003, Maebashi, Japan","author":"X. Yan","year":"2002","unstructured":"Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: Proc. 2nd IEEE Int. Conf. on Data Mining, ICDM 2003, Maebashi, Japan, pp. 721\u2013724. IEEE Press, Piscataway (2002)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/956750.956784","volume-title":"Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, KDD 2003, Washington, DC","author":"X. Yan","year":"2003","unstructured":"Yan, X., Han, J.: Closegraph: Mining Closed Frequent Graph Patterns. In: Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, KDD 2003, Washington, DC, pp. 286\u2013295. ACM Press, New York (2003)"}],"container-title":["Studies in Computational Intelligence","Mining Complex Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88067-7_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:55:37Z","timestamp":1619524537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88067-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540880660","9783540880677"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88067-7_11","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[]}}