Entity Resolution with Hierarchical Graph Attention Networks

61Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

Entity Resolution (ER) links entities that refer to the same real-world entity from different sources. Existing work usually takes pairs of entities as input and judges those pairs independently. However, there is often interdependence between different pairs of ER decisions, e.g., the entities from the same data source are usually semantically related to each other. Furthermore, current ER approaches are mainly based on attribute similarity comparison, but ignore interdependence between attributes. To address the limits of existing methods, we propose HierGAT, a new method for ER based on a Hierarchical Graph Attention Transformer Network, which can model and exploit the interdependence between different ER decisions. The benefit of our method comes from: 1) The graph attention network model for joint ER decisions; 2) The graph-attention capability to identify the discriminative words from attributes and find the most discriminative attributes. Furthermore, we propose to learn contextual embeddings to enrich word embeddings for better performance. The experimental results on publicly available benchmark datasets show that HierGAT outperforms DeepMatcher by up to 32.5% of F1 score and up to 8.7% of F1 score compared with Ditto.

Cite

CITATION STYLE

APA

Yao, D., Gu, Y., Cong, G., Jin, H., & Lv, X. (2022). Entity Resolution with Hierarchical Graph Attention Networks. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 429–442). Association for Computing Machinery. https://doi.org/10.1145/3514221.3517872

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free