{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:08:34Z","timestamp":1725854914872},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319393148"},{"type":"electronic","value":"9783319393155"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39315-5_12","type":"book-chapter","created":{"date-parts":[[2016,5,17]],"date-time":"2016-05-17T15:33:25Z","timestamp":1463499205000},"page":"179-193","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic Frequent Subtree Kernels"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Welke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,18]]},"reference":[{"issue":"3","key":"12_CR1","first-page":"27","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"issue":"1\u20132","key":"12_CR2","first-page":"161","volume":"66","author":"Y Chi","year":"2001","unstructured":"Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining - an overview. Fundam. Inform. 66(1\u20132), 161\u2013198 (2001)","journal-title":"Fundam. Inform."},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"DJ Cook","year":"1994","unstructured":"Cook, D.J., Holder, L.B.: Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. (JAIR) 1, 231\u2013255 (1994)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"3","key":"12_CR4","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"issue":"8","key":"12_CR5","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., Karypis, G.: Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng. 17(8), 1036\u20131050 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"12_CR6","first-page":"290","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. Publicationes Mathematicae 6(5), 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae"},{"key":"12_CR7","unstructured":"G\u00e4rtner, T.: Kernels for structured data. Ph.D. thesis, Universit\u00e4t Bonn (2005)"},{"key":"12_CR8","unstructured":"Haussler, D.: Convolution kernels on discrete structures. Technical report UCSC-CRL-99-10, Univerisity of California - Santa Cruz, July 1999"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/978-3-540-73847-3_26","volume-title":"Inductive Logic Programming","author":"T Horv\u00e1th","year":"2007","unstructured":"Horv\u00e1th, T., Bringmann, B., De Raedt, L.: Frequent hypergraph mining. In: Muggleton, S.H., Otero, R., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol. 4455, pp. 244\u2013259. Springer, Heidelberg (2007)"},{"issue":"31\u201333","key":"12_CR10","doi-asserted-by":"crossref","first-page":"2784","DOI":"10.1016\/j.tcs.2010.03.030","volume":"411","author":"T Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th, T., Ramon, J.: Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theor. Comput. Sci. 411(31\u201333), 2784\u20132797 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"12_CR11","doi-asserted-by":"crossref","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. Mach. Learn. 75(1), 3\u201335 (2009)","journal-title":"Mach. Learn."},{"key":"12_CR12","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., Van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Wilson, D.B.: Generating random spanning trees more quickly than the cover time. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 296\u2013303. ACM (1996)","DOI":"10.1145\/237814.237880"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Mining Complex Patterns"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39315-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T19:15:32Z","timestamp":1567883732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39315-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319393148","9783319393155"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39315-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}