Towards Combinational Relation Linking over Knowledge Graphs
Table 2: Results of competitors and our approach on compound phrase linking
['Method', 'Precision', 'Recall', 'F-score']
Results of competitors and our approach. We can find that methods keyword match and similarity search performs very poorly with low precision and recall. That is because they can just link a phrase to a single predicate or property. However, most compound phrases match subgraph patterns with multiple edges rather than a single relation pattern directly. Another reason of SIBKB performing poorly is that it depends on PATTY database to find out synonyms for relation keywords. However, PATTY database contains a very limited number of synonyms. The performance will degrade greatly once it does not contain the compound phrases. Though data-driven linking achieves a relatively high recall, its precision rather low, which the overall F-score correspondingly. In contrast, our approach powered by meta patterns performs much better than the data-driven linking as it achieves a good balance between precision and recall.