{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T22:29:54Z","timestamp":1778106594360,"version":"3.51.4"},"reference-count":32,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2022,11,30]]},"abstract":"<jats:p>Knowledge Graphs (KGs) have proliferated on the Web since the introduction of knowledge panels to Google search in 2012. KGs are large data-first graph databases with weak inference rules and weakly-constraining data schemes. SHACL, the Shapes Constraint Language, is a W3C recommendation for expressing constraints on graph data as shapes. SHACL shapes serve to validate a KG, to underpin manual KG editing tasks, and to offer insight into KG structure. Often in practice, large KGs have no available shape constraints and so cannot obtain these benefits for ongoing maintenance and extension. We introduce Inverse Open Path (IOP) rules, a predicate logic formalism which presents specific shapes in the form of paths over connected entities that are present in a KG. IOP rules express simple shape patterns that can be augmented with minimum cardinality constraints and also used as a building block for more complex shapes, such as trees and other rule patterns. We define formal quality measures for IOP rules and propose a novel method to learn high-quality rules from KGs. We show how to build high-quality tree shapes from the IOP rules. Our learning method, SHACLearner, is adapted from a state-of-the-art embedding-based open path rule learner (Oprl). We evaluate SHACLearner on some real-world massive KGs, including YAGO2s (4M facts), DBpedia 3.8 (11M facts), and Wikidata (8M facts). The experiments show that our SHACLearner can effectively learn informative and intuitive shapes from massive KGs. The shapes are diverse in structural features such as depth and width, and also in quality measures that indicate confidence and generality.<\/jats:p>","DOI":"10.3233\/sw-223063","type":"journal-article","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T11:38:32Z","timestamp":1664278712000},"page":"101-121","source":"Crossref","is-referenced-by-count":8,"title":["Learning SHACL shapes from knowledge graphs"],"prefix":"10.1177","volume":"14","author":[{"given":"Pouya","family":"Ghiasnezhad Omran","sequence":"first","affiliation":[{"name":"School of Computing, The Australian National University, ACT, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerry","family":"Taylor","sequence":"additional","affiliation":[{"name":"School of Computing, The Australian National University, ACT, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rodr\u00edguez M\u00e9ndez","sequence":"additional","affiliation":[{"name":"School of Computing, The Australian National University, ACT, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armin","family":"Haller","sequence":"additional","affiliation":[{"name":"School of Computing, The Australian National University, ACT, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/SW-223063_ref1","unstructured":"R.\u00a0Agrawal and R.\u00a0Srikant, Fast algorithms for mining association rules, in: VLDB, Vol.\u00a01215, 1994, pp.\u00a0487\u2013499."},{"key":"10.3233\/SW-223063_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76298-0_52"},{"key":"10.3233\/SW-223063_ref3","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213888"},{"key":"10.3233\/SW-223063_ref4","unstructured":"I.\u00a0Boneva, J.\u00a0Dusart, D.F.\u00a0\u00c1lvarez and J.E.\u00a0Labra Gayo, Shape designer for ShEx and SHACL constraints, in: ISWC Posters, Vol.\u00a02456, 2019, pp.\u00a0269\u2013272, ISSN 16130073."},{"key":"10.3233\/SW-223063_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68288-4_7"},{"issue":"10","key":"10.3233\/SW-223063_ref7","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1002\/asi.21577","article-title":"Cultural bias in Wikipedia content on famous persons","volume":"62","author":"Callahan","year":"2011","journal-title":"Journal of the American Society for Information Science and Technology"},{"key":"10.3233\/SW-223063_ref9","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1007\/s00778-016-0444-3","article-title":"ScaLeKB: Scalable learning and inference over large knowledge bases","volume":"25","author":"Chen","year":"2016","journal-title":"The International Journal on Very Large Data Bases"},{"key":"10.3233\/SW-223063_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-49461-2_29"},{"key":"10.3233\/SW-223063_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00671-6_19"},{"key":"10.3233\/SW-223063_ref12","unstructured":"D.\u00a0Dua and C.\u00a0Graff, UCI Machine Learning Repository, 2017, archive.ics.uci.edu\/ml Retrieved Nov 2019."},{"key":"10.3233\/SW-223063_ref13","doi-asserted-by":"crossref","unstructured":"W.\u00a0Fan, C.\u00a0Hu, X.\u00a0Liu and P.\u00a0Lu, Discovering graph functional dependencies, in: SIGMOD, ACM, 2018, pp.\u00a0427\u2013439, ISSN 07308078. ISBN 9781450317436.","DOI":"10.1145\/3183713.3196916"},{"key":"10.3233\/SW-223063_ref14","unstructured":"D.\u00a0Fern\u00e1ndez-\u00c1lvarez, H.\u00a0Garc\u00eda-Gonz\u00e1lez, J.\u00a0Frey, S.\u00a0Hellmann and J.E.L.\u00a0Gayo, Inference of latent shape expressions associated to DBpedia ontology, in: ISWC Posters, Vol.\u00a02180, 2018, ISSN 16130073."},{"issue":"6","key":"10.3233\/SW-223063_ref15","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s00778-015-0394-1","article-title":"Fast rule mining in ontological knowledge bases with AMIE+","volume":"24","author":"Gal\u00e1rraga","year":"2015","journal-title":"The International Journal on Very Large Data Bases"},{"key":"10.3233\/SW-223063_ref16","unstructured":"P.\u00a0Ghiasnezhad Omran, K.\u00a0Taylor, S.\u00a0Rodr\u00edguez M\u00e9ndez and A.\u00a0Haller, Towards SHACL learning from knowledge graphs, in: {ISWC2020} Posters & Demonstrations, CEUR Proceedings, 2020."},{"key":"10.3233\/SW-223063_ref17","unstructured":"P.\u00a0Ghiasnezhad Omran, K.\u00a0Taylor, S.\u00a0Rodriguez Mendez and A.\u00a0Haller, Active knowledge graph completion, in: ISWC Satellite Tracks (Posters and Demonstrations, Industry, and Outrageous Ideas), 2020, pp.\u00a089\u201394."},{"key":"10.3233\/SW-223063_ref18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.ins.2022.05.027","volume":"604","author":"Ghiasnezhad Omran","year":"2022","journal-title":"Active Knowledge Graph Completion, Information Sciences"},{"key":"10.3233\/SW-223063_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-019-00706-9"},{"key":"10.3233\/SW-223063_ref21","unstructured":"H.\u00a0Knublauch and D.\u00a0Kontokostas, Shapes Constraint Language (SHACL), 2017, https:\/\/www.w3.org\/TR\/shacl\/."},{"key":"10.3233\/SW-223063_ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3167132.3167341"},{"key":"10.3233\/SW-223063_ref24","doi-asserted-by":"crossref","unstructured":"M.\u00a0Nickel, L.\u00a0Rosasco and T.\u00a0Poggio, Holographic embeddings of knowledge graphs, in: AAAI, 2016, pp.\u00a01955\u20131961.","DOI":"10.1609\/aaai.v30i1.10314"},{"key":"10.3233\/SW-223063_ref25","unstructured":"M.\u00a0Nickel, V.\u00a0Tresp and H.-P.\u00a0Kriegel, A three-way model for collective learning on multi-relational data, in: ICML, 2011, pp.\u00a0809\u2013816."},{"issue":"8","key":"10.3233\/SW-223063_ref26","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3331166","article-title":"Industry-scale knowledge graphs: Lessons and challenges","volume":"62","author":"Noy","year":"2019","journal-title":"Commun. ACM"},{"key":"10.3233\/SW-223063_ref27","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/297"},{"key":"10.3233\/SW-223063_ref28","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TKDE.2019.2941685","article-title":"An embedding-based approach to rule learning in knowledge graphs","volume":"33","author":"Omran","year":"2021","journal-title":"TKDE"},{"key":"10.3233\/SW-223063_ref29","unstructured":"H.J.\u00a0Pandit, D.\u00a0O\u2019Sullivan and D.\u00a0Lewis, Using ontology design patterns to define SHACL shapes, in: CEUR Workshop Proceedings, Vol.\u00a02195, 2018, pp.\u00a067\u201371, ISSN 16130073."},{"key":"10.3233\/SW-223063_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30793-6_31"},{"key":"10.3233\/SW-223063_ref31","unstructured":"B.\u00a0Spahiu, A.\u00a0Maurino and M.\u00a0Palmonari, Towards improving the quality of knowledge graphs with data-driven ontology patterns and SHACL, in: Workshop on Ontology Design and Patterns, Vol.\u00a02195, 2018, pp.\u00a052\u201366, ISSN 16130073."},{"key":"10.3233\/SW-223063_ref32","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2015.195"},{"key":"10.3233\/SW-223063_ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"issue":"2\u20133","key":"10.3233\/SW-223063_ref34","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0743-1066(99)00016-3","article-title":"Generalization by absorption of definite clauses","volume":"40","author":"Taylor","year":"1999","journal-title":"The Journal of Logic Programming"},{"issue":"10","key":"10.3233\/SW-223063_ref35","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","article-title":"Wikidata: A free collaborative knowledgebase","volume":"57","author":"Vrandecic","year":"2014","journal-title":"Commun. ACM"},{"key":"10.3233\/SW-223063_ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-62466-8_5"}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-223063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:26:38Z","timestamp":1777613198000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-223063"}},"subtitle":[],"editor":[{"given":"Jose","family":"Emilio Labra Gayo","sequence":"additional","affiliation":[{"name":"University of Oviedo, Spain"}],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Anastasia","family":"Dimou","sequence":"additional","affiliation":[{"name":"IDLab, Ghent University, Belgium"}],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Katherine","family":"Thornton","sequence":"additional","affiliation":[{"name":"Yale University Library, USA"}],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Anisa","family":"Rula","sequence":"additional","affiliation":[{"name":"University of Milano-Bicocca, Italy and University of Bonn, Germany"}],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Jose Emilio","family":"Labra Gayo","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Anastasia","family":"Dimou","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Katherine","family":"Thornton","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Anisa","family":"Rula","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,11,30]]},"references-count":32,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/sw-223063","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"value":"2210-4968","type":"electronic"},{"value":"1570-0844","type":"print"}],"subject":[],"published":{"date-parts":[[2022,11,30]]}}}