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

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.