{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:28:36Z","timestamp":1725460116466},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341656"},{"type":"electronic","value":"9783642341663"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34166-3_5","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T09:27:14Z","timestamp":1350898034000},"page":"42-50","source":"Crossref","is-referenced-by-count":2,"title":["Graph Kernels: Crossing Information from Different Patterns Using Graph Edit Distance"],"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":[{"key":"5_CR1","unstructured":"Brun, L., Ga\u00fcz\u00e9re, B., Fourey, S.: Relationships between graph edit distance and maximal common unlabeled subgraph. Technical report, CNRS UMR 6072 GREYC (2012), http:\/\/hal.archives-ouvertes.fr\/hal-00714879"},{"issue":"9","key":"5_CR2","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H. Bunke","year":"1999","unstructured":"Bunke, H.: Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a021(9), 917\u2013922 (1999)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-20844-7_11","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S. Fankhauser","year":"2011","unstructured":"Fankhauser, S., Riesen, K., Bunke, H.: Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol.\u00a06658, pp. 102\u2013111. Springer, Heidelberg (2011)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Ga\u00fcz\u00e8re, B., Brun, L., Villemin, D.: Two new graph kernels and applications to chemoinformatics. Pattern Recognition Lett. (in Press, 2012)","DOI":"10.1007\/978-3-642-20844-7_12"},{"key":"5_CR5","unstructured":"Haussler, D.: Convolution kernels on discrete structures. Technical report, Dept. of Computer Science, University of California at Santa Cruz (1999)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Kernels for graphs, ch.\u00a07, pp. 155\u2013170. MIT Press (2004)","DOI":"10.7551\/mitpress\/4057.003.0010"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-008-5086-2","volume":"75","author":"P. Mah\u00e9","year":"2009","unstructured":"Mah\u00e9, P., Vert, J.-P.: Graph kernels based on tree patterns for molecules. Machine Learning\u00a075(1), 3\u201335 (2009)","journal-title":"Machine Learning"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Neuhaus, M., Bunke, H.: Bridging the gap between graph edit distance and kernel machines. World Scientific Pub. Co. Inc. (2007)","DOI":"10.1142\/6523"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K. Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Information Processing Letters\u00a042(3), 133\u2013139 (1992)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34166-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T15:18:09Z","timestamp":1714490289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34166-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341656","9783642341663"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34166-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}