PL EN


2010 | 21 |
Article title

Entity Summarisation with Limited Edge Budget on Undirected and Directed Knowledge Graphs

Content
Title variants
Languages of publication
EN
Abstracts
PL
The paper concerns 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 in two variants: undirected and directed, together with a visualisation 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. 
Keywords
PL
 
Year
Volume
21
Physical description
Dates
published
2010
online
2010-09-15
Contributors
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-doi-10_14746_il_2010_21_5
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.