{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T06:29:37Z","timestamp":1780554577773,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642341656","type":"print"},{"value":"9783642341663","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34166-3_20","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T09:27:14Z","timestamp":1350898034000},"page":"181-189","source":"Crossref","is-referenced-by-count":4,"title":["A Jensen-Shannon Kernel for Hypergraphs"],"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"}]},{"given":"Peng","family":"Ren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Berge, C.: Hypergraphs: combinatorics of finite sets. North-Holland (1989)"},{"key":"20_CR2","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":"20_CR3","doi-asserted-by":"publisher","first-page":"2205","DOI":"10.1109\/TPAMI.2010.51","volume":"32","author":"M. Chertok","year":"2010","unstructured":"Chertok, M., Keller, Y.: Efficient high order matching. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a032, 2205\u20132215 (2010)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-22212-2_19","volume-title":"Structural Information and Communication Complexity","author":"C. Cooper","year":"2011","unstructured":"Cooper, C., Frieze, A.M., Radzik, T.: The Cover Times of Random Walks on Hypergraphs. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 210\u2013221. Springer, Heidelberg (2011)"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","volume-title":"Learning Theory and Kernel Machines","author":"Thomas G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T., Flach, P.A., Wrobel, S.: On graph kernels: Hardness results and efficient alternatives. In: Proceedings of the Conference on Computational Learning Theory, pp. 129\u2013143 (2003)"},{"key":"20_CR6","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: Proceedings of the International Conference on Machine Learning, pp. 321\u2013328 (2003)"},{"key":"20_CR7","first-page":"935","volume":"10","author":"A.F.T. Martins","year":"2009","unstructured":"Martins, A.F.T., Smith, N.A., Xing, E.P., Aguiar, P.M.Q., Figueiredo, M.A.T.: Nonextensive information theoretic kernels on measures. Journal of Machine Learning Research\u00a010, 935\u2013975 (2009)","journal-title":"Journal of Machine Learning Research"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1011139631724","volume":"42","author":"A. Oliva","year":"2001","unstructured":"Oliva, A., Torralba, A.: Modeling the shape of the scene: A holistic representation of the spatial envelope. International Journal of Computer Vision\u00a042, 145\u2013175 (2001)","journal-title":"International Journal of Computer Vision"},{"key":"20_CR9","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":"20_CR10","doi-asserted-by":"crossref","unstructured":"Shashua, A., Levin, A.: Linear image coding for regression and classification using the tensor-rank principle. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 42\u201349 (2001)","DOI":"10.1109\/CVPR.2001.990454"},{"key":"20_CR11","unstructured":"Shervashidze, N., Borgwardt, K.M.: Fast subtree kernels on graphs. In: Proceedings of the Neural Information Processing Systems, pp. 1660\u20131668 (2009)"},{"key":"20_CR12","first-page":"1","volume":"1","author":"N. Shervashidze","year":"2010","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E., Mehlhorn, K., Borgwardt, K.: Weisfeiler-lehman graph kernels. Journal of Machine Learning Research\u00a01, 1\u201348 (2010)","journal-title":"Journal of Machine Learning Research"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Wachman, G., Khardon, R.: Learning from interpretations: a rooted kernel for ordered hypergraphs. In: Proceedings of the International Conference on Machine Learning, pp. 943\u2013950 (2007)","DOI":"10.1145\/1273496.1273615"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2008)","DOI":"10.1109\/CVPR.2008.4587500"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34166-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T03:04:00Z","timestamp":1744859040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34166-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341656","9783642341663"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34166-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}