{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T03:29:17Z","timestamp":1777087757708,"version":"3.51.4"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T00:00:00Z","timestamp":1588723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100008952","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE23-0019"],"award-info":[{"award-number":["ANR-18-CE23-0019"]}],"id":[{"id":"10.13039\/501100008952","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Data and Information Quality"],"published-print":{"date-parts":[[2020,6,30]]},"abstract":"<jats:p>\n            We describe RuDiK, an algorithm and a system for mining declarative rules over RDF knowledge graphs (KGs). RuDiK can discover rules expressing both\n            <jats:italic>positive<\/jats:italic>\n            relationships between KG elements, e.g., \u201cif two persons share at least one parent, they are likely to be siblings,\u201d and\n            <jats:italic>negative<\/jats:italic>\n            patterns identifying data contradictions, e.g., \u201cif two persons are married, one cannot be the child of the other\u201d or \u201cthe birth year for a person cannot be bigger than her graduation year.\u201d While the first kind of rules identify new facts in the KG, the second kind enables the detection of incorrect triples and the generation of (training) negative examples for learning algorithms. High-quality rules are also critical for any reasoning task involving the KGs.\n          <\/jats:p>\n          <jats:p>\n            Our approach increases the\n            <jats:italic>expressive power<\/jats:italic>\n            of the supported rule language w.r.t. the existing systems. RuDiK discovers rules containing (i) comparisons among literal values and (ii) selection conditions with constants. Richer rules increase the accuracy and the coverage over the facts in the KG for the task at hand. This is achieved with aggressive pruning of the search space and with disk-based algorithms, which enable the execution of the system in commodity machines. Also, RuDiK is robust to errors and missing data in the input graph. It discovers\n            <jats:italic>approximate<\/jats:italic>\n            rules with a measure of support that is aware of the quality issues. Our experimental evaluation with real-world KGs shows that RuDiK does better than existing solutions in terms of scalability and that it can identify effective rules for different target applications.\n          <\/jats:p>","DOI":"10.1145\/3371315","type":"journal-article","created":{"date-parts":[[2020,5,6]],"date-time":"2020-05-06T15:09:26Z","timestamp":1588777766000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Mining Expressive Rules in Knowledge Graphs"],"prefix":"10.1145","volume":"12","author":[{"given":"Naser","family":"Ahmadi","sequence":"first","affiliation":[{"name":"Eurecom, France"}]},{"given":"Viet-Phi","family":"Huynh","sequence":"additional","affiliation":[{"name":"Eurecom, France"}]},{"given":"Vamsi","family":"Meduri","sequence":"additional","affiliation":[{"name":"Arizona State University, USA"}]},{"given":"Stefano","family":"Ortona","sequence":"additional","affiliation":[{"name":"Meltwater, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0651-4128","authenticated-orcid":false,"given":"Paolo","family":"Papotti","sequence":"additional","affiliation":[{"name":"Eurecom, France"}]}],"member":"320","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856328"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994518"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3054772"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11955-7_11"},{"key":"e_1_2_1_5_1","volume-title":"Foundations of Databases","author":"Abiteboul Serge"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.36370\/tto.2019.15"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213888"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2009.07.002"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the NIPS.","author":"Bordes Antoine","year":"2013"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the AAAI.","author":"Bordes Antoine","year":"2011"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536206.2536209"},{"key":"e_1_2_1_13_1","volume-title":"Mitchell","author":"Carlson Andrew","year":"2010"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882954"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536262"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009863704807"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465297"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732962"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Wenfei Fan and Floris Geerts. 2012. Foundations of Data Quality Management. Morgan 8 Claypool Publishers. DOI:https:\/\/doi.org\/10.2200\/S00439ED1V01Y201207DTM030  Wenfei Fan and Floris Geerts. 2012. Foundations of Data Quality Management. Morgan 8 Claypool Publishers. DOI:https:\/\/doi.org\/10.2200\/S00439ED1V01Y201207DTM030","DOI":"10.2200\/S00439ED1V01Y201207DTM030"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196916"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915232"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2899391"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290996"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0394-1"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915242"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/42.2.100"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352069"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3192965.3192968"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the HLT-NAACL. 777--782","author":"Min Bonan","year":"2013"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90035-3"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00108"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3236231"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.3233\/SW-160218"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236193"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the EMNLP. 1088--1098","author":"Schoenmackers Stefan","year":"2010"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809991"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the WWW. 697--706","author":"Suchanek Fabian M.","year":"2007"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526794"},{"key":"e_1_2_1_41_1","volume-title":"Ganesh Krishnan et al","author":"Chong Sun Paul Suganthan G. C.","year":"2015"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2362499.2362505"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629489"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07443-6_34"}],"container-title":["Journal of Data and Information Quality"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371315","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3371315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:05Z","timestamp":1750204385000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,6]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6,30]]}},"alternative-id":["10.1145\/3371315"],"URL":"https:\/\/doi.org\/10.1145\/3371315","relation":{},"ISSN":["1936-1955","1936-1963"],"issn-type":[{"value":"1936-1955","type":"print"},{"value":"1936-1963","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,6]]},"assertion":[{"value":"2019-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}