Skip to main content
main-content
Top

Hint

Swipe to navigate through the chapters of this book

2021 | OriginalPaper | Chapter

Exploiting Transitivity for Entity Matching

Authors : Jurian Baas, Mehdi M. Dastani, Ad J. Feelders

Published in: The Semantic Web: ESWC 2021 Satellite Events

Publisher: Springer International Publishing

share
SHARE

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.
Literature
4.
go back to reference Chen, M., Tian, Y., Chang, K.W., Skiena, S., Zaniolo, C.: Co-training embeddings of knowledge graphs and entity descriptions for cross-lingual entity alignment. arXiv preprint arXiv:​1806.​06478 (2018) Chen, M., Tian, Y., Chang, K.W., Skiena, S., Zaniolo, C.: Co-training embeddings of knowledge graphs and entity descriptions for cross-lingual entity alignment. arXiv preprint arXiv:​1806.​06478 (2018)
6.
go back to reference Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Truss, A., Böcker, S.: Exact and heuristic algorithms for weighted cluster editing. In: Computational Systems Bioinformatics, vol. 6, pp. 391–401. World Scientific (2007) Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Truss, A., Böcker, S.: Exact and heuristic algorithms for weighted cluster editing. In: Computational Systems Bioinformatics, vol. 6, pp. 391–401. World Scientific (2007)
7.
go back to reference Saeedi, A., Nentwig, M., Peukert, E., Rahm, E.: Scalable matching and clustering of entities with famer. Complex Syst. Inform. Model. Q. 16, 61–83 (2018) CrossRef Saeedi, A., Nentwig, M., Peukert, E., Rahm, E.: Scalable matching and clustering of entities with famer. Complex Syst. Inform. Model. Q. 16, 61–83 (2018) CrossRef
9.
go back to reference Trisedya, B.D., Qi, J., Zhang, R.: Entity alignment between knowledge graphs using attribute embeddings. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 297–304 (2019) Trisedya, B.D., Qi, J., Zhang, R.: Entity alignment between knowledge graphs using attribute embeddings. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 297–304 (2019)
10.
go back to reference Weiss, G.M.: Mining with rarity: a unifying framework. ACM Sigkdd Explorations Newsletter 6(1), 7–19 (2004) Weiss, G.M.: Mining with rarity: a unifying framework. ACM Sigkdd Explorations Newsletter 6(1), 7–19 (2004)
11.
go back to reference Zhu, H., Xie, R., Liu, Z., Sun, M.: Iterative entity alignment via joint knowledge embeddings. IJCAI 17, 4258–4264 (2017) Zhu, H., Xie, R., Liu, Z., Sun, M.: Iterative entity alignment via joint knowledge embeddings. IJCAI 17, 4258–4264 (2017)
Metadata
Title
Exploiting Transitivity for Entity Matching
Authors
Jurian Baas
Mehdi M. Dastani
Ad J. Feelders
Copyright Year
2021
DOI
https://doi.org/10.1007/978-3-030-80418-3_20