Populating Web Scale Knowledge Graphs using Distantly Supervised Relation Extraction and Validation
Table 3: KBP’s increased AUC by minimum connectivity group
['Min. Conn.', 'NYT-FB', 'CC-DBP', 'NELL- [ITALIC] Cat']
To test this hypothesis, we define minimum connectivity for a triple to be the minimum of the number of triples in which each argument is present. So triples with high minimum connectivity have arguments with KBC embeddings that were influenced by many other triples. We group the triples by their minimum connectivity and calculate the increase in AUC for IE,KBV,KBVIE relative to IE alone for different buckets of triple minimum connectivity.