{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T10:59:53Z","timestamp":1681815593724},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T00:00:00Z","timestamp":1274227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s10994-010-5187-6","type":"journal-article","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T19:01:08Z","timestamp":1274209268000},"page":"193-218","source":"Crossref","is-referenced-by-count":7,"title":["Efficient mining for structurally diverse subgraph patterns in large molecular databases"],"prefix":"10.1007","volume":"83","author":[{"given":"Andreas","family":"Maunz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Helma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kramer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,19]]},"reference":[{"key":"5187_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/ICDM.2007.45","volume-title":"Seventh IEEE international conference on data mining (ICDM 2007)","author":"M. Hasan Al","year":"2007","unstructured":"Al\u00a0Hasan, M., Chaoji, V., Salem, S., Besson, J., & Zaki, M. (2007). Origami: mining representative orthogonal graph patterns. In Seventh IEEE international conference on data mining (ICDM 2007) (pp. 153\u2013162). Washington: IEEE Computer Society."},{"issue":"3","key":"5187_CR2","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.mrrev.2008.05.003","volume":"659","author":"R. Benigni","year":"2008","unstructured":"Benigni, R., & Bossa, C. (2008). Structure alerts for carcinogenicity, and the salmonella assay system: a novel insight through the chemical relational databases technology. Mutation Research\/Reviews in Mutation Research, 659(3), 248\u2013261.","journal-title":"Mutation Research\/Reviews in Mutation Research"},{"key":"5187_CR3","first-page":"55","volume-title":"Proceedings 10th PKDD","author":"B. Bringmann","year":"2006","unstructured":"Bringmann, B., Zimmermann, A., Raedt, L. D., & Nijssen, S. (2006). Don\u2019t be afraid of simpler patterns. In Proceedings 10th PKDD (pp. 55\u201366). Berlin: Springer."},{"key":"5187_CR4","unstructured":"Chi, Y., Muntz, R. R., Nijssen, S., & Kok, J. N. (2001). Frequent subtree mining\u2014an overview."},{"key":"5187_CR5","doi-asserted-by":"crossref","unstructured":"Helma, C. (2006). Lazy structure-activity relationships (Lazar) for the prediction of rodent carcinogenicity and salmonella mutagenicity. In Molecular diversity (pp. 147\u2013158).","DOI":"10.1007\/s11030-005-9001-5"},{"key":"5187_CR6","unstructured":"Jahn, K., & Kramer, S. (2005). Optimizing gSpan for molecular datasets. In: Proceedings of the third international workshop on mining graphs, trees and sequences (MGTS-2005)."},{"key":"5187_CR7","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/502512.502533","volume-title":"KDD \u201901: proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining","author":"S. Kramer","year":"2001","unstructured":"Kramer, S., De Raedt, L., & Helma, C. (2001). Molecular feature mining in HIV data. In KDD \u201901: proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining (pp. 136\u2013143). New York: ACM."},{"key":"5187_CR8","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1145\/1557019.1557089","volume-title":"KDD \u201909: proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining","author":"A. Maunz","year":"2009","unstructured":"Maunz, A., Helma, C., & Kramer, S. (2009). Large-scale graph mining using backbone refinement classes. In KDD \u201909: proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 617\u2013626). New York: ACM."},{"key":"5187_CR9","first-page":"226","volume-title":"Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems","author":"S. Morishita","year":"2000","unstructured":"Morishita, S., & Sese, J. (2000). Traversing itemset lattice with statistical metric pruning. In Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (pp. 226\u2013236). New York: ACM."},{"key":"5187_CR10","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/1014052.1014134","volume-title":"KDD \u201904: proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining","author":"S. Nijssen","year":"2004","unstructured":"Nijssen, S., & Kok, J. N. (2004). A quickstart in frequent structure mining can make a difference. In KDD \u201904: proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 647\u2013652). New York: ACM."},{"key":"5187_CR11","unstructured":"Nijssen, S., & Kok, J. N. (2006). Frequent subgraph miners: runtime don\u2019t say everything. In Proceedings of the international workshop on mining and learning with graphs (MLG 2006) (pp. 173\u2013180). Berlin, Germany."},{"key":"5187_CR12","unstructured":"OpenTox: A predictive toxicology framework. http:\/\/www.opentox.org . See also: Hardy, B., Douglas, N., Helma, C.,\u00a0et al.: Collaborative development of predictive toxicology applications fifth international symposium on computational methods in toxicology and pharmacology integrating internet resources (CMTPI 2009) (to appear). London: Taylor & Francis."},{"key":"5187_CR13","first-page":"716","volume-title":"Proceedings of the 18th European conference on machine learning (ECML07)","author":"U. R\u00fcckert","year":"2007","unstructured":"R\u00fcckert, U., & Kramer, S. (2007). Optimizing feature sets for structured data. In Proceedings of the 18th European conference on machine learning (ECML07) (pp. 716\u2013723). Berlin: Springer-Verlag."},{"key":"5187_CR14","doi-asserted-by":"crossref","unstructured":"Schulz, H., Kersting, C., & Karwath, A. ILP, the blind, and the elephant: Euclidean embedding of co-proven queries. In 19th international conference on inductive logic programming (ILP 2009). http:\/\/www.cs.kuleuven.be\/dtai\/ilp-mlg-srl\/dokuwiki\/doku.php?id=paper:ilp:33 .","DOI":"10.1007\/978-3-642-13840-9_20"},{"issue":"1","key":"5187_CR15","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.aam.2004.07.002","volume":"34","author":"L. Sz\u00e9kely","year":"2005","unstructured":"Sz\u00e9kely, L., & Wang, H. (2005). On subtrees of trees. Advances in Applied Mathematics, 34(1), 138\u2013155. doi: 10.1016\/j.aam.2004.07.002 .","journal-title":"Advances in Applied Mathematics"},{"issue":"6","key":"5187_CR16","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F. Wilcoxon","year":"1945","unstructured":"Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80\u201383.","journal-title":"Biometrics Bulletin"},{"key":"5187_CR17","first-page":"392","volume-title":"Proceedings of PKDD","author":"M. W\u00f6rlein","year":"2005","unstructured":"W\u00f6rlein, M., Meinl, T., Fischer, I., & Philippsen, M. (2005). A quantitative comparison of the subgraph miners MoFa, gSpan, ffsm, and Gaston. In Proceedings of PKDD (pp. 392\u2013403). Berlin: Springer-Verlag."},{"key":"5187_CR18","first-page":"721","volume-title":"ICDM \u201902: proceedings of the 2002 IEEE international conference on data mining (ICDM\u201902)","author":"X. Yan","year":"2002","unstructured":"Yan, X., & Han, J. (2002). gSpan: graph-based substructure pattern mining. In ICDM \u201902: proceedings of the 2002 IEEE international conference on data mining (ICDM\u201902) (p. 721). Washington: IEEE Computer Society."},{"key":"5187_CR19","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/956750.956784","volume-title":"KDD \u201903: proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining","author":"X. Yan","year":"2003","unstructured":"Yan, X., & Han, J. (2003). Closegraph: mining closed frequent graph patterns. In KDD \u201903: proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining (pp. 286\u2013295). New York: ACM."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5187-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-010-5187-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5187-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:28Z","timestamp":1559353228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-010-5187-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,19]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["5187"],"URL":"https:\/\/doi.org\/10.1007\/s10994-010-5187-6","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,19]]}}}