{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T21:16:43Z","timestamp":1771190203147,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030974534","type":"print"},{"value":"9783030974541","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-97454-1_9","type":"book-chapter","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:02:28Z","timestamp":1645646548000},"page":"125-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Transfer Learning for\u00a0Boosted Relational Dependency Networks Through Genetic Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7613-7423","authenticated-orcid":false,"given":"Leticia Freire","family":"de Figueiredo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9089-7303","authenticated-orcid":false,"given":"Aline","family":"Paes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3641-6839","authenticated-orcid":false,"given":"Gerson","family":"Zaverucha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,24]]},"reference":[{"key":"9_CR1","unstructured":"Inductive logic programming in a nutshell. In: Introduction to Statistical Relational Learning. The MIT Press (August 2007)"},{"issue":"7","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1007\/s10994-020-05871-x","volume":"109","author":"R Azevedo Santos","year":"2020","unstructured":"Azevedo Santos, R., Paes, A., Zaverucha, G.: Transfer learning by mapping and revising boosted relational dependency networks. Mach. Learn. 109(7), 1435\u20131463 (2020). https:\/\/doi.org\/10.1007\/s10994-020-05871-x","journal-title":"Mach. Learn."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bilenko, M., Mooney, R.J.: Adaptive duplicate detection using learnable string similarity measures. In: Getoor, L., Senator, T.E., Domingos, P.M., Faloutsos, C. (eds.) Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, 24\u201327 August 2003, pp. 39\u201348. ACM (2003)","DOI":"10.1145\/956750.956759"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Burke, E.K., Kendall, G.: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, 2nd edn. Springer, Boston (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6940-7","DOI":"10.1007\/978-1-4614-6940-7"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka, E.R., Jr., Mitchell, T.M.: Toward an architecture for never-ending language learning. In: Fox, M., Poole, D. (eds.) Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7519"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Davis, J., Domingos, P.M.: Deep transfer via second-order Markov logic. In: Danyluk, A.P., Bottou, L., Littman, M.L. (eds.) Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009. ACM International Conference Proceeding Series, Montreal, Quebec, Canada, 14\u201318 June 2009, vol. 382, pp. 217\u2013224. ACM (2009)","DOI":"10.1145\/1553374.1553402"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"De Raedt, L.: Logical and Relational Learning, 1st edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68856-3","DOI":"10.1007\/978-3-540-68856-3"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Gandomi, A., Yang, X.S., Talatahari, S., Alavi, A.: Metaheuristic algorithms in modeling and optimization, pp. 1\u201324 (12 2013)","DOI":"10.1016\/B978-0-12-398364-0.00001-2"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Haaren, J.V., Kolobov, A., Davis, J.: TODTLER: two-order-deep transfer learning. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, AAAI 2015, pp. 3007\u20133015. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9624"},{"key":"9_CR10","first-page":"49","volume":"1","author":"D Heckerman","year":"2001","unstructured":"Heckerman, D., Chickering, D.M., Meek, C., Rounthwaite, R., Kadie, C.: Dependency networks for inference, collaborative filtering, and data visualization. J. Mach. Learn. Res. 1, 49\u201375 (2001)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-13059-5_25","volume-title":"Advances in Artificial Intelligence","author":"H Khosravi","year":"2010","unstructured":"Khosravi, H., Bina, B.: A survey on statistical relational learning. In: Farzindar, A., Ke\u0161elj, V. (eds.) AI 2010. LNCS (LNAI), vol. 6085, pp. 256\u2013268. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13059-5_25"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Kumaraswamy, R., Odom, P., Kersting, K., Leake, D., Natarajan, S.: Transfer learning via relational type matching. In: Aggarwal, C.C., Zhou, Z., Tuzhilin, A., Xiong, H., Wu, X. (eds.) 2015 IEEE International Conference on Data Mining, ICDM 2015, Atlantic City, NJ, USA, 14\u201317 November 2015, pp. 811\u2013816. IEEE (2015)","DOI":"10.1109\/ICDM.2015.138"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s13218-020-00659-6","volume":"34","author":"R Kumaraswamy","year":"2020","unstructured":"Kumaraswamy, R., Ramanan, N., Odom, P., Natarajan, S.: Interactive transfer learning in relational domains. KI - K\u00fcnstliche Intelligenz 34(2), 181\u2013192 (2020). https:\/\/doi.org\/10.1007\/s13218-020-00659-6","journal-title":"KI - K\u00fcnstliche Intelligenz"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Mendelson, J., Naik, A., Raghothaman, M., Naik, M.: GenSynth: synthesizing Datalog programs without language bias. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 6444\u20136453 (2021)","DOI":"10.1609\/aaai.v35i7.16799"},{"key":"9_CR15","unstructured":"Mihalkova, L., Huynh, T., Mooney, R.J.: Mapping and revising Markov logic networks for transfer learning. In: Proceedings of the 22nd National Conference on Artificial Intelligence, vol. 1, pp. 608\u2013614. AAAI Press (2007)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Mihalkova, L., Mooney, R.J.: Bottom-up learning of Markov logic network structure. In: Ghahramani, Z. (ed.) Proceedings of the 24th International Conference Machine Learning, ICML 2007. ACM International Conference Proceeding Series, vol. 227, pp. 625\u2013632. ACM (2007)","DOI":"10.1145\/1273496.1273575"},{"key":"9_CR17","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)"},{"issue":"2\u20133","key":"9_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10994-007-5029-3","volume":"70","author":"S Muggleton","year":"2008","unstructured":"Muggleton, S., Tamaddoni-Nezhad, A.: QG\/GA: a stochastic search for progol. Mach. Learn. 70(2\u20133), 121\u2013133 (2008)","journal-title":"Mach. Learn."},{"key":"9_CR19","unstructured":"Natarajan, S., Khot, T., Kersting, K., Gutmann, B., Shavlik, J.: Boosting relational dependency networks. In: Frasconi, P., Lisi, F.A. (eds.) Online Proceedings of the International Conference on Inductive Logic Programming 2010, pp. 1\u20138 (June 2010). https:\/\/lirias.kuleuven.be\/handle\/123456789\/283041"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10994-011-5244-9","volume":"86","author":"S Natarajan","year":"2012","unstructured":"Natarajan, S., Khot, T., Kersting, K., Gutmann, B., Shavlik, J.W.: Gradient-based boosting for statistical relational learning: the relational dependency network case. Mach. Learn. 86(1), 25\u201356 (2012)","journal-title":"Mach. Learn."},{"key":"9_CR21","first-page":"653","volume":"8","author":"J Neville","year":"2007","unstructured":"Neville, J., Jensen, D.: Relational dependency networks. J. Mach. Learn. Res. 8, 653\u2013692 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Olivas, E.S., Guerrero, J.D.M., Sober, M.M., Benedito, J.R.M., Lopez, A.J.S.: Handbook of Research on Machine Learning Applications and Trends: Algorithms, Methods and Techniques - 2 Volumes. Information Science Reference - Imprint of: IGI Publishing, Hershey, PA (2009)","DOI":"10.4018\/978-1-60566-766-9"},{"issue":"10","key":"9_CR23","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1109\/TKDE.2009.191","volume":"22","author":"SJ Pan","year":"2010","unstructured":"Pan, S.J., Yang, Q.: A survey on transfer learning. IEEE Trans. Knowl. Data Eng. 22(10), 1345\u20131359 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR24","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-31951-8_25","volume-title":"Inductive Logic Programming","author":"CG Pitangui","year":"2012","unstructured":"Pitangui, C.G., Zaverucha, G.: Learning theories using estimation distribution algorithms and (reduced) bottom clauses. In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds.) ILP 2011. LNCS (LNAI), vol. 7207, pp. 286\u2013301. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31951-8_25"},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/s40537-016-0043-6","volume":"3","author":"K Weiss","year":"2016","unstructured":"Weiss, K., Khoshgoftaar, T.M., Wang, D.: A survey of transfer learning. J. Big Data 3(1), 9 (2016). https:\/\/doi.org\/10.1186\/s40537-016-0043-6","journal-title":"J. Big Data"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Yang, Q., Zhang, Y., Dai, W., Pan, S.J.: Transfer Learning. Cambridge University Press (2020). https:\/\/doi.org\/10.1017\/9781139061773","DOI":"10.1017\/9781139061773"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97454-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T20:13:20Z","timestamp":1674850400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97454-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030974534","9783030974541"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97454-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lr2020.iit.demokritos.gr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"160% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}