LINQS

STATISTICAL RELATIONAL LEARNING GROUP @ UMD



 

Knowledge Graph Identification

International Semantic Web Conference (ISWC) - 2013
Note: Winner of Best Student Paper award  
Download the publication : pujara_iswc13.pdf [520Ko]  
Large-scale information processing systems are able to extract massive collections of interrelated facts, but unfortunately transforming these candidate facts into useful knowledge is a formidable challenge. In this paper, we show how uncertain extractions about entities and their relations can be transformed into a knowledge graph. The extractions form an extraction graph and we refer to the task of removing noise, inferring missing information, and determining which candidate facts should be included into a knowledge graph as knowledge graph identification. In order to perform this task, we must reason jointly about candidate facts and their associated extraction confidences, identify co-referent entities, and incorporate ontological constraints. Our proposed approach uses probabilistic soft logic (PSL), a recently introduced probabilistic modeling framework which easily scales to millions of facts. We demonstrate the power of our method on a synthetic Linked Data corpus derived from the MusicBrainz music community and a real-world set of extractions from the NELL project containing over 1M extractions and 70K ontological relations. We show that compared to existing methods, our approach is able to achieve improved AUC and F1 with significantly lower running time.

BibTex references

@InProceedings{pujara:iswc13,
  author       = "Pujara, Jay and Miao, Hui and Getoor, Lise and Cohen, William",
  title        = "Knowledge Graph Identification",
  booktitle    = "International Semantic Web Conference (ISWC)",
  year         = "2013",
  note         = "Winner of Best Student Paper award",
}

Other publications in the database