Abstract

Knowledge bases play a crucial role in modern search engines and provide users with information about entities. A knowledge base may contain many facts (i.e., RDF triples) about an entity, but only a handful of them are of significance for a searcher. Identifying and ranking these RDF triples is essential for various applications of search engines, such as entity ranking and summarization. In this paper, we present the first effort towards a unified supervised approach to rank triples from various type-like relations in knowledge bases. We evaluate our approach using the recently released test collections from the WSDM Cup 2017 and demonstrate the effectiveness of the proposed approach despite the fact that no relation-specific feature is used.

Keywords

Notes

Acknowledgements

This work was partially supported in part by the Center for Intelligent Information Retrieval. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect those of the sponsors.