{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:58Z","timestamp":1725566338178},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233572"},{"type":"electronic","value":"9783540302148"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30214-8_1","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T15:19:01Z","timestamp":1285082341000},"page":"1-15","source":"Crossref","is-referenced-by-count":5,"title":["Predictive Graph Mining"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Karwath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"De Raedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Dehaspe, L.: Frequent Pattern Discovery in First-Order Logic. K. U. Leuven (1998)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Deshpande, M., Kuramochi, M., Karypis, G.: Frequent sub-structure-based approaches for classifying chemical compounds. In: Proc. ICDM 2003, pp. 35\u201342 (2003)","DOI":"10.21236\/ADA439580"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1145\/502512.502533","volume-title":"Proc. KDD 2001","author":"S. Kramer","year":"2001","unstructured":"Kramer, S., De Raedt, L., Helma, C.: Molecular feature mining in HIV data. In: Provost, F., Srikant, R. (eds.) Proc. KDD 2001, pp. 136\u2013143. ACM Press, New York (2001)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/775047.775058","volume-title":"Proc. KDD 2002","author":"M. Zaki","year":"2002","unstructured":"Zaki, M.: Efficiently mining frequent trees in a forest. In: Hand, D., Keim, D., Ng, R. (eds.) Proc. KDD 2002, pp. 71\u201380. ACM Press, New York (2002)"},{"key":"1_CR5","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proc. ICDM 2002 (2002)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Kashima, H.: Mining significant pairs of patterns from graph structures with class labels. In: Proc. ICDM 2003, pp. 83\u201390 (2003)","DOI":"10.1109\/ICDM.2003.1250906"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A. Inokuchi","year":"2003","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning\u00a050, 321\u2013354 (2003)","journal-title":"Machine Learning"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proc. ICDM 2001, pp. 179\u2013186 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: Closegraph: Mining closed frequent graph patterns. In: Proc. KDD 2003 (2003)","DOI":"10.1145\/956750.956784"},{"key":"1_CR10","first-page":"70","volume-title":"Proc. ICML 1994","author":"J. F\u00fcrnkranz","year":"1994","unstructured":"F\u00fcrnkranz, J., Widmer, G.: Incremental reduced error pruning. In: Cohen, W.W., Hirsh, H. (eds.) Proc. ICML 1994, pp. 70\u201377. Morgan Kaufmann, San Francisco (1994)"},{"key":"1_CR11","first-page":"115","volume-title":"Proc. ICML 1995","author":"W.W. Cohen","year":"1995","unstructured":"Cohen, W.W.: Fast effective rule induction. In: Proc. ICML 1995, pp. 115\u2013123. Morgan Kaufmann, San Francisco (1995)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1073\/pnas.93.1.438","volume":"93","author":"R.D. King","year":"1996","unstructured":"King, R.D., Muggleton, S., Srinivasan, A., Sternberg, M.J.E.: Structure-activity relationships derived by machine learning: The use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming. Proc. of the National Academy of Sciences\u00a093, 438\u2013442 (1996)","journal-title":"Proc. of the National Academy of Sciences"},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1021\/ci00057a005","volume":"28","author":"D. Weininger","year":"1988","unstructured":"Weininger, D.: SMILES, a chemical language and information system 1. Introduction and encoding rules. J. Chem. Inf. Comput. Sci.\u00a028, 31\u201336 (1988)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"1_CR14","first-page":"239","volume":"5","author":"J.R. Quinlan","year":"1990","unstructured":"Quinlan, J.R.: Learning logical definitions from relations. Machine Learning\u00a05, 239\u2013266 (1990)","journal-title":"Machine Learning"},{"key":"1_CR15","first-page":"277","volume":"85","author":"A. Srinivasan","year":"1996","unstructured":"Srinivasan, A., Muggleton, S., Sternberg, M.E., King, R.D.: Theories for mutagenicity: a study of first-order and feature based induction. A.I. Journal\u00a085, 277\u2013299 (1996)","journal-title":"A.I. Journal"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Cook, Holder: Graph-based data mining. ISTA: Intelligent Systems & their applications 15 (2000)","DOI":"10.1109\/5254.850825"},{"key":"1_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-36468-4_6","volume-title":"Inductive Logic Programming","author":"J.A. Gonzalez","year":"2003","unstructured":"Gonzalez, J.A., Holder, L.B., Cook, D.J.: Experimental comparison of graph-based relational concept learning with inductive logic programming systems. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol.\u00a02583, pp. 84\u2013100. Springer, Heidelberg (2003)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Warodom, G., Matsuda, T., Yoshida, T., Motoda, H., Washio, T.: Classifier construction by graph-based induction for graph-structured data. In: Whang, K.-Y., Jeon, J., Shim, K., Srivastava, J. (eds.) PAKDD 2003. LNCS (LNAI), vol.\u00a02637, pp. 52\u201362. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36175-8_6"},{"key":"1_CR19","unstructured":"Geamsakul, W., Matsuda, T., Yoshida, T., Motoda, H., Washio, T.: Constructing a decision tree for graph structured data. In: Proc. MGTS 2003, pp. 1\u201310 (2003), http:\/\/www.ar.sanken.osaka-u.ac.jp\/MGTS-2003CFP.html"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/A:1007668716498","volume":"43","author":"T. Horvath","year":"2001","unstructured":"Horvath, T., Wrobel, S., Bohnebeck, U.: Relational instance-based learning with lists and terms. Machine Learning\u00a043, 53\u201380 (2001)","journal-title":"Machine Learning"},{"key":"1_CR21","first-page":"133","volume":"14","author":"S. Muggleton","year":"1995","unstructured":"Muggleton, S.: Inverting entailment and Progol. Machine Intelligence\u00a014, 133\u2013188 (1995)","journal-title":"Machine Intelligence"},{"key":"1_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-48751-4_27","volume-title":"Inductive Logic Programming","author":"A. Srinivasan","year":"1999","unstructured":"Srinivasan, A., King, R.D., Bristol, D.W.: An assessment of ILP-assisted models for toxicology and the PTE-3 experiment. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 291\u2013302. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30214-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T20:08:21Z","timestamp":1559678901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30214-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233572","9783540302148"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30214-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}