{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:32:01Z","timestamp":1740123121335,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T00:00:00Z","timestamp":1510617600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10994-017-5688-7","type":"journal-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T16:39:57Z","timestamp":1510677597000},"page":"1847-1873","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Probabilistic frequent subtrees for efficient graph classification and retrieval"],"prefix":"10.1007","volume":"107","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2123-3781","authenticated-orcid":false,"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":[[2017,11,14]]},"reference":[{"key":"5688_CR1","doi-asserted-by":"publisher","unstructured":"Broder, A. Z. (1997). On the resemblance and containment of documents. In Proceedings of compression and complexity of sequences, IEEE computer society (pp. 21\u201329). IEEE. \n                    https:\/\/doi.org\/10.1109\/sequen.1997.666900\n                    \n                  .","DOI":"10.1109\/sequen.1997.666900"},{"issue":"3","key":"5688_CR2","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"AZ Broder","year":"2000","unstructured":"Broder, A. Z., Charikar, M., Frieze, A. M., & Mitzenmacher, M. (2000). Min-wise independent permutations. Journal of Computer and System Sciences, 60(3), 630\u2013659. \n                    https:\/\/doi.org\/10.1006\/jcss.1999.1690\n                    \n                  .","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"5688_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C. C., & Lin, C. J. (2011). Libsvm: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology, 2(3), 1\u201327. \n                    https:\/\/doi.org\/10.1145\/1961189.1961199\n                    \n                  .","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"1\u20132","key":"5688_CR4","first-page":"161","volume":"66","author":"Y Chi","year":"2005","unstructured":"Chi, Y., Muntz, R. R., Nijssen, S., & Kok, J. N. (2005). Frequent subtree mining\u2014An overview. Fundamenta Informaticae, 66(1\u20132), 161\u2013198.","journal-title":"Fundamenta Informaticae"},{"issue":"8","key":"5688_CR5","doi-asserted-by":"publisher","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. (2005). Frequent substructure-based approaches for classifying chemical compounds. Transactions on Knowledge and Data Engineering, 17(8), 1036\u20131050. \n                    https:\/\/doi.org\/10.1109\/tkde.2005.127\n                    \n                  .","journal-title":"Transactions on Knowledge and Data Engineering"},{"key":"5688_CR6","volume-title":"Graph theory, graduate texts in mathematics","author":"R Diestel","year":"2012","unstructured":"Diestel, R. (2012). Graph theory, graduate texts in mathematics (4th ed., Vol. 173). Berlin: Springer.","edition":"4"},{"key":"5688_CR7","unstructured":"Erd\u0151s, P., & R\u00e9nyi, A. (1959). On random graphs. Publicationes Mathematicae, 6(290\u2013297)."},{"key":"5688_CR8","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W. H. Freeman."},{"key":"5688_CR9","doi-asserted-by":"publisher","unstructured":"G\u00e4rtner, T., Flach, P., & Wrobel, S. (2003). On graph kernels: Hardness results and efficient alternatives. In B. Sch\u00f6lkopf & M. K. Warmuth (Eds.), Proceedings of annual conference on computational learning theory and kernel workshop, (COLT\/kernel), lecture notes in computer science (Vol. 2777, pp. 129\u2013143). Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-3-540-45167-9_11\n                    \n                  .","DOI":"10.1007\/978-3-540-45167-9_11"},{"issue":"4","key":"5688_CR10","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1021\/ci700461s","volume":"48","author":"H Geppert","year":"2008","unstructured":"Geppert, H., Horv\u00e1th, T., G\u00e4rtner, T., Wrobel, S., & Bajorath, J. (2008). Support-vector-machine-based ranking significantly improves the effectiveness of similarity searching using 2d fingerprints and multiple reference compounds. Journal of Chemical Information and Modeling, 48(4), 742\u2013746. \n                    https:\/\/doi.org\/10.1021\/ci700461s\n                    \n                  .","journal-title":"Journal of Chemical Information and Modeling"},{"issue":"31\u201333","key":"5688_CR11","doi-asserted-by":"publisher","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. (2010). Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theoretical Computer Science, 411(31\u201333), 2784\u20132797. \n                    https:\/\/doi.org\/10.1016\/j.tcs.2010.03.030\n                    \n                  .","journal-title":"Theoretical Computer Science"},{"key":"5688_CR12","doi-asserted-by":"publisher","unstructured":"Horv\u00e1th, T., Bringmann, B., & Raedt, L. D. (2007). Frequent hypergraph mining. In S. Muggleton, R. P. Otero, & A. Tamaddoni-Nezhad (Eds.), Inductive logic programming (ILP) revised selected papers, lecture notes in computer science (Vol. 4455, pp. 244\u2013259). Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-3-540-73847-3_26","DOI":"10.1007\/978-3-540-73847-3_26"},{"issue":"3","key":"5688_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila, H., & Toivonen, H. (1997). Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3), 241\u2013258. \n                    https:\/\/doi.org\/10.1023\/a:1009796218281\n                    \n                  .","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1","key":"5688_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2004.12.039","volume":"127","author":"S Nijssen","year":"2005","unstructured":"Nijssen, S., & Kok, J. N. (2005). The gaston tool for frequent subgraph mining. Electronic Notes in Theoretical Computer Science, 127(1), 77\u201387. \n                    https:\/\/doi.org\/10.1016\/j.entcs.2004.12.039\n                    \n                  .","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"8","key":"5688_CR15","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/j.neunet.2005.07.009","volume":"18","author":"L Ralaivola","year":"2005","unstructured":"Ralaivola, L., Swamidass, S. J., Saigo, H., & Baldi, P. (2005). Graph kernels for chemical informatics. Neural Networks, 18(8), 1093\u20131110. \n                    https:\/\/doi.org\/10.1016\/j.neunet.2005.07.009\n                    \n                  .","journal-title":"Neural Networks"},{"issue":"2","key":"5688_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1999.1044","volume":"33","author":"R Shamir","year":"1999","unstructured":"Shamir, R., & Tsur, D. (1999). Faster subtree isomorphism. Journal of Algorithms, 33(2), 267\u2013280. \n                    https:\/\/doi.org\/10.1006\/jagm.1999.1044\n                    \n                  .","journal-title":"Journal of Algorithms"},{"key":"5688_CR17","doi-asserted-by":"publisher","first-page":"2615","DOI":"10.1145\/1577069.1755873","volume":"10","author":"Q Shi","year":"2009","unstructured":"Shi, Q., Petterson, J., Dror, G., Langford, J., Smola, A. J., & Vishwanathan, S. V. N. (2009). Hash kernels for structured data. Journal of Machine Learning Research, 10, 2615\u20132637. \n                    https:\/\/doi.org\/10.1145\/1577069.1755873\n                    \n                  .","journal-title":"Journal of Machine Learning Research"},{"key":"5688_CR18","unstructured":"Teixeira, C. H. C., Silva, A., & Jr Meira, W. (2012). Min-hash fingerprints for graph kernels: A trade-off among accuracy, efficiency, and compression. Journal of Information and Data Management, 3(3), 227\u2013242. \n                    http:\/\/ser.lcc.ufmg.br\/index.php\/jidm\/article\/view\/199\n                    \n                  ."},{"key":"5688_CR19","doi-asserted-by":"publisher","unstructured":"Welke, P., Horv\u00e1th, T., & Wrobel, S. (2016a). Min-hashing for probabilistic frequent subtree feature spaces. In T. Calders, M. Ceci, & D. Malerba (Eds.), Proceedings of discovery science (DS), lecture notes in computer science (Vol. 9956, pp. 67\u201382). \n                    https:\/\/doi.org\/10.1007\/978-3-319-46307-0_5\n                    \n                  .","DOI":"10.1007\/978-3-319-46307-0_5"},{"key":"5688_CR20","doi-asserted-by":"publisher","unstructured":"Welke, P., Horv\u00e1th, T., & Wrobel, S. (2016b). Probabilistic frequent subtree kernels. In M. Ceci, C. Loglisci, G. Manco, E. Masciari, & Z. W. Ras (Eds.), New frontiers in mining complex patterns (NFMCP) revised selected papers, lecture notes in computer science (Vol. 9607, pp. 179\u2013193). Berlin: Springer. \n                    https:\/\/doi.org\/10.1007\/978-3-319-39315-5_12\n                    \n                  .","DOI":"10.1007\/978-3-319-39315-5_12"},{"issue":"23","key":"5688_CR21","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1016\/j.drudis.2006.10.005","volume":"11","author":"P Willett","year":"2006","unstructured":"Willett, P. (2006). Similarity-based virtual screening using 2d fingerprints. Drug Discovery Today, 11(23), 1046\u20131053.","journal-title":"Drug Discovery Today"},{"key":"5688_CR22","doi-asserted-by":"publisher","unstructured":"Wilson, D. B. (1996). Generating random spanning trees more quickly than the cover time. In G. L. Miller (Ed.), Proceedings of ACM symposium on the theory of computing (STOC) (pp. 296\u2013303). ACM. \n                    https:\/\/doi.org\/10.1145\/237814.237880\n                    \n                  .","DOI":"10.1145\/237814.237880"},{"issue":"1","key":"5688_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s11280-007-0031-z","volume":"11","author":"P Zhao","year":"2008","unstructured":"Zhao, P., & Yu, J. X. (2008). Fast frequent free tree mining in graph databases. World Wide Web, 11(1), 71\u201392. \n                    https:\/\/doi.org\/10.1007\/s11280-007-0031-z\n                    \n                  .","journal-title":"World Wide Web"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-017-5688-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5688-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5688-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,11,13]],"date-time":"2018-11-13T20:04:38Z","timestamp":1542139478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-017-5688-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,14]]},"references-count":23,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["5688"],"URL":"https:\/\/doi.org\/10.1007\/s10994-017-5688-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2017,11,14]]}}}