Entity Summarisation with Limited Edge Budget on Knowledge Graphs

We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this problem. The algorithm has been implemented together with a visualising tool. Experimental user evaluation of the algorithm was conducted on real large semantic knowledge graphs extracted from the web. The reported results of experimental user evaluation are promising and encourage to continue the work on improving the algorithm.

• Type: Journal
• Year: 2010
• Where: IMCSIT
• Authors: Marcin Sydow, Mariusz Pikula, Ralf Schenkel, Adam Siemion
• Keywords: Algorithm, Entity-relationship Knowledge Graphs, IMCSIT 2010, Information Technology, Knowledge Graphs