{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T17:59:10Z","timestamp":1780423150211,"version":"3.54.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T00:00:00Z","timestamp":1282176000000},"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-5208-5","type":"journal-article","created":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T20:35:59Z","timestamp":1282163759000},"page":"163-192","source":"Crossref","is-referenced-by-count":24,"title":["Block-wise construction of tree-like relational features with monotone reducibility and redundancy"],"prefix":"10.1007","volume":"83","author":[{"given":"Ond\u0159ej","family":"Ku\u017eelka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Filip","family":"\u017delezn\u00fd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,8,19]]},"reference":[{"issue":"1","key":"5208_CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.924","volume":"16","author":"H. Blockeel","year":"2002","unstructured":"Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., & Vandecasteele, H. (2002). Improving the efficiency of inductive logic programming through the use of query packs. The Journal of Artificial Intelligence Research, 16(1), 135\u2013166.","journal-title":"The Journal of Artificial Intelligence Research"},{"key":"5208_CR2","first-page":"55","volume-title":"PKDD \u201906: 10th European conference on principles and practice of knowledge discovery in databases","author":"B. Bringmann","year":"2006","unstructured":"Bringmann, B., Zimmermann, A., Raedt, L. D., & Nijssen, S. (2006). Don\u2019t be afraid of simpler patterns. In PKDD \u201906: 10th European conference on principles and practice of knowledge discovery in databases (pp.\u00a055\u201366). Berlin: Springer."},{"key":"5208_CR3","volume-title":"Proceedings of the 4th international workshop on Multi-relational mining","author":"J. Davis","year":"2005","unstructured":"Davis, J., Burnside, E., Page, D., Dutra, I., & Costa, V. S. (2005). Learning Bayesian networks of rules with SAYU. In Proceedings of the 4th international workshop on Multi-relational mining. New York: ACM."},{"key":"5208_CR4","volume-title":"Constraint processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R. (2003). Constraint processing. San Mateo: Morgan Kaufmann."},{"issue":"1","key":"5208_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"Dehaspe, L., & Toivonen, H. (1999). Discovery of frequent datalog patterns. Data Mining and Knowledge Discovery, 3(1), 7\u201336.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5208_CR6","first-page":"453","volume-title":"Inductive logic programming","author":"B. Dolsak","year":"1992","unstructured":"Dolsak, B., & Muggleton, S. (1992). The application of inductive logic programming to finite element mesh design. In Inductive logic programming (pp.\u00a0453\u2013472). San Diego: Academic Press."},{"issue":"3","key":"5208_CR7","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R. Fagin","year":"1983","unstructured":"Fagin, R. (1983). Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the Association for Computing Machinery, 30(3), 514\u2013550.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"5208_CR8","first-page":"1871","volume":"9","author":"R.-E. Fan","year":"2008","unstructured":"Fan, R.-E., Chang, K.-W., Hsieh, C.-J., Wang, X.-R., & Lin, C.-J. (2008). Liblinear: a library for large linear classification. Journal of Machine Learning Research, 9, 1871\u20131874.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"5208_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1093\/bioinformatics\/17.1.107","volume":"17","author":"C. Helma","year":"2001","unstructured":"Helma, C., King, R. D., Kramer, S., & Srinivasan, A. (2001). The predictive toxicology challenge 2000\u20132001. Bioinformatics, 17(1), 107\u2013108.","journal-title":"Bioinformatics"},{"key":"5208_CR10","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1145\/1557019.1557071","volume-title":"KDD \u201909: proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining","author":"A. Koopman","year":"2009","unstructured":"Koopman, A., & Siebes, A. (2009). Characteristic relational patterns. In KDD \u201909: proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining (pp.\u00a0437\u2013446). New York: ACM."},{"key":"5208_CR11","first-page":"258","volume-title":"ICML \u201901: proceedings of the eighteenth international conference on machine learning","author":"S. Kramer","year":"2001","unstructured":"Kramer, S., & De Raedt, L. (2001). Feature construction with version spaces for biochemical applications. In ICML \u201901: proceedings of the eighteenth international conference on machine learning (pp.\u00a0258\u2013265). San Mateo: Morgan Kaufmann."},{"key":"5208_CR12","first-page":"142","volume-title":"ILP \u201901: proceedings of the 11th international conference on inductive logic programming","author":"M. A. Krogel","year":"2001","unstructured":"Krogel, M. A., & Wrobel, S. (2001). Transformation-based learning using multirelational aggregation. In ILP \u201901: proceedings of the 11th international conference on inductive logic programming (pp.\u00a0142\u2013155). Berlin: Springer."},{"key":"5208_CR13","volume-title":"International conference on inductive logic programming (ILP 03\u2019)","author":"M.-A. Krogel","year":"2003","unstructured":"Krogel, M.-A., Rawles, S., \u017delezn\u00fd, F., Flach, P. A., Lavra\u010d, N., & Wrobel, S. (2003). Comparative evaluation of approaches to propositionalization. In International conference on inductive logic programming (ILP 03\u2019). Berlin: Springer."},{"key":"5208_CR14","unstructured":"Ku\u017eelka, O., & \u017delezn\u00fd, F. (2009). Block-wise construction of acyclic relational features with monotone irreducibility and relevancy properties. In ICML 2009: the 26th int. conf. on machine learning."},{"key":"5208_CR15","first-page":"389","volume-title":"AAAI\u201906: proceedings of the 21st national conference on artificial intelligence","author":"N. Landwehr","year":"2006","unstructured":"Landwehr, N., Passerini, A., De Raedt, L., & Frasconi, P. (2006). kFOIL: learning simple relational kernels. In AAAI\u201906: proceedings of the 21st national conference on artificial intelligence (pp.\u00a0389\u2013394). Menlo Park: AAAI Press."},{"key":"5208_CR16","first-page":"481","volume":"8","author":"N. Landwehr","year":"2007","unstructured":"Landwehr, N., Kersting, K., & De Raedt, L. (2007). Integrating na\u00efve bayes and FOIL. Journal of Machine Learning Research, 8, 481\u2013507.","journal-title":"Journal of Machine Learning Research"},{"issue":"4","key":"5208_CR17","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1145\/383779.383781","volume":"2","author":"N. Lavra\u010d","year":"2001","unstructured":"Lavra\u010d, N., & Flach, P. A. (2001). An extended transformation approach to inductive logic programming. ACM Transactions on Computational Logic, 2(4), 458\u2013494.","journal-title":"ACM Transactions on Computational Logic"},{"issue":"2\/3","key":"5208_CR18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0743-1066(99)00019-9","volume":"40","author":"N. Lavra\u010d","year":"1999","unstructured":"Lavra\u010d, N., Gamberger, D., & Jovanoski, V. (1999). A study of relevance for learning in deductive databases. Journal of Logic Programming, 40(2\/3), 215\u2013249.","journal-title":"Journal of Logic Programming"},{"key":"5208_CR19","unstructured":"Lodhi, H., & Muggleton, S. (2005). Is mutagenesis still challenging. In International conference on inductive logic programming (ILP \u201905), late-breaking papers (pp.\u00a035\u201340)."},{"issue":"3\u20134","key":"5208_CR20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing, Special Issue on Inductive Logic Programming, 13(3\u20134), 245\u2013286.","journal-title":"New Generation Computing, Special Issue on Inductive Logic Programming"},{"key":"5208_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of inductive logic programming","author":"S.-H. Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S.-H., & de Wolf, R. (1997). Foundations of inductive logic programming. New York: Springer."},{"issue":"1","key":"5208_CR22","doi-asserted-by":"crossref","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.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"5208_CR23","first-page":"592","volume-title":"ICML","author":"S. Perkins","year":"2003","unstructured":"Perkins, S., & Theiler, J. (2003). Online feature selection using grafting. In ICML (pp.\u00a0592\u2013599). Menlo Park: AAAI Press."},{"issue":"3","key":"5208_CR24","first-page":"239","volume":"5","author":"J. R. Quinlan","year":"1990","unstructured":"Quinlan, J. R. (1990). Learning logical definitions from relations. Machine Learning, 5(3), 239\u2013266.","journal-title":"Machine Learning"},{"key":"5208_CR25","unstructured":"Scheffer, T., & Herbrich, R. (1997). Unbiased assessment of learning algorithms. In 15th international joint conference on artificial intelligence (IJCAI \u201997) (pp.\u00a0798\u2013803)."},{"key":"5208_CR26","first-page":"273","volume-title":"ILP \u201997: proceedings of the 7th international workshop on inductive logic programming","author":"A. Srinivasan","year":"1997","unstructured":"Srinivasan, A., King, R. D., Muggleton, S., & Sternberg, M. J. E. (1997). Carcinogenesis predictions using ILP. In ILP \u201997: proceedings of the 7th international workshop on inductive logic programming (pp.\u00a0273\u2013287). Berlin: Springer."},{"issue":"1","key":"5208_CR27","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1093\/bioinformatics\/bti1055","volume":"21","author":"S. J. Swamidass","year":"2005","unstructured":"Swamidass, S. J., Chen, J., Bruand, J., Phung, P., Ralaivola, L., & Baldi, P. (2005). Kernels for small molecules and the prediction of mutagenicity, toxicity and anti-cancer activity. Bioinformatics, 21(1), 359\u2013368.","journal-title":"Bioinformatics"},{"key":"5208_CR28","first-page":"585","volume-title":"PKDD \u201906: 10th European conference on principles and practice of knowledge discovery in databases","author":"M. Leeuwen Van","year":"2006","unstructured":"Van Leeuwen, M., Vreeken, J., & Siebes, A. (2006). Compression picks item sets that matter. In PKDD \u201906: 10th European conference on principles and practice of knowledge discovery in databases (pp.\u00a0585\u2013592). Berlin: Springer."},{"key":"5208_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The nature of statistical learning theory","author":"V. N. Vapnik","year":"1995","unstructured":"Vapnik, V. N. (1995). The nature of statistical learning theory. Berlin: Springer."},{"key":"5208_CR30","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10994-006-5834-0","volume":"62","author":"F. \u017delezn\u00fd","year":"2006","unstructured":"\u017delezn\u00fd, F., & Lavra\u010d, N. (2006). Propositionalization-based relational subgroup discovery with RSD. Machine Learning, 62, 33\u201363.","journal-title":"Machine Learning"},{"key":"5208_CR31","volume-title":"Data mining: practical machine learning tools and techniques","author":"I. H. Witten","year":"2005","unstructured":"Witten, I. H., & Frank, E. (2005). Data mining: practical machine learning tools and techniques (2nd ed.). San Francisco: Morgan Kaufmann.","edition":"2"},{"key":"5208_CR32","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/11564126_39","volume-title":"PKDD 2005, 9th European conference on principles and practice of knowledge discovery in databases","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 LNCS. PKDD 2005, 9th European conference on principles and practice of knowledge discovery in databases (pp.\u00a0392\u2013403). Berlin: Springer."},{"key":"5208_CR33","unstructured":"Yannakakis, M. (1981). Algorithms for acyclic database schemes. In International conference on very large data bases (VLDB \u201981) (pp.\u00a082\u201394)."},{"key":"5208_CR34","volume-title":"International conference on inductive logic programming (ILP \u201907)","author":"M. \u017d\u00e1kov\u00e1","year":"2007","unstructured":"\u017d\u00e1kov\u00e1, M., \u017delezn\u00fd, F., Garcia-Sedano, J., Tissot, C. M., Lavra\u010d, N., K\u0159emen, P., & Molina, J. (2007). Relational data mining applied to virtual engineering of product designs. In International conference on inductive logic programming (ILP \u201907). Berlin: Springer."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5208-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-010-5208-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5208-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T02:49:51Z","timestamp":1559443791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-010-5208-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,19]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["5208"],"URL":"https:\/\/doi.org\/10.1007\/s10994-010-5208-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,19]]}}}