DIVERSUM: Towards diversified summarisation of entities in knowledge graphs

摘要

A problem of diversified entity summarisation in RDF-like knowledge graphs, with limited ¿presentation budget¿, is formulated and studied. A greedy algorithm that adapts previous ideas from IR is proposed and preliminary but promising experimental results on real dataset extracted from IMDB database are presented.