Application of ant-colony optimisation to compute diversified entity summarisation on semantic knowledge graphs

Author

Kosinski, Witold ; Kusmierczyk, Tomasz ; Rembelski, Pawel ; Sydow, Marcin

Author_Institution

Dept. of Comput. Sci., Polish-Japanese Institue of Inf. Technol., Warsaw, Poland

fYear

2013

fDate

8-11 Sept. 2013

Firstpage

69

Lastpage

76

Abstract

We present ant colony optimisation approach, enriched with a novel self-adaptation mechanism, applied to solve DIVERSUM Problem that consist of generating a small diversified entity summarisation in a knowledge graph. The recently proposed DIVERSUM problem is viewed in this paper in a novel way as a NP-hard combinatorial optimisation problem. The presented preliminary experimental results indicate superiority of this approach to the previously proposed solutions to the DIVERSUM problem.

Keywords

ant colony optimisation; computational complexity; graph theory; DIVERSUM problem; NP-hard combinatorial optimisation problem; ant colony optimisation approach; ant-colony optimisation; diversified entity summarisation; self-adaptation mechanism; semantic knowledge graph; Computer science; Indexes; Linear programming; Optimization; Semantics; Thyristors; Vectors; Ant Colony Optimisation; Diversified Entity Summarisation; Max Sum Dispersion; Semantic Knowledge Graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Information Systems (FedCSIS), 2013 Federated Conference on

Conference_Location

Krako??w

Type

conf

Filename

6643978