2 papers
cs.LG2019
Using Pairwise Occurrence Information to Improve Knowledge Graph Completion on Large-Scale Datasets
Esma Balkir, Masha Naslidnyk, Dave Palfrey +1
Bilinear models such as DistMult and ComplEx are effective methods for knowledge graph (KG) completion. However, they require large batch sizes, which becomes a performance bottlen…
cs.AI2018
Demand-Weighted Completeness Prediction for a Knowledge Base
Andrew Hopkinson, Amit Gurdasani, Dave Palfrey +1
In this paper we introduce the notion of Demand-Weighted Completeness, allowing estimation of the completeness of a knowledge base with respect to how it is used. Defining an entit…