{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:39:04Z","timestamp":1725464344874},"publisher-location":"Berlin\/Heidelberg","reference-count":21,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540313133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-31314-1_8","type":"book-chapter","created":{"date-parts":[[2006,4,19]],"date-time":"2006-04-19T17:56:00Z","timestamp":1145469360000},"page":"75-86","source":"Crossref","is-referenced-by-count":0,"title":["Kernels for Predictive Graph Mining"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Wrobel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"G\u00e4rtner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\u20132","key":"8_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"BODLAENDER, H.L. (1998): A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209(1\u20132):1\u201345.","journal-title":"Theoretical Computer Science"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"BORGELT, C., and BERTHOLD, M.R. (2002): Mining molecular fragments: Finding relevant substructures of molecules. Proc. IEEE Int. Conf. on Data Mining, pp. 51\u201358. IEEE Computer Society.","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"DESHPANDE, M., KURAMOCHI, M., and KARYPIS, G. (2002): Automated approaches for classifying structures. Proc. 2nd ACM SIGKDD Workshop on Data Mining in Bioinformatics, pp. 11\u201318.","DOI":"10.21236\/ADA439498"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"DESHPANDE, M., KURAMOCHI, M., and KARYPIS, G. (2003): Frequent substructure based approaches for classifying chemical compounds. Proc. 3rd IEEE Int. Conf. on Data Mining, pp. 35\u201342. IEEE Computer Society.","DOI":"10.1109\/ICDM.2003.1250900"},{"issue":"1","key":"8_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/959242.959248","volume":"5","author":"T. G\u00e4rtner","year":"2003","unstructured":"G\u00c4RTNER, T. (2003): A survey of kernels for structured data. SIGKDD Explorations, 5(1):49\u201358.","journal-title":"SIGKDD Explorations"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"G\u00c4RTNER, T. (2005): Predictive graph mining with kernel methods. In: S. Bandyopadhyay, D. Cook, U. Maulik, and L. Holder, editors, Advanced Methods for Knowledge Discovery from Complex Data, to appear.","DOI":"10.1007\/1-84628-284-5_4"},{"key":"8_CR7","first-page":"129","volume-title":"16th Annual Conf. on Computational Learning Theory and 7th Kernel Workshop","author":"T. G\u00e4rtner","year":"2003","unstructured":"G\u00c4RTNER, T., FLACH, P.A., and WROBEL, S. (2003): On graph kernels: Hardness results and efficient alternatives. 16th Annual Conf. on Computational Learning Theory and 7th Kernel Workshop, pp. 129\u2013143. Springer Verlag, Berlin."},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"2005","DOI":"10.1023\/B:MACH.0000039777.23772.30","volume":"57","author":"T. G\u00e4rtner","year":"2004","unstructured":"G\u00c4RTNER, T., LLOYD, J., and FLACH, P. (2004): Kernels and distances for structured data. Machine Learning, 57(3):2005\u2013232.","journal-title":"Machine Learning"},{"key":"8_CR9","unstructured":"GRAEPEL, T. (2002): PAC-Bayesian Pattern Classification with Kernels. PhD thesis, TU Berlin."},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/11430919_93","volume-title":"Proc. Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conf.","author":"T. Horv\u00e1th","year":"2005","unstructured":"HORV\u00c1TH, T. (2005): Cyclic pattern kernels revisited. Proc. Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conf., pp. 791\u2013801. Springer Verlag, Berlin."},{"key":"8_CR11","first-page":"158","volume-title":"Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"T. Horv\u00e1th","year":"2004","unstructured":"HORV\u00c1TH, T., G\u00c4RTNER, T., and WROBEL, S. (2004): Cyclic pattern kernels for predictive graph mining. Proc. 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 158\u2013167. ACM Press, New York."},{"issue":"1\u20132","key":"8_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0004-3702(01)00062-5","volume":"128","author":"T. Horv\u00e1th","year":"2001","unstructured":"HORV\u00c1TH, T., and TUR\u00c1N, G. (2001): Learning logic programs with structured background knowledge. Artificial Intelligence, 128(1\u20132):31\u201397.","journal-title":"Artificial Intelligence"},{"key":"8_CR13","first-page":"169","volume-title":"Advances in Kernel Methods \u2014 Support Vector Learning","author":"T. Joachims","year":"1999","unstructured":"JOACHIMS, T. (1999): Making large-scale SVM learning practical. In: B. Sch\u00f6lkopf, C.J.C. Burges, and A.J. Smola, editors. Advances in Kernel Methods \u2014 Support Vector Learning, pp. 169\u2013184. MIT Press, Cambridge, MA."},{"key":"8_CR14","first-page":"136","volume-title":"Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"S. Kramer","year":"2001","unstructured":"KRAMER, S., DE RAEDT, L., and HELMA, C. (2001): Molecular feature mining in HIV data. Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 136\u2013143. ACM Press, New York."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"KURAMOCHI, M., and KARYPIS, G. (2001): Frequent subgraph discovery. Proc. IEEE Int. Conf. on Data Mining, pp. 313\u2013320. IEEE Computer Society.","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"3","key":"8_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"R.C. Read","year":"1975","unstructured":"READ, R.C., and TARJAN, R.E. (1975): Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks, 5(3):237\u2013252.","journal-title":"Networks"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"ROBERTSON, N., and SEYMOUR, P.D. (1986): Graph minors. II. Algorithmic Aspects of Tree-Width. J. Algorithms, 7(3):309\u2013322.","journal-title":"J. Algorithms"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"SHAWE-TAYLOR, J., and CRISTIANINI, N. (2004): Kernel Methods for Pattern Analysis. Cambridge University Press.","DOI":"10.1017\/CBO9780511809682"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"VALIANT, L.G. (1979): The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410\u2013421.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR20","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"VAPNIK, V. (1998): Statistical Learning Theory. J. Wiley & Sons, Chichester."},{"key":"8_CR21","first-page":"71","volume-title":"Proc. 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"M. Zaki","year":"2002","unstructured":"ZAKI, M. (2002): Efficiently mining frequent trees in a forest. Proc. 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 71\u201380. ACM Press, New York."}],"container-title":["Studies in Classification, Data Analysis, and Knowledge Organization","From Data and Information Analysis to Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-31314-1_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:51:15Z","timestamp":1605646275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-31314-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540313133"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-31314-1_8","relation":{},"subject":[]}}