Exploiting Transitivity for Entity Matching

J. Baas; Mehdi Dastani; Ad Feelders

doi:10.1007/978-3-030-80418-3_20

Exploiting Transitivity for Entity Matching

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

The goal of entity matching in knowledge graphs is to identify sets of entities that refer to the same real-world object. Methods for entity matching in knowledge graphs, however, produce a collection of pairs of entities claimed to be duplicates. This collection that represents the sameAs relation may fail to satisfy some of its structural properties such as transitivity. We show that an ad-hoc enforcement of transitivity on the set of identified entity pairs may decrease precision. We therefore propose a methodology that starts with a given similarity measure, generates a set of entity pairs, and applies cluster editing to enforce transitivity, leading to overall improved performance.

Original language	English
Title of host publication	The Semantic Web: ESWC 2021 Satellite Events
Subtitle of host publication	Virtual Event, June 6–10, 2021, Revised Selected Papers
Editors	Ruben Verborgh, Anastasia Dimou, Aidan Hogan, Claudia d'Amato, Ilaria Tiddi, Arne Bröring, Simon Mayer, Femke Ongenae, Riccardo Tommasini, Mehwish Alam
Publisher	Springer
Pages	109-114
ISBN (Electronic)	978-3-030-80418-3
ISBN (Print)	978-3-030-80417-6
DOIs	https://doi.org/10.1007/978-3-030-80418-3_20
Publication status	Published - 31 Jul 2021
Event	European Semantic Web Conference - Online & Hersonissos, Hersonissos, Greece Duration: 6 Jun 2021 → 9 Jun 2021 Conference number: 18 https://2021.eswc-conferences.org

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	12739
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	European Semantic Web Conference
Abbreviated title	ESWC
Country/Territory	Greece
City	Hersonissos
Period	6/06/21 → 9/06/21
Internet address	https://2021.eswc-conferences.org

Keywords

Entity Matching
Digital Humantities

Access to Document

10.1007/978-3-030-80418-3_20

978-3-030-80418-3_20Final published version, 441 KBLicence: Taverne

Cite this

Baas, J., Dastani, M., & Feelders, A. (2021). Exploiting Transitivity for Entity Matching. In R. Verborgh, A. Dimou, A. Hogan, C. d'Amato, I. Tiddi, A. Bröring, S. Mayer, F. Ongenae, R. Tommasini, & M. Alam (Eds.), The Semantic Web: ESWC 2021 Satellite Events: Virtual Event, June 6–10, 2021, Revised Selected Papers (pp. 109-114). (Lecture Notes in Computer Science; Vol. 12739). Springer. https://doi.org/10.1007/978-3-030-80418-3_20

Baas, J. ; Dastani, Mehdi ; Feelders, Ad. / Exploiting Transitivity for Entity Matching. The Semantic Web: ESWC 2021 Satellite Events: Virtual Event, June 6–10, 2021, Revised Selected Papers. editor / Ruben Verborgh ; Anastasia Dimou ; Aidan Hogan ; Claudia d'Amato ; Ilaria Tiddi ; Arne Bröring ; Simon Mayer ; Femke Ongenae ; Riccardo Tommasini ; Mehwish Alam. Springer, 2021. pp. 109-114 (Lecture Notes in Computer Science).

@inproceedings{480a8d02c26f4fc9a876095ab37cf946,

title = "Exploiting Transitivity for Entity Matching",

abstract = "The goal of entity matching in knowledge graphs is to identify sets of entities that refer to the same real-world object. Methods for entity matching in knowledge graphs, however, produce a collection of pairs of entities claimed to be duplicates. This collection that represents the sameAs relation may fail to satisfy some of its structural properties such as transitivity. We show that an ad-hoc enforcement of transitivity on the set of identified entity pairs may decrease precision. We therefore propose a methodology that starts with a given similarity measure, generates a set of entity pairs, and applies cluster editing to enforce transitivity, leading to overall improved performance.",

keywords = "Entity Matching, Digital Humantities",

author = "J. Baas and Mehdi Dastani and Ad Feelders",

year = "2021",

month = jul,

day = "31",

doi = "10.1007/978-3-030-80418-3_20",

language = "English",

isbn = "978-3-030-80417-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "109--114",

editor = "Ruben Verborgh and Anastasia Dimou and Aidan Hogan and Claudia d'Amato and Ilaria Tiddi and Br{\"o}ring, {Arne } and Simon Mayer and Femke Ongenae and Riccardo Tommasini and Mehwish Alam",

booktitle = "The Semantic Web: ESWC 2021 Satellite Events",

address = "Germany",

note = "European Semantic Web Conference, ESWC ; Conference date: 06-06-2021 Through 09-06-2021",

url = "https://2021.eswc-conferences.org",

}

Baas, J, Dastani, M & Feelders, A 2021, Exploiting Transitivity for Entity Matching. in R Verborgh, A Dimou, A Hogan, C d'Amato, I Tiddi, A Bröring, S Mayer, F Ongenae, R Tommasini & M Alam (eds), The Semantic Web: ESWC 2021 Satellite Events: Virtual Event, June 6–10, 2021, Revised Selected Papers. Lecture Notes in Computer Science, vol. 12739, Springer, pp. 109-114, European Semantic Web Conference, Hersonissos, Greece, 6/06/21. https://doi.org/10.1007/978-3-030-80418-3_20

Exploiting Transitivity for Entity Matching. / Baas, J.; Dastani, Mehdi ; Feelders, Ad.
The Semantic Web: ESWC 2021 Satellite Events: Virtual Event, June 6–10, 2021, Revised Selected Papers. ed. / Ruben Verborgh; Anastasia Dimou; Aidan Hogan; Claudia d'Amato; Ilaria Tiddi; Arne Bröring; Simon Mayer; Femke Ongenae; Riccardo Tommasini; Mehwish Alam. Springer, 2021. p. 109-114 (Lecture Notes in Computer Science; Vol. 12739).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Exploiting Transitivity for Entity Matching

AU - Baas, J.

AU - Dastani, Mehdi

AU - Feelders, Ad

N1 - Conference code: 18

PY - 2021/7/31

Y1 - 2021/7/31

N2 - The goal of entity matching in knowledge graphs is to identify sets of entities that refer to the same real-world object. Methods for entity matching in knowledge graphs, however, produce a collection of pairs of entities claimed to be duplicates. This collection that represents the sameAs relation may fail to satisfy some of its structural properties such as transitivity. We show that an ad-hoc enforcement of transitivity on the set of identified entity pairs may decrease precision. We therefore propose a methodology that starts with a given similarity measure, generates a set of entity pairs, and applies cluster editing to enforce transitivity, leading to overall improved performance.

AB - The goal of entity matching in knowledge graphs is to identify sets of entities that refer to the same real-world object. Methods for entity matching in knowledge graphs, however, produce a collection of pairs of entities claimed to be duplicates. This collection that represents the sameAs relation may fail to satisfy some of its structural properties such as transitivity. We show that an ad-hoc enforcement of transitivity on the set of identified entity pairs may decrease precision. We therefore propose a methodology that starts with a given similarity measure, generates a set of entity pairs, and applies cluster editing to enforce transitivity, leading to overall improved performance.

KW - Entity Matching

KW - Digital Humantities

UR - https://jurian.github.io/eswc2021/

U2 - 10.1007/978-3-030-80418-3_20

DO - 10.1007/978-3-030-80418-3_20

M3 - Conference contribution

SN - 978-3-030-80417-6

T3 - Lecture Notes in Computer Science

SP - 109

EP - 114

BT - The Semantic Web: ESWC 2021 Satellite Events

A2 - Verborgh, Ruben

A2 - Dimou, Anastasia

A2 - Hogan, Aidan

A2 - d'Amato, Claudia

A2 - Tiddi, Ilaria

A2 - Bröring, Arne

A2 - Mayer, Simon

A2 - Ongenae, Femke

A2 - Tommasini, Riccardo

A2 - Alam, Mehwish

PB - Springer

T2 - European Semantic Web Conference

Y2 - 6 June 2021 through 9 June 2021

ER -

Baas J, Dastani M , Feelders A. Exploiting Transitivity for Entity Matching. In Verborgh R, Dimou A, Hogan A, d'Amato C, Tiddi I, Bröring A, Mayer S, Ongenae F, Tommasini R, Alam M, editors, The Semantic Web: ESWC 2021 Satellite Events: Virtual Event, June 6–10, 2021, Revised Selected Papers. Springer. 2021. p. 109-114. (Lecture Notes in Computer Science). doi: 10.1007/978-3-030-80418-3_20

Exploiting Transitivity for Entity Matching

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this