{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T03:41:42Z","timestamp":1794454902530,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642411809","type":"print"},{"value":"9783642411816","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41181-6_19","type":"book-chapter","created":{"date-parts":[[2013,9,2]],"date-time":"2013-09-02T08:03:54Z","timestamp":1378109034000},"page":"181-190","source":"Crossref","is-referenced-by-count":2,"title":["A Fast Jensen-Shannon Subgraph Kernel"],"prefix":"10.1007","author":[{"given":"Lu","family":"Bai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Amizadeh, S., Wang, S., Hauskrecht, M.: An efficient framework for constructing generalized locally-induced text metrics. In: Proceedings of International Joint Conference on Artificial Intelligence, pp. 1159\u20131164 (2011)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Bai, L., Hancock, E.: Graph kernels from the Jensen-Shannon divergence. Journal of Mathematical Imaging and Vision (to appear 2013)","DOI":"10.1109\/ICPR.2014.25"},{"key":"19_CR3","unstructured":"Borgwardt, K.M., Kriegel, H.-P.: Shortest-path kernels on graphs. In: Proceedings of the IEEE International Conference on Data Mining, pp. 74\u201381 (2005)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1103\/PhysRevE.59.275","volume":"59","author":"J.P. Crutchfield","year":"1999","unstructured":"Crutchfield, J.P., Shalizi, C.R.: Thermodynamic depth of causal states: Objective complexity via minimal representations. Physical Review E\u00a059, 275\u2013283 (1999)","journal-title":"Physical Review E"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, T., Driessens, K., Ramon, J.: Graph kernels and gaussian processes for relational reinforcement learning. In: Proceedings of International Conference on Inductive Logic Programming, pp. 146\u2013163 (2003)","DOI":"10.1007\/978-3-540-39917-9_11"},{"key":"19_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","volume-title":"Learning Theory and Kernel Machines","author":"T. G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T., Flach, P.A., Wrobel, S.: On graph kernels: Hardness results and efficient alternatives. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT\/Kernel 2003. LNCS (LNAI), vol.\u00a02777, pp. 129\u2013143. Springer, Heidelberg (2003)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1016\/j.patrec.2012.03.016","volume":"33","author":"L. Han","year":"2012","unstructured":"Han, L., Escolano, F., Hancock, E.R., Wilson, R.C.: Graph characterizations from von neumann entropy. Pattern Recognition Letters\u00a033, 1958\u20131967 (2012)","journal-title":"Pattern Recognition Letters"},{"key":"19_CR8","unstructured":"Haussler, D.: Convolution kernels on discrete structures. In: Technical Report UCS-CRL-99-10 (1999)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"D.B. Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. Journal of the ACM\u00a024, 1\u201313 (1977)","journal-title":"Journal of the ACM"},{"key":"19_CR10","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proceedings of International Conference on Machine Learing, pp. 321\u2013328 (2003)"},{"key":"19_CR11","first-page":"935","volume":"10","author":"A.F. Martins","year":"2009","unstructured":"Martins, A.F., Smith, N.A., Xing, E.P., Aguiar, P.M., Figueiredo, M.A.: Nonextensive information theoretic kernels on measures. Journal of Machine Learning Research\u00a010, 935\u2013975 (2009)","journal-title":"Journal of Machine Learning Research"},{"key":"19_CR12","unstructured":"Nori, N., Bollegala, D., Ishizuka, M.: Interest prediction on multinomial, time-evolving social graph. In: Proceedings of International Joint Conference on Artificial Intelligence, pp. 2507\u20132512 (2011)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Platt, J.C.: Fast training of support vector machines ssing sequential minimal optimization. In: Sch\u00f6lkopf, B., Burges, C.J.C., Smola, A.J. (eds.) Advances in Kernel Methods, pp. 185\u2013208 (1999)","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1016\/j.patcog.2010.06.011","volume":"44","author":"P. Ren","year":"2011","unstructured":"Ren, P., Aleksic, T., Wilson, R.C., Hancock, E.R.: A polynomial characterization of hypergraphs using the ihara zeta function. Pattern Recognition\u00a044, 1941\u20131957 (2011)","journal-title":"Pattern Recognition"},{"key":"19_CR15","first-page":"1","volume":"1","author":"N. Shervashidze","year":"2010","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-lehman graph kernels. Journal of Machine Learning Research\u00a01, 1\u201348 (2010)","journal-title":"Journal of Machine Learning Research"},{"key":"19_CR16","first-page":"488","volume":"5","author":"N. Shervashidze","year":"2009","unstructured":"Shervashidze, N., Vishwanathan, S.V.N., Petri, T., Mehlhorn, K., Borgwardt, K.M.: Efficient graphlet kernels for large graph comparison. Journal of Machine Learning Research\u00a05, 488\u2013495 (2009)","journal-title":"Journal of Machine Learning Research"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/jgt.3190020304","volume":"2","author":"P.J. Slater","year":"1978","unstructured":"Slater, P.J.: Centers to centroids in graphs. Journal of Graph Theory\u00a02, 209\u2013222 (1978)","journal-title":"Journal of Graph Theory"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1109\/TPAMI.2005.145","volume":"27","author":"R.C. Wilson","year":"2005","unstructured":"Wilson, R.C., Hancock, E.R., Luo, B.: Pattern vectors from algebraic graph theory. IEEE Trans. Pattern Anal. Mach. Intell.\u00a027, 1112\u20131124 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","Image Analysis and Processing \u2013 ICIAP 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41181-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T03:47:00Z","timestamp":1688442420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41181-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642411809","9783642411816"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41181-6_19","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-41181-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}