Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

ESBM: An Entity Summarization BenchMark (2003.03734v1)

Published 8 Mar 2020 in cs.IR, cs.CL, and cs.DB

Abstract: Entity summarization is the problem of computing an optimal compact summary for an entity by selecting a size-constrained subset of triples from RDF data. Entity summarization supports a multiplicity of applications and has led to fruitful research. However, there is a lack of evaluation efforts that cover the broad spectrum of existing systems. One reason is a lack of benchmarks for evaluation. Some benchmarks are no longer available, while others are small and have limitations. In this paper, we create an Entity Summarization BenchMark (ESBM) which overcomes the limitations of existing benchmarks and meets standard desiderata for a benchmark. Using this largest available benchmark for evaluating general-purpose entity summarizers, we perform the most extensive experiment to date where 9~existing systems are compared. Considering that all of these systems are unsupervised, we also implement and evaluate a supervised learning based system for reference.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Qingxia Liu (7 papers)
  2. Gong Cheng (78 papers)
  3. Kalpa Gunaratna (13 papers)
  4. Yuzhong Qu (30 papers)
Citations (16)

Summary

We haven't generated a summary for this paper yet.