{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:31:02Z","timestamp":1757543462419,"version":"3.40.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T00:00:00Z","timestamp":1742428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T00:00:00Z","timestamp":1742428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01PL17055"],"award-info":[{"award-number":["01PL17055"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Johannes Gutenberg-Universit\u00e4t Mainz"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2025,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Multi-relational databases are the basis of most consolidated data collections in science and industry today. Most learning and mining algorithms, however, require data to be represented in a propositional form. While there is a variety of specialized machine learning algorithms that can operate directly on multi-relational data sets, propositionalization algorithms transform multi-relational databases into propositional data sets, thereby allowing the application of traditional machine learning and data mining algorithms without their modification. One prominent propositionalization algorithm is RELAGGS by Krogel and Wrobel, which transforms the data by nested aggregations. We propose a new neural network based algorithm in the spirit of RELAGGS that employs trainable composite aggregate functions instead of the static aggregate functions used in the original approach. In this way, we can jointly train the propositionalization with the prediction model, or, alternatively, use the learned aggegrations as embeddings in other algorithms. We demonstrate the increased predictive performance by comparing N-RELAGGS with RELAGGS and multiple other state-of-the-art algorithms.<\/jats:p>","DOI":"10.1007\/s10994-025-06753-w","type":"journal-article","created":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:55:34Z","timestamp":1742597734000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Neural RELAGGS"],"prefix":"10.1007","volume":"114","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8138-5445","authenticated-orcid":false,"given":"Lukas","family":"Pensel","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Kramer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,20]]},"reference":[{"key":"6753_CR1","unstructured":"Abadi, M., Agarwal, A., Barham, P., Brevdo, E., Chen, Z., Citro, C., Corrado, G.\u00a0S., Davis, A., Dean, J., & Devin, M. (2015). Tensorflow: Large-scale machine learning on heterogeneous systems."},{"key":"6753_CR2","doi-asserted-by":"crossref","unstructured":"Bouckaert, R.\u00a0R., & Frank, E. (2004). Evaluating the replicability of significance tests for comparing learning algorithms. In Pacific-Asia conference on knowledge discovery and data mining, (pp. 3\u201312). Springer.","DOI":"10.1007\/978-3-540-24775-3_3"},{"key":"6753_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68856-3","volume-title":"Logical and relational learning","author":"L De Raedt","year":"2008","unstructured":"De Raedt, L. (2008). Logical and relational learning. Springer Science & Business Media."},{"issue":"2","key":"6753_CR4","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1021\/jm00106a046","volume":"34","author":"AK Debnath","year":"1991","unstructured":"Debnath, A. K., LopezdeCompadre, R. L., Debnath, G., Shusterman, A. J., & Hansch, C. (1991). Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity. Journal of Medicinal Chemistry, 34(2), 786\u2013797.","journal-title":"Journal of Medicinal Chemistry"},{"key":"6753_CR5","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J. (2006). Statistical comparisons of classifiers over multiple data sets. The Journal of Machine Learning Research, 7, 1\u201330.","journal-title":"The Journal of Machine Learning Research"},{"key":"6753_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10994-012-5307-6","volume":"89","author":"H Khosravi","year":"2012","unstructured":"Khosravi, H., Schulte, O., Hu, J., & Gao, T. (2012). Learning compact Markov logic networks with decision trees. Machine Learning, 89, 257\u2013277.","journal-title":"Machine Learning"},{"key":"6753_CR7","unstructured":"Kingma, D. P., & Ba, J. (2014). Adam: A method for stochastic optimization. arXiv preprint. arXiv:1412.6980."},{"key":"6753_CR8","doi-asserted-by":"crossref","unstructured":"Kramer, S., Lavra\u010d, N., & Flach, P. (2001). Propositionalization approaches to relational data mining. Relational data mining, (pp. 262\u2013291).","DOI":"10.1007\/978-3-662-04599-2_11"},{"key":"6753_CR9","doi-asserted-by":"crossref","unstructured":"Krogel, M.-A., & Wrobel, S. (2001). Transformation-based learning using multirelational aggregation. In Inductive Logic Programming: 11th International Conference, ILP 2001 Strasbourg, France, September 9\u201311, 2001 Proceedings 11, (pp. 142\u2013155). Springer.","DOI":"10.1007\/3-540-44797-0_12"},{"key":"6753_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10994-010-5208-5","volume":"83","author":"O Ku\u017eelka","year":"2011","unstructured":"Ku\u017eelka, O., & \u017delezn\u1ef3, F. (2011). Block-wise construction of tree-like relational features with monotone reducibility and redundancy. Machine Learning, 83, 163\u2013192.","journal-title":"Machine Learning"},{"key":"6753_CR11","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1007\/s10994-020-05890-8","volume":"109","author":"N Lavra\u010d","year":"2020","unstructured":"Lavra\u010d, N., \u0160krlj, B., & Robnik-\u0160ikonja, M. (2020). Propositionalization and embeddings: Two sides of the same coin. Machine Learning, 109, 1465\u20131507.","journal-title":"Machine Learning"},{"key":"6753_CR12","unstructured":"Michie, D., Muggleton, S., Page, D., & Srinivasan, A. (1994). To the international computing community: A new east-west challenge. Distributed email document available from http:\/\/www.doc.ic.ac.uk\/shm\/Papers\/ml-chall.pdf."},{"key":"6753_CR13","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., et al. (2011). Scikit-learn: Machine learning in python. The Journal of Machine Learning Research, 12, 2825\u20132830.","journal-title":"The Journal of Machine Learning Research"},{"key":"6753_CR14","doi-asserted-by":"crossref","unstructured":"Pensel, L., & Kramer, S. (2020). Forecast of study success in the stem disciplines based solely on academic records. In Machine learning and knowledge discovery in databases: international workshops of ECML PKDD 2019, W\u00fcrzburg, Germany, September 16\u201320, 2019, Proceedings, Part I, (pp. 647\u2013657). Springer.","DOI":"10.1007\/978-3-030-43823-4_51"},{"key":"6753_CR15","doi-asserted-by":"crossref","unstructured":"Perov\u0161ek, M., Vavpeti\u010d, A., Cestnik, B., & Lavra\u010d, N. (2013). A wordification approach to relational data mining. In Discovery science: 16th international conference, DS 2013, Singapore, October 6\u20139, 2013. Proceedings 16, (pp. 141\u2013154). Springer.","DOI":"10.1007\/978-3-642-40897-7_10"},{"key":"6753_CR16","doi-asserted-by":"crossref","unstructured":"Schouterden, J., Davis, J., & Blockeel, H. (2019). Lazybum: Decision tree learning using lazy propositionalization. In International conference on inductive logic programming, (pp. 98\u2013113). Springer.","DOI":"10.1007\/978-3-030-49210-6_9"},{"key":"6753_CR17","doi-asserted-by":"crossref","unstructured":"\u0160ourek, G., Manandhar, S., \u017delezn\u1ef3, F., Schockaert, S., & Ku\u017eelka, O. (2017). Learning predictive categories using lifted relational neural networks. In Inductive logic programming: 26th international conference, ILP 2016, London, UK, September 4\u20136, 2016, Revised Selected Papers 26, (pp. 108\u2013119). Springer.","DOI":"10.1007\/978-3-319-63342-8_9"},{"key":"6753_CR18","unstructured":"Srinivasan, A. (2001). The aleph manual."},{"key":"6753_CR19","doi-asserted-by":"crossref","unstructured":"Srinivasan, A., King, R.\u00a0D., Muggleton, S.\u00a0H., & Sternberg, M.\u00a0J. (1997). Carcinogenesis predictions using ilp. In International conference on inductive logic programming, (pp. 273\u2013287). Springer.","DOI":"10.1007\/3540635149_56"},{"key":"6753_CR20","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., & Su, Z. (2008). Arnetminer: extraction and mining of academic social networks. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, (pp. 990\u2013998).","DOI":"10.1145\/1401890.1402008"},{"key":"6753_CR21","doi-asserted-by":"crossref","unstructured":"Uwents, W., & Blockeel, H. (2008). Learning aggregate functions with neural networks using a cascade-correlation approach. In International conference on inductive logic programming, (pp. 315\u2013329). Springer.","DOI":"10.1007\/978-3-540-85928-4_24"},{"key":"6753_CR22","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10994-010-5196-5","volume":"82","author":"W Uwents","year":"2011","unstructured":"Uwents, W., Monfardini, G., Blockeel, H., Gori, M., & Scarselli, F. (2011). Neural networks for relational learning: An experimental comparison. Machine Learning, 82, 315\u2013349.","journal-title":"Machine Learning"},{"issue":"12","key":"6753_CR23","doi-asserted-by":"publisher","first-page":"2724","DOI":"10.1109\/TKDE.2017.2754499","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Mao, Z., Wang, B., & Guo, L. (2017). Knowledge graph embedding: A survey of approaches and applications. IEEE Transactions on Knowledge and Data Engineering, 29(12), 2724\u20132743.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"6753_CR24","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Philip, S. Y. (2020). A comprehensive survey on graph neural networks. IEEE Transactions on Neural Networks and Learning Systems, 32(1), 4\u201324.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"6753_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10994-006-5834-0","volume":"62","author":"F \u017delezn\u1ef3","year":"2006","unstructured":"\u017delezn\u1ef3, F., & Lavra\u010d, N. (2006). Propositionalization-based relational subgroup discovery with rsd. Machine Learning, 62, 33\u201363.","journal-title":"Machine Learning"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06753-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-025-06753-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06753-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T18:07:02Z","timestamp":1745258822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-025-06753-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,20]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["6753"],"URL":"https:\/\/doi.org\/10.1007\/s10994-025-06753-w","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2025,3,20]]},"assertion":[{"value":"2 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Kristian Kersting (TU Darmstadt)","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The source code for the implemented N-RELAGGS algorithm is available at .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"123"}}