{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T11:47:50Z","timestamp":1693136870604},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T00:00:00Z","timestamp":1279584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s10994-010-5193-8","type":"journal-article","created":{"date-parts":[[2010,7,19]],"date-time":"2010-07-19T15:16:03Z","timestamp":1279552563000},"page":"137-161","source":"Crossref","is-referenced-by-count":17,"title":["Effective feature construction by maximum common subgraph sampling"],"prefix":"10.1007","volume":"83","author":[{"given":"Leander","family":"Schietgat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"De Raedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,20]]},"reference":[{"key":"5193_CR1","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1162\/153244303321897681","volume":"3","author":"S. Ben-David","year":"2002","unstructured":"Ben-David, S., Eiron, N., & Simon, H. U. (2002). Limitations of learning via embeddings in Euclidean half spaces. Journal of Machine Learning Research, 3, 441\u2013461.","journal-title":"Journal of Machine Learning Research"},{"key":"5193_CR2","doi-asserted-by":"crossref","unstructured":"Bringmann, B., Zimmermann, A., Raedt, L. D., & Nijssen, S. (2006). Don\u2019t be afraid of simpler patterns. In Proceedings of the tenth European conference on principles and practice of knowledge discovery in databases (pp. 55\u201366).","DOI":"10.1007\/11871637_10"},{"key":"5193_CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H. Bunke","year":"1998","unstructured":"Bunke, H., & Shearer, K. (1998). A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19, 255\u2013259.","journal-title":"Pattern Recognition Letters"},{"issue":"16","key":"5193_CR4","doi-asserted-by":"crossref","first-page":"2038","DOI":"10.1093\/bioinformatics\/btm298","volume":"23","author":"A. Ceroni","year":"2007","unstructured":"Ceroni, A., Costa, F., & Frasconi, P. (2007). Classification of small molecules by two- and three-dimensional decomposition kernels. Bioinformatics, 23(16), 2038\u20132045.","journal-title":"Bioinformatics"},{"issue":"2","key":"5193_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/sam.10004","volume":"1","author":"V. Chaoji","year":"2008","unstructured":"Chaoji, V., Al Hasan, M., Salem, S., Besson, J., & Zaki, J. M. (2008). Origami: a novel and effective approach for mining representative orthogonal graph patterns. Statistical Analysis and Data Mining, 1(2), 67\u201384.","journal-title":"Statistical Analysis and Data Mining"},{"key":"5193_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-68856-3","volume-title":"Logical and relational learning","author":"L. Raedt De","year":"2008","unstructured":"De Raedt, L. (2008). Logical and relational learning. Berlin: Springer."},{"issue":"3","key":"5193_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.patrec.2008.09.007","volume":"30","author":"L. Raedt De","year":"2009","unstructured":"De Raedt, L., & Ramon, J. (2009). Deriving distance metrics from generality relations. Pattern Recognition Letters, 30(3), 187\u2013191.","journal-title":"Pattern Recognition Letters"},{"key":"5193_CR8","first-page":"1","volume":"7","author":"J. Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J. (2006). Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7, 1\u201330.","journal-title":"Journal of Machine Learning Research"},{"issue":"8","key":"5193_CR9","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M. Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., & Karypis, G. (2005). Frequent substructure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering, 17(8), 1036\u20131050.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5193_CR10","volume-title":"Graph theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R. (2000). Graph theory. Berlin: Springer."},{"key":"5193_CR11","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"key":"5193_CR12","unstructured":"G\u00e4rtner, T. (2005). Kernels for structured data. PhD thesis, University of Bonn, Germany."},{"issue":"1","key":"5193_CR13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10994-009-5119-5","volume":"77","author":"D. J. Hand","year":"2009","unstructured":"Hand, D. J. (2009). Measuring classifier performance: a coherent alternative to the area under the ROC curve. Machine Learning, 77(1), 103\u2013123.","journal-title":"Machine Learning"},{"key":"5193_CR14","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/ICDM.2006.79","volume-title":"ICDM \u201906: proceedings of the sixth international conference on data mining","author":"H. He","year":"2006","unstructured":"He, H., & Singh, A. K. (2006). Graphrank: statistical modeling and mining of significant subgraphs in the feature space. In ICDM \u201906: proceedings of the sixth international conference on data mining, Washington, DC, USA (pp. 885\u2013890). Las Alamitos: IEEE Comput. Soc."},{"key":"5193_CR15","unstructured":"Horv\u00e1th, T., G\u00e4rtner, T., & Wrobel, S. (2004). Cyclic pattern kernels for predictive graph mining. In KDD \u201904: proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 158\u2013167)."},{"key":"5193_CR16","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th, T., Ramon, J., & Wrobel, S. (2006). Frequent subgraph mining in outerplanar graphs. In Proceedings of the twelfth ACM SIGKDD international conference on knowledge discovery and data mining, Philadelphia, PA, August 2006, pp. 197\u2013206.","DOI":"10.1145\/1150402.1150427"},{"key":"5193_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0907-3","volume-title":"Learning to classify text using support vector machines: methods, theory, and algorithms","author":"T. Joachims","year":"2002","unstructured":"Joachims, T. (2002). Learning to classify text using support vector machines: methods, theory, and algorithms. Berlin: Springer."},{"key":"5193_CR18","unstructured":"Karunaratne, T., & Bostr\u00f6m, H. (2006). Learning to classify structured data by graph propositionalization. In Proceedings of the second IASTED international conference on computational intelligence (pp. 393\u2013398)."},{"key":"5193_CR19","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/502512.502533","volume-title":"Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, KDD-01","author":"S. Kramer","year":"2001","unstructured":"Kramer, S., De Raedt, L., & Helma, C. (2001). Molecular feature mining in HIV data. In Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, KDD-01 (pp. 136\u2013143). New York: ACM."},{"key":"5193_CR20","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-662-04599-2_11","volume-title":"Relational data mining","author":"S. Kramer","year":"2001","unstructured":"Kramer, S., Lavra\u010d, N., & Flach, P. (2001). Propositionalization approaches to relational data mining. In S. D\u017eeroski & N. Lavra\u010d (Eds.), Relational data mining (pp. 262\u2013291). Berlin: Springer."},{"issue":"1","key":"5193_CR21","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J. Munkres","year":"1957","unstructured":"Munkres, J. (1957). Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics, 5(1), 32\u201338.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"5193_CR22","first-page":"101","volume-title":"Machine intelligence","author":"G. Plotkin","year":"1971","unstructured":"Plotkin, G. (1971). A further note on inductive generalization. In Machine intelligence (Vol.\u00a06, pp. 101\u2013124). Edinburgh: Edinburgh University Press."},{"key":"5193_CR23","first-page":"43","volume-title":"Proceedings of the third international conference on knowledge discovery and data mining","author":"F. Provost","year":"1998","unstructured":"Provost, F., & Fawcett, T. (1998). Analysis and visualization of classifier performance: comparison under imprecise class and cost distributions. In Proceedings of the third international conference on knowledge discovery and data mining (pp. 43\u201348). Menlo Park: AAAI Press."},{"key":"5193_CR24","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"J. Raymond","year":"2002","unstructured":"Raymond, J., & Willett, P. (2002). Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computer-Aided Molecular Design, 16, 521\u2013533.","journal-title":"Journal of Computer-Aided Molecular Design"},{"key":"5193_CR25","series-title":"Lecture notes in artificial intelligence","first-page":"197","volume-title":"Proceedings of the eleventh international conference on discovery science","author":"L. Schietgat","year":"2008","unstructured":"Schietgat, L., Ramon, J., Bruynooghe, M., & Blockeel, H. (2008). An efficiently computable graph-based metric for the classification of small molecules. In Lecture notes in artificial intelligence : Vol. 5255. Proceedings of the eleventh international conference on discovery science (pp. 197\u2013209). Berlin: Springer."},{"key":"5193_CR26","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/3540635149_55","volume-title":"Proceedings of the seventh international workshop on inductive logic programming","author":"M. Sebag","year":"1997","unstructured":"Sebag, M. (1997). Distance induction in first order logic. In N. Lavra\u010d & S. D\u017eeroski (Eds.), Lecture notes in artificial intelligence : Vol. 1297. Proceedings of the seventh international workshop on inductive logic programming (pp. 264\u2013272). Berlin: Springer."},{"issue":"suppl_1","key":"5193_CR27","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1093\/bioinformatics\/bti1055","volume":"21","author":"S. J. Swamidass","year":"2005","unstructured":"Swamidass, S. J., Chen, J., Bruand, J., Phung, P., Ralaivola, L., & Baldi, P. (2005). Kernels for small molecules and the prediction of mutagenicity, toxicity and anti-cancer activity. Bioinformatics, 21(suppl_1), 359\u2013368.","journal-title":"Bioinformatics"},{"key":"5193_CR28","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","volume":"14","author":"N. Wale","year":"2008","unstructured":"Wale, N., Watson, I., & Karypis, G. (2008). Comparison of descriptor spaces for chemical compound retrieval and classification. Knowledge and Information Systems, 14, 347\u2013375.","journal-title":"Knowledge and Information Systems"},{"issue":"1","key":"5193_CR29","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1147\/rd.41.0066","volume":"4","author":"S. Watanabe","year":"1960","unstructured":"Watanabe, S. (1960). Information theoretical analysis of multivariate correlation. IBM Journal of Research and Development, 4(1), 66\u201382.","journal-title":"IBM Journal of Research and Development"},{"issue":"23\/24","key":"5193_CR30","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1016\/j.drudis.2006.10.005","volume":"11","author":"P. Willett","year":"2006","unstructured":"Willett, P. (2006). Similarity-based virtual screening using 2D fingerprints. Drug Discovery Today, 11(23\/24), 1046\u20131051.","journal-title":"Drug Discovery Today"},{"key":"5193_CR31","first-page":"721","volume-title":"Proceedings of the 2002 IEEE international conference on data mining, ICDM 2002","author":"X. Yan","year":"2002","unstructured":"Yan, X., & Han, J. (2002). gSpan: Graph-based substructure pattern mining. In Proceedings of the 2002 IEEE international conference on data mining, ICDM 2002, Japan (pp. 721\u2013724). Las Alamitos: IEEE Comput. Soc."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5193-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-010-5193-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5193-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:29Z","timestamp":1559338829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-010-5193-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,20]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["5193"],"URL":"https:\/\/doi.org\/10.1007\/s10994-010-5193-8","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,20]]}}}