{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:05:43Z","timestamp":1760598343609,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492983"},{"type":"electronic","value":"9783031492990"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T00:00:00Z","timestamp":1703203200000},"content-version":"vor","delay-in-days":355,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Probabilistic Logic Programming combines uncertainty and logic-based languages. Liftable Probabilistic Logic Programs have been recently proposed to perform inference in a lifted way. LIFTCOVER is an algorithm used to perform parameter and structure learning of liftable probabilistic logic programs. In particular, it performs parameter learning via Expectation Maximization and LBFGS. In this paper, we present an updated version of LIFTCOVER, called LIFTCOVER+, in which regularization was added to improve the quality of the solutions and LBFGS was replaced by gradient descent. We tested LIFTCOVER+ on the same 12 datasets on which LIFTCOVER was tested and compared the performances in terms of AUC-ROC, AUC-PR, and execution times. Results show that in most cases Expectation Maximization with regularization improves the quality of the solutions.<\/jats:p>","DOI":"10.1007\/978-3-031-49299-0_2","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:06:49Z","timestamp":1703135209000},"page":"16-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Regularization in\u00a0Probabilistic Inductive Logic Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-6901-0540","authenticated-orcid":false,"given":"Elisabetta","family":"Gentili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9259-7761","authenticated-orcid":false,"given":"Alice","family":"Bizzarri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7133-2673","authenticated-orcid":false,"given":"Damiano","family":"Azzolini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8352-6304","authenticated-orcid":false,"given":"Riccardo","family":"Zese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1654-9703","authenticated-orcid":false,"given":"Fabrizio","family":"Riguzzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"27","author":"SB Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. 27(6), 509\u2013516 (1978)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.3233\/IDA-130582","volume":"17","author":"E Bellodi","year":"2013","unstructured":"Bellodi, E., Riguzzi, F.: Expectation maximization over binary decision diagrams for probabilistic logic programs. Intell. Data Anal. 17(2), 343\u2013363 (2013)","journal-title":"Intell. Data Anal."},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1017\/S1471068413000689","volume":"15","author":"E Bellodi","year":"2015","unstructured":"Bellodi, E., Riguzzi, F.: Structure learning of probabilistic logic programs by searching the clause space. Theory Pract. Logic Program. 15(2), 169\u2013212 (2015). https:\/\/doi.org\/10.1017\/S1471068413000689","journal-title":"Theory Pract. Logic Program."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Davis, J., Goadrich, M.: The relationship between precision-recall and ROC curves. In: European Conference on Machine Learning (ECML 2006), pp. 233\u2013240. ACM (2006)","DOI":"10.1145\/1143844.1143874"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10994-015-5494-z","volume":"100","author":"L De Raedt","year":"2015","unstructured":"De Raedt, L., Kimmig, A.: Probabilistic (logic) programming concepts. Mach. Learn. 100(1), 5\u201347 (2015). https:\/\/doi.org\/10.1007\/s10994-015-5494-z","journal-title":"Mach. Learn."},{"key":"2_CR6","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007, pp. 2468\u20132473. Morgan Kaufmann Publishers Inc., San Francisco (2007)"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. B 39, 1\u201338 (1977)","journal-title":"J. Roy. Stat. Soc. B"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett, T.: An introduction to ROC analysis. Pattern Recogn. Lett. 27, 861\u2013874 (2006)","journal-title":"Pattern Recogn. Lett."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-014-5443-2","volume":"99","author":"A Kimmig","year":"2015","unstructured":"Kimmig, A., Mihalkova, L., Getoor, L.: Lifted graphical models: a survey. Mach. Learn. 99, 1\u201345 (2015)","journal-title":"Mach. Learn."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Kok, S., Domingos, P.: Learning the structure of Markov Logic Networks. In: 22nd International Conference on Machine learning, pp. 441\u2013448. ACM (2005)","DOI":"10.1145\/1102351.1102407"},{"issue":"5","key":"2_CR11","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1093\/bioinformatics\/btr698","volume":"28","author":"S M\u00f8rk","year":"2012","unstructured":"M\u00f8rk, S., Holmes, I.: Evaluating bacterial gene-finding hmm structures as probabilistic logic programs. Bioinformatics 28(5), 636\u2013642 (2012)","journal-title":"Bioinformatics"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-69775-8_5","volume-title":"Towards Integrative Machine Learning and Knowledge Extraction","author":"AN Fadja","year":"2017","unstructured":"Fadja, A.N., Riguzzi, F.: Probabilistic logic programming in action. In: Holzinger, A., Goebel, R., Ferri, M., Palade, V. (eds.) Towards Integrative Machine Learning and Knowledge Extraction. LNCS (LNAI), vol. 10344, pp. 89\u2013116. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69775-8_5"},{"issue":"7","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/s10994-018-5750-0","volume":"108","author":"A Nguembang Fadja","year":"2019","unstructured":"Nguembang Fadja, A., Riguzzi, F.: Lifted discriminative learning of probabilistic logic programs. Mach. Learn. 108(7), 1111\u20131135 (2019)","journal-title":"Mach. Learn."},{"issue":"7","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1007\/s10994-021-06016-4","volume":"110","author":"A Nguembang Fadja","year":"2021","unstructured":"Nguembang Fadja, A., Riguzzi, F., Lamma, E.: Learning hierarchical probabilistic logic programs. Mach. Learn. 110(7), 1637\u20131693 (2021). https:\/\/doi.org\/10.1007\/s10994-021-06016-4","journal-title":"Mach. Learn."},{"key":"2_CR15","unstructured":"Poole, D.: First-order probabilistic inference. In: Gottlob, G., Walsh, T. (eds.) IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, 9\u201315 August 2003, pp. 985\u2013991. Morgan Kaufmann Publishers (2003)"},{"key":"2_CR16","unstructured":"Raedt, L.D., Dries, A., Thon, I., den Broeck, G.V., Verbeke, M.: Inducing probabilistic relational rules from probabilistic examples. In: Yang, Q., Wooldridge, M. (eds.) 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pp. 1835\u20131843. AAAI Press (2015)"},{"key":"2_CR17","doi-asserted-by":"publisher","DOI":"10.1201\/9781003427421","volume-title":"Foundations of Probabilistic Logic Programming Languages, Semantics, Inference and Learning","author":"F Riguzzi","year":"2023","unstructured":"Riguzzi, F.: Foundations of Probabilistic Logic Programming Languages, Semantics, Inference and Learning, 2nd edn. River Publishers, Gistrup (2023)","edition":"2"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Riguzzi, F., Bellodi, E., Zese, R., Cota, G., Lamma, E.: A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics. Int. J. Approx. Reason. 80, 313\u2013333 (2017). https:\/\/doi.org\/10.1016\/j.ijar.2016.10.002","DOI":"10.1016\/j.ijar.2016.10.002"},{"key":"2_CR19","unstructured":"Riguzzi, F., Lamma, E., Alberti, M., Bellodi, E., Zese, R., Cota, G.: Probabilistic logic programming for natural language processing. In: Chesani, F., Mello, P., Milano, M. (eds.) Workshop on Deep Understanding and Reasoning, URANIA 2016. CEUR Workshop Proceedings, vol. 1802, pp. 30\u201337. Sun SITE Central Europe (2017)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Riguzzi, F., Swift, T.: Probabilistic logic programming under the distribution semantics. In: Kifer, M., Liu, Y.A. (eds.) Declarative Logic Programming: Theory, Systems, and Applications. Association for Computing Machinery and Morgan & Claypool (2018)","DOI":"10.1145\/3191315.3191319"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Sterling, L. (ed.) Logic Programming, Proceedings of the Twelfth International Conference on Logic Programming, Tokyo, Japan, 13\u201316 June 1995, pp. 715\u2013729. MIT Press (1995). https:\/\/doi.org\/10.7551\/mitpress\/4298.003.0069","DOI":"10.7551\/mitpress\/4298.003.0069"},{"issue":"3","key":"2_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10994-012-5289-4","volume":"88","author":"O Schulte","year":"2012","unstructured":"Schulte, O., Khosravi, H.: Learning graphical models for relational data via lattice search. Mach. Learn. 88(3), 331\u2013368 (2012)","journal-title":"Mach. Learn."},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3540635149_56","volume-title":"7th International Workshop on Inductive Logic Programming","author":"A Srinivasan","year":"1997","unstructured":"Srinivasan, A., King, R.D., Muggleton, S., Sternberg, M.J.E.: Carcinogenesis predictions using ILP. In: Lavrac, N., D\u017eeroski, S. (eds.) 7th International Workshop on Inductive Logic Programming. Lecture Notes in Computer Science, vol. 1297, pp. 273\u2013287. Springer, Berlin Heidelberg (1997)"},{"issue":"1\u20132","key":"2_CR24","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0004-3702(95)00122-0","volume":"85","author":"A Srinivasan","year":"1996","unstructured":"Srinivasan, A., Muggleton, S., Sternberg, M.J.E., King, R.D.: Theories for mutagenicity: a study in first-order and feature-based induction. Artif. Intell. 85(1\u20132), 277\u2013299 (1996)","journal-title":"Artif. Intell."},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/11871842_79","volume-title":"Machine Learning: ECML 2006","author":"J Struyf","year":"2006","unstructured":"Struyf, J., Davis, J., Page, D.: An efficient approximation to lookahead in relational learners. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 775\u2013782. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_79"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-27775-0_30","volume-title":"Logic Programming","author":"J Vennekens","year":"2004","unstructured":"Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 431\u2013445. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27775-0_30"}],"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-031-49299-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T14:34:53Z","timestamp":1730903693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49299-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492983","9783031492990"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49299-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","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":"Bari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ilp2023.unife.it\/","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":"https:\/\/easychair.org\/","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","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":"11","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":"1","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":"61% - 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":"2.89","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.55","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)"}},{"value":"1 late-breaking abstract only for oral presentation (not to be included in the conference proceedings)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}