Although an increasing number of RDF knowledge bases are published, many of those consist primarily of instance data and lack sophisticated schemata. Having such schemata allows more powerful querying, consistency checking and debugging as well as improved inference. One of the reasons why schemata are still rare is the effort required to create them. In this project, we propose a semi-automatic schemata construction approach addressing this problem: First, the frequency of terminological axiom patterns in existing knowledge bases is discovered. Afterwards, those patterns are converted to SPARQL based pattern detection algorithms, which allow to enrich knowledge base schemata. We argue that we present the first scalable knowledge base enrichment approach based on real schema usage patterns. The approach is evaluated on a large set of knowledge bases with a quantitative and qualitative result analysis.
As an example for knowledge base enrichment, consider an axiom pattern
A ≡ B ⊓ ∃r.C
which might be instantiated by an axiom
SoccerPlayer ≡ Person ⊓ ∃team.SoccerClub
describing that every person which is in a team that is a soccer club, is a soccer player.
Adding such an axiom to a knowledge base can have several benefits:
- The axioms serve as documentation for the purpose and correct usage of schema elements.
- They improve the application of constraint violation techniques. For instance, when using a tool such as the Pellet Constraint Validator on a knowledge base with the above axiom, it would report soccer players without an associated team as violation.
- Additional implicit information can be inferred, e.g. in the above example each person, who is in a soccer club team can be inferred to belong to the class Soccer Player, which means that an explicit assignment to that class is no longer necessary.
In the execution phase the actual axiom suggestions are generated. To achieve this, a single algorithm run takes an axiom pattern and usually a specific class name as input and generates a set of OWL axioms
as a result. It proceeds in three phases:
- In the first phase, SPARQL queries are used to obtain general information about the knowledge base, in particular we retrieve axioms, which allow to construct the class hierarchy. It can be configured whether to use an OWL reasoner for inferencing over the schema or just taking explicit knowledge into account.(Naturally, the schema only needs to be obtained once per knowledge base and can then be reused by all algorithms and all entities.)
- The second phase consists of obtaining data via SPARQL, which is relevant for learning the considered axiom. This results in a set of axiom candidates, configured via a threshold.
- In the third phase, the score of axiom candidates is computed and the results returned.
The analysis of the following ontology repositories
This results in the following top 15 TBox axiom patterns occurring in at least 5 ontologies ranked by frequency. Each row contains the position/rank of the pattern in each repository. In addition, we also report the winsorised frequency: In the sorted list of pattern frequencies for each ontology (without 0-entries), we set all list entries higher than the 95th percentile to the 95th percentile. This reduces the effect of outliers, i.e. axiom patterns scoring very high because of few very large ontologies frequently using them
Top 15 TBox axiom patterns.
Top 15 axiom patterns and its sequence of total frequency when processing the ontologies in random order:
Top 15 axiom patterns and its ranking position when processing the ontologies in random order:
SPARQL Endpoint: http://live.dbpedia.org/sparql
Analyzed classes: 100 random classes with at least 5 instances
Max. time for fragment extraction: 60s
Max. 100 instantiations per pattern with an accuracy < 0.6
(The evaluation results are not final yet.)
|A SubClassOf p some B||50||88.0||1.3||10.7|
|A SubClassOf B||47||63.8||2.1||34.0|
|A EquivalentTo B||25||10.7||0.0||89.3|
|A EquivalentTo p some B||68||29.9||2.0||68.1|
|A EquivalentTo B and (p some C)||100||25.0||3.0||72.0|
|A EquivalentTo B and (p some (C and (q some D)))||100||23.0||5.3||71.7|
|A SubClassOf p some (q some B)||71||86.4||3.3||10.3|
|A SubClassOf p some (B and (q some C))||100||87.0||0.3||12.7|
|A SubClassOf p value a||15||77.8||0.0||22.2|
|A EquivalentTo B and C||42||14.3||7.1||78.6|
|A EquivalentTo B and (p some C) and (q some D)||100||38.0||2.7||59.7|
Inter-Rater Agreement(Fleiss’ Kappa) for each evaluated pattern:
|A EquivalentTo p some B||68||0.6|
|A EquivalentTo B and (p some C)||100||0.73|
|A SubClassOf p some (B and (q some C))||100||-0.03|
|A SubClassOf B||47||0.54|
|A SubClassOf p some B||50||0.19|
|A EquivalentTo B||25||0.44|
|A SubClassOf p value a||15||0.36|
|A SubClassOf p some (q some B)||71||0.4|
|A EquivalentTo B and (p some C) and (q some D)||100||0.8|
|A EquivalentTo B and C||42||0.47|
|A EquivalentTo B and (p some (C and (q some D)))||100||0.43|
Total Inter-Rater Agreement: 0.67
The following diagram shows the correlation between the accuracy value of the pattern instantiations and the confidence of the evaluators, i.e. how many of the pattern instantiations with an accuracy value in a particular interval are supposed to be correct.
To perform the analysis, question were added in 10% buckets by confidence interval (60–70%,<70%-80%,<80%-90%,<90%-100%). Only buckets with at least 5 entries were used (which is why the lines are interrupted). For most axiom types, the trend is that axioms with higher confidence are more likely to be accepted, although two of the 12 axiom types show a decline with higher confidence. We will investigate this further and also add an overall trend summary.