{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:48:21Z","timestamp":1742971701759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030891879"},{"type":"electronic","value":"9783030891886"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-89188-6_42","type":"book-chapter","created":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T22:02:23Z","timestamp":1635112943000},"page":"556-571","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Correcting Large Knowledge Bases Using Guided Inductive Logic Learning Rules"],"prefix":"10.1007","author":[{"given":"Yan","family":"Wu","sequence":"first","affiliation":[]},{"given":"Zili","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Guodong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,25]]},"reference":[{"issue":"10","key":"42_CR1","doi-asserted-by":"publisher","first-page":"2059034","DOI":"10.1142\/S021800142059034X","volume":"34","author":"F Abedini","year":"2020","unstructured":"Abedini, F., Keyvanpour, M.R., Menhaj, M.B.: Correction tower: a general embedding method of the error recognition for the knowledge graph correction. Int. J. Pattern Recogn. Artif. Intell 34(10), 2059034 (2020)","journal-title":"Int. J. Pattern Recogn. Artif. Intell"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Andresel, M., Ortiz, M., Simkus, M.: Query rewriting for ontology-mediated conditional answers. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 2734\u20132741 (2020)","DOI":"10.1609\/aaai.v34i03.5660"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-540-76298-0_52","volume-title":"The Semantic Web","author":"S Auer","year":"2007","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: a nucleus for a web of open data. In: Aberer, K., et al. (eds.) ASWC\/ISWC -2007. LNCS, vol. 4825, pp. 722\u2013735. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76298-0_52"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Bienvenu, M.: Ontology-mediated query answering: harnessing knowledge to get more from data. In: IJCAI: International Joint Conference on Artificial Intelligence (2016)","DOI":"10.24963\/ijcai.2017\/117"},{"key":"42_CR5","unstructured":"Bienvenu, M., Hansen, P., Lutz, C., Wolter, F.: First order-rewritability and containment of conjunctive queries in horn description logics. arXiv preprint arXiv:2011.09836 (2020)"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Chen, J., Chen, X., Horrocks, I., B. Myklebust, E., Jimenez-Ruiz, E.: Correcting knowledge base assertions. In: Proceedings of The Web Conference 2020, pp. 1537\u20131547 (2020)","DOI":"10.1145\/3366423.3380226"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Chu, X., Ilyas, I.F., Krishnan, S., Wang, J.: Data cleaning: overview and emerging challenges. In: Proceedings of the 2016 International Conference on Management of Data, pp. 2201\u20132206 (2016)","DOI":"10.1145\/2882903.2912574"},{"issue":"12","key":"42_CR8","doi-asserted-by":"publisher","first-page":"1952","DOI":"10.14778\/2824032.2824109","volume":"8","author":"X Chu","year":"2015","unstructured":"Chu, X., et al.: Katara: reliable data cleaning with knowledge bases and crowdsourcing. Proc. VLDB Endow. 8(12), 1952\u20131955 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Gal\u00e1rraga, L.A., Teflioudi, C., Hose, K., Suchanek, F.: Amie: association rule mining under incomplete evidence in ontological knowledge bases. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 413\u2013422 (2013)","DOI":"10.1145\/2488388.2488425"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Heist, N., Paulheim, H.: Information extraction from co-occurring similar entities. arXiv preprint arXiv:2102.05444 (2021)","DOI":"10.1145\/3442381.3449836"},{"issue":"2","key":"42_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1376815.1376819","volume":"2","author":"A Islam","year":"2008","unstructured":"Islam, A., Inkpen, D.: Semantic text similarity using corpus-based word similarity and string similarity. ACM Trans. Knowl. Disc. Data (TKDD) 2(2), 1\u201325 (2008)","journal-title":"ACM Trans. Knowl. Disc. Data (TKDD)"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Khayyat, Z., et al.: Bigdansing: a system for big data cleansing. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1215\u20131230 (2015)","DOI":"10.1145\/2723372.2747646"},{"key":"42_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-030-49461-2_3","volume-title":"The Semantic Web","author":"J Lajus","year":"2020","unstructured":"Lajus, J., Gal\u00e1rraga, L., Suchanek, F.: Fast and exact rule mining with AMIE 3. In: Harth, A., et al. (eds.) ESWC 2020. LNCS, vol. 12123, pp. 36\u201352. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49461-2_3"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Lertvittayakumjorn, P., Kertkeidkachorn, N., Ichise, R.: Correcting range violation errors in dbpedia. In: International Semantic Web Conference (Posters, Demos & Industry Tracks) (2017)","DOI":"10.1007\/978-3-319-70682-5_8"},{"issue":"1","key":"42_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.15837\/ijccc.2018.1.3104","volume":"13","author":"X Lin","year":"2018","unstructured":"Lin, X., Liang, Y., Wang, L., Wang, X., Yang, M.Q., Guan, R.: A knowledge base completion model based on path feature learning. Int. J. Comput. Commun. Control 13(1), 71\u201382 (2018)","journal-title":"Int. J. Comput. Commun. Control"},{"issue":"12","key":"42_CR16","doi-asserted-by":"publisher","first-page":"1948","DOI":"10.14778\/3407790.3407801","volume":"13","author":"M Mahdavi","year":"2020","unstructured":"Mahdavi, M., Abedjan, Z.: Baran: effective error correction via a unified context representation and transfer learning. Proc. VLDB Endow. 13(12), 1948\u20131961 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Mayfield, C., Neville, J., Prabhakar, S.: Eracer: a database approach for statistical inference and data cleaning. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 75\u201386 (2010)","DOI":"10.1145\/1807167.1807178"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Meilicke, C., Chekol, M.W., Fink, M., Stuckenschmidt, H.: Reinforced anytime bottom up rule learning for knowledge graph completion. arXiv preprint arXiv:2004.04412 (2020)","DOI":"10.24963\/ijcai.2019\/435"},{"key":"42_CR19","unstructured":"Melo, A., Paulheim, H.: An approach to correction of erroneous links in knowledge graphs. In: CEUR Workshop Proceedings, vol. 2065, pp. 54\u201357. RWTH (2017)"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Melo, A., Paulheim, H.: Detection of relation assertion errors in knowledge graphs. In: Proceedings of the Knowledge Capture Conference, pp. 1\u20138 (2017)","DOI":"10.1145\/3148011.3148033"},{"key":"42_CR21","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S Muggleton","year":"1994","unstructured":"Muggleton, S., De Raedt, L.: Inductive logic programming: theory and methods. J. Logic Program. 19, 629\u2013679 (1994)","journal-title":"J. Logic Program."},{"key":"42_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11219-019-09483-0","volume":"28","author":"PT Nguyen","year":"2020","unstructured":"Nguyen, P.T., Di Rocco, J., Rubei, R., Di Ruscio, D.: An automated approach to assess the similarity of github repositories. Softw. Qual. J 28, 1\u201337 (2020)","journal-title":"Softw. Qual. J"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Ortona, S., Meduri, V.V., Papotti, P.: Robust discovery of positive and negative rules in knowledge bases. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 1168\u20131179. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00108"},{"key":"42_CR24","unstructured":"Paulheim, H.: Identifying wrong links between datasets by multi-dimensional outlier detection. In: WoDOOM, pp. 27\u201338 (2014)"},{"issue":"2","key":"42_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.4018\/ijswis.2014040104","volume":"10","author":"H Paulheim","year":"2014","unstructured":"Paulheim, H., Bizer, C.: Improving the quality of linked data using statistical distributions. Int. J. Semant. Web Inf. Syst (IJSWIS) 10(2), 63\u201386 (2014)","journal-title":"Int. J. Semant. Web Inf. Syst (IJSWIS)"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"Pellissier Tanon, T., Bourgaux, C., Suchanek, F.: Learning how to correct a knowledge base from the edit history. In: The World Wide Web Conference, pp. 1465\u20131475 (2019)","DOI":"10.1145\/3308558.3313584"},{"key":"42_CR27","doi-asserted-by":"crossref","unstructured":"Picado, J., Davis, J., Termehchy, A., Lee, G.Y.: Learning over dirty data without cleaning. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 1301\u20131316 (2020)","DOI":"10.1145\/3318464.3389708"},{"key":"42_CR28","unstructured":"Singhal, A.: Introducing the knowledge graph: things, not strings. Official google blog 16 (2012)"},{"key":"42_CR29","unstructured":"Speranskaya, M., Schmitt, M., Roth, B.: Ranking vs. classifying: measuring knowledge base completion quality. arXiv preprint arXiv:2102.06145 (2021)"},{"key":"42_CR30","doi-asserted-by":"crossref","unstructured":"Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: Proceedings of the 16th International Conference on World Wide Web, pp. 697\u2013706 (2007)","DOI":"10.1145\/1242572.1242667"},{"issue":"10","key":"42_CR31","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrande\u010di\u0107","year":"2014","unstructured":"Vrande\u010di\u0107, D., Kr\u00f6tzsch, M.: Wikidata: a free collaborative knowledgebase. Commun. ACM 57(10), 78\u201385 (2014)","journal-title":"Commun. ACM"},{"key":"42_CR32","doi-asserted-by":"crossref","unstructured":"Weaver, G., Strickland, B., Crane, G.: Quantifying the accuracy of relational statements in wikipedia: a methodology. In: JCDL, vol. 6, pp. 358\u2013358. Citeseer (2006)","DOI":"10.1145\/1141753.1141853"},{"key":"42_CR33","unstructured":"Wolter, U.: Logics of first-order constraints-a category independent approach. arXiv preprint arXiv:2101.01944 (2021)"},{"key":"42_CR34","doi-asserted-by":"publisher","first-page":"92","DOI":"10.29007\/ppgx","volume":"72","author":"Y Wu","year":"2020","unstructured":"Wu, Y., Chen, J., Haxhidauti, P., Venugopal, V.E., Theobald, M.: Guided inductive logic programming: cleaning knowledge bases with iterative user feedback. EPiC Ser. Comput. 72, 92\u2013106 (2020)","journal-title":"EPiC Ser. Comput."},{"key":"42_CR35","doi-asserted-by":"crossref","unstructured":"Yakout, M., Berti-\u00c9quille, L., Elmagarmid, A.K.: Don\u2019t be scared: use scalable automatic repairing with maximal likelihood and bounded changes. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 553\u2013564 (2013)","DOI":"10.1145\/2463676.2463706"},{"key":"42_CR36","unstructured":"Yan, J.N., Schulte, O., Wang, J., Cheng, R.: Detecting data errors with statistical constraints. arXiv preprint arXiv:1902.09711 (2019)"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2021: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89188-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:34:54Z","timestamp":1648647294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89188-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030891879","9783030891886"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89188-6_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pricai.org\/2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"382","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":"93","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":"28","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":"24% - 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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}