{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:46:38Z","timestamp":1743043598557,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208430"},{"type":"electronic","value":"9783642208447"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20844-7_12","type":"book-chapter","created":{"date-parts":[[2011,5,4]],"date-time":"2011-05-04T09:48:38Z","timestamp":1304502518000},"page":"112-121","source":"Crossref","is-referenced-by-count":6,"title":["Two New Graph Kernels and Applications to Chemoinformatics"],"prefix":"10.1007","author":[{"given":"Benoit","family":"Ga\u00fcz\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Brun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"Villemin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Brun, L., Conte, D., Foggia, P., Vento, M., Villemin, D.: Symbolic learning vs. graph kernels: An experimental comparison in a chemical application. In: Proc. of the 1st Int. Workshop on Querying Graph Structured Data (2010)","key":"12_CR1"},{"doi-asserted-by":"crossref","unstructured":"Cherqaoui, D., Villemin, D.: Use of a neural network to determine the boiling point of alkanes. Journal of the Chemical Society, Faraday Transactions (1994)","key":"12_CR2","DOI":"10.1039\/ft9949000097"},{"doi-asserted-by":"crossref","unstructured":"Chung, F.R.K.: Spectral graph theory. In: AMSP (1997)","key":"12_CR3","DOI":"10.1090\/cbms\/092"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-04146-4_31","volume-title":"Image Analysis and Processing \u2013 ICIAP 2009","author":"F.-X. Dup\u00e9","year":"2009","unstructured":"Dup\u00e9, F.-X., Brun, L.: Tree covering within a graph kernel framework for shape classification. In: Foggia, P., Sansone, C., Vento, M. (eds.) ICIAP 2009. LNCS, vol.\u00a05716, pp. 278\u2013287. Springer, Heidelberg (2009)"},{"key":"12_CR5","first-page":"155","volume-title":"Kernels for graphs","author":"H. Kashima","year":"2004","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Kernels for graphs,\u00a0ch. 7, pp. 155\u2013170. MIT Press, Cambridge (2004)"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-008-5086-2","volume":"75","author":"P. Mah\u00e9","year":"2008","unstructured":"Mah\u00e9, P., Vert, J.-P.: Graph kernels based on tree patterns for molecules. Machine Learning\u00a075(1), 3\u201335 (2008)","journal-title":"Machine Learning"},{"key":"12_CR7","doi-asserted-by":"publisher","DOI":"10.1142\/6523","volume-title":"Bridging the gap between graph edit distance and kernel machines","author":"M. Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: Bridging the gap between graph edit distance and kernel machines. World Scientific Pub. Co. Inc., Singapore (2007)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-04125-9_8","volume-title":"Foundations of Intelligent Systems","author":"G. Poezevara","year":"2009","unstructured":"Poezevara, G., Cuissart, B., Cr\u00e9milleux, B.: Discovering emerging graph patterns from chemicals. In: Rauch, J., Ra\u015b, Z.W., Berka, P., Elomaa, T. (eds.) ISMIS 2009. LNCS, vol.\u00a05722, pp. 45\u201355. Springer, Heidelberg (2009)"},{"unstructured":"Ramon, J., G\u00e4rtner, T.: Expressivity versus efficiency of graph kernels. In: 1st Int. Workshop on Mining Graphs, Trees and Sequences, pp. 65\u201374 (2003)","key":"12_CR9"},{"key":"12_CR10","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BFb0067377","volume-title":"Graph Theory and Applications","author":"R. Read","year":"1972","unstructured":"Read, R.: Some recent results in chemical enumeration. In: Alavi, Y., Lick, D., White, A. (eds.) Graph Theory and Applications. Lecture Notes in Mathematics, vol.\u00a0303, pp. 243\u2013259. Springer, Heidelberg (1972)"},{"issue":"7","key":"12_CR11","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K. Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing\u00a027(7), 950\u2013959 (2009)","journal-title":"Image and Vision Computing"},{"unstructured":"Shervashidze, N., Vishwanathan, S.V.N., Petri, T.H., Mehlhorn, K., Borgwardt, K.M.: Efficient graphlet kernels for large graph comparison. In: Proceedings of AIStats, pp. 488\u2013495 (2009)","key":"12_CR12"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-45167-9_12","volume-title":"Learning theory and Kernel machines: 16th Annual Conference on Learning Theory and 7th Kernel Workshop","author":"A.J. Smola","year":"2003","unstructured":"Smola, A.J., Kondor, R.: Kernels and regularization on graphs. In: Learning theory and Kernel machines: 16th Annual Conference on Learning Theory and 7th Kernel Workshop, p. 144. Springer, Heidelberg (2003)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"3271","DOI":"10.1016\/j.patcog.2008.06.011","volume":"41","author":"F. Steinke","year":"2008","unstructured":"Steinke, F., Sch\u00f6lkopf, B.: Kernels, regularization and differential equations. Pattern Recogn.\u00a041, 3271\u20133286 (2008)","journal-title":"Pattern Recogn."},{"unstructured":"Suard, F., Rakotomamonjy, A., Bensrhair, A.: Kernel on bag of paths for measuring similarity of shapes. In: European Symposium on Artificial Neural Networks (2002)","key":"12_CR15"},{"unstructured":"Vishwanathan, S.V.N., Borgwardt, K.M., Kondor, I.R., Schraudolph, N.N.: Graph Kernels. Neural Networks (2008)","key":"12_CR16"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20844-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T02:21:19Z","timestamp":1558578079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20844-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208430","9783642208447"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20844-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}