{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:29:38Z","timestamp":1762324178200,"version":"3.37.3"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/tnnls.2017.2771830","type":"journal-article","created":{"date-parts":[[2017,12,4]],"date-time":"2017-12-04T19:18:21Z","timestamp":1512415101000},"page":"4660-4671","source":"Crossref","is-referenced-by-count":10,"title":["Learning With Kernels: A Local Rademacher Complexity-Based Analysis With Application to Graph Kernels"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8445-395X","authenticated-orcid":false,"given":"Luca","family":"Oneto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4108-1754","authenticated-orcid":false,"given":"Nicolo","family":"Navarin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Donini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0612-8219","authenticated-orcid":false,"given":"Sandro","family":"Ridella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8686-850X","authenticated-orcid":false,"given":"Alessandro","family":"Sperduti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Aiolli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Anguita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1449","article-title":"Fast computation of graph kernels","author":"vishwanathan","year":"2006","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref38","first-page":"70","article-title":"Extensions of marginalized graph kernels","author":"mah\u00e9","year":"2004","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref33","first-page":"101","article-title":"On the best constant in the Khintchine-Kahane inequality","volume":"109","author":"lata?a","year":"1994","journal-title":"Studia Math"},{"journal-title":"Learning with square loss Localization through offset rademacher complexity","year":"2015","author":"liang","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1013137"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682"},{"key":"ref37","first-page":"321","article-title":"Marginalized kernels between labeled graphs","author":"kashima","year":"2003","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref36","volume":"68","author":"beauzamy","year":"2011","journal-title":"Introduction to Banach Spaces and Their Geometry"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0114-x"},{"key":"ref34","first-page":"759","article-title":"On the performance of kernel classes","volume":"4","author":"mendelson","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176992069"},{"key":"ref40","first-page":"8","article-title":"Shortest-path kernels on graphs","author":"borgwardt","year":"2005","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.930926"},{"key":"ref12","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"bartlett","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-015-9429-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000282"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/009053606000001019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2015.02.006"},{"key":"ref17","first-page":"2438","article-title":"The local rademacher complexity of $\\ell _{p}$ -norm multiple kernel learning","author":"kloft","year":"2011","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref18","first-page":"173","article-title":"Theory and algorithms for the localized setting of learning kernels","volume":"44","author":"lei","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2307359"},{"key":"ref28","first-page":"671","article-title":"Structured sparsity and generalization","volume":"13","author":"maurer","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7443.001.0001","author":"bakir","year":"2007","journal-title":"Predicting Structured Data"},{"key":"ref27","first-page":"173","article-title":"Feature and kernel learning","author":"bol\u00f3n-canedo","year":"2015","journal-title":"Proc Euro Symp Artif Neural Netw (ESANN)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/009053607000000677"},{"key":"ref6","first-page":"2760","article-title":"Learning kernels using local rademacher complexity","author":"cortes","year":"2013","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref29","first-page":"787","article-title":"Risk bounds for the majority vote: From a PAC-Bayesian analysis to a learning algorithm","volume":"16","author":"germain","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref5","first-page":"2211","article-title":"Multiple kernel learning algorithms","volume":"12","author":"g\u00f6nen","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref8","first-page":"1137","article-title":"A study of cross-validation and bootstrap for accuracy estimation and model selection","author":"kohavi","year":"1995","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.11.078"},{"journal-title":"Statistical Learning Theory","year":"1998","author":"vapnik","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2012.2202401"},{"journal-title":"Learning With Kernels Support Vector Machines Regularization Optimization and Beyond","year":"2002","author":"sch\u00f6lkopf","key":"ref1"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0103-5"},{"key":"ref20","first-page":"1201","article-title":"Graph kernels","volume":"11","author":"vishwanathan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1093\/jnci\/81.8.577"},{"key":"ref48","first-page":"441","article-title":"The ‘K’ in K-fold cross validation","author":"anguita","year":"2012","journal-title":"Proc Eur Symp Artif Neural Netw -Adv Comput Intell Learn"},{"key":"ref22","first-page":"1","article-title":"A memory efficient graph kernel","author":"da san martino","year":"2012","journal-title":"Proc Int Joint Conf Neural Netw"},{"journal-title":"Statistical Inference","year":"2002","author":"casella","key":"ref47"},{"key":"ref21","first-page":"219","article-title":"Exploiting the odd framework to define a novel effective graph kernel","author":"da san martino","year":"2015","journal-title":"Proc Eur Symp Artif Neural Netw -Adv Comput Intell Learn"},{"key":"ref42","first-page":"1660","article-title":"Fast subtree kernels on graphs","author":"shervashidze","year":"2009","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref24","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"shervashidze","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref41","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","author":"shervashidze","year":"2009","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref23","first-page":"255","article-title":"Fast neighborhood subgraph pairwise distance kernel","author":"costa","year":"2010","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1021\/ci034254q"},{"key":"ref26","first-page":"24","article-title":"On graph kernels: Hardness results and efficient alternatives","author":"g\u00e4rtner","year":"2003","journal-title":"Proc Comput Learn Theory"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"ref25","first-page":"12","article-title":"A tree-based kernel for graphs","author":"da san martino","year":"2012","journal-title":"Proc SIAM Int Conf Data Mining"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8468244\/08126262.pdf?arnumber=8126262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:28:58Z","timestamp":1642004938000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8126262\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":48,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2017.2771830","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}