{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:08:13Z","timestamp":1729616893934,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/ijcnn.2012.6252831","type":"proceedings-article","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T20:47:51Z","timestamp":1343854071000},"page":"1-7","source":"Crossref","is-referenced-by-count":4,"title":["A memory efficient graph kernel"],"prefix":"10.1109","author":[{"given":"Giovanni","family":"Da San Martino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolo","family":"Navarin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Sperduti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1093\/jnci\/81.8.577"},{"key":"11","article-title":"Convolution kernels on discrete structures","author":"haussler","year":"1999","journal-title":"University of California Santa Cruz Technical Report"},{"key":"12","first-page":"1","article-title":"Combining SVMs with various feature selection strategies","author":"chen","year":"0","journal-title":"Strategy"},{"key":"3","article-title":"Fast neighborhood subgraph pairwise distance kernel","author":"costa","year":"2010","journal-title":"Proceedings of the International Conference on Machine Learning"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","article-title":"On graph kernels: Hardness results and efficient alternatives","author":"ga?rtner","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"key":"10","first-page":"569","article-title":"Fast kernels for string and tree matching","volume":"15","author":"vishwanathan","year":"2003","journal-title":"Advances in neural information processing systems"},{"journal-title":"Statistical Learning Theory","year":"1998","author":"vapnik","key":"7"},{"key":"6","first-page":"1","article-title":"Maximum common subgraph mining: A fast and effective approach towards feature generation","author":"schietgat","year":"2009","journal-title":"7th International Workshop on Mining and Learning with Graphs"},{"key":"5","first-page":"1660","article-title":"Fast subtree kernels on graphs","volume":"22","author":"shervashidze","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5086-2"},{"key":"9","article-title":"A tree-based kernel for graphs","author":"da san martino","year":"2012","journal-title":"SIAM International Conference on Data Mining"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-008-5089-z"}],"event":{"name":"2012 International Joint Conference on Neural Networks (IJCNN 2012 - Brisbane)","start":{"date-parts":[[2012,6,10]]},"location":"Brisbane, Australia","end":{"date-parts":[[2012,6,15]]}},"container-title":["The 2012 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6241467\/6252360\/06252831.pdf?arnumber=6252831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T22:19:21Z","timestamp":1497997161000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6252831\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2012.6252831","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}