{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/entity-resolution-with-hierarchical-graph","title":"Entity Resolution with Hierarchical Graph Attention Networks","arxiv_id":null,"date":"2022-06-01","proceeding":"SIGMOD/PODS 2022 6","authors":["Dezhong Yao","Yuhong Gu","Gao Cong","Hai Jin","Xinqiao Lv"],"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.","url_abs":"https://dl.acm.org/doi/10.1145/3514221.3517872","url_pdf":"https://dl.acm.org/doi/pdf/10.1145/3514221.3517872","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"entity-resolution-with-hierarchical-graph","repo_url":"https://github.com/CGCL-codes/HierGAT","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"entity-resolution","task_name":"Entity Resolution"},{"task_slug":"graph-attention","task_name":"Graph Attention"},{"task_slug":"word-embeddings","task_name":"Word Embeddings"}],"methods":[{"method_slug":"absolute-position-encodings","method_name":"Absolute Position Encodings"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"label-smoothing","method_name":"Label Smoothing"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"position-wise-feed-forward-layer","method_name":"Position-Wise Feed-Forward Layer"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"transformer","method_name":"Transformer"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/entity-resolution-on-abt-buy","task":"Entity Resolution","dataset":"Abt-Buy","model":"HG","rank_in_archive_order":6,"of":16,"metrics":{"F1 (%)":"89.8"},"uses_additional_data":false},{"leaderboard":"/sota/entity-resolution-on-amazon-google","task":"Entity Resolution","dataset":"Amazon-Google","model":"HG","rank_in_archive_order":6,"of":17,"metrics":{"F1 (%)":"76.4"},"uses_additional_data":false},{"leaderboard":"/sota/entity-resolution-on-wdc-computers-small","task":"Entity Resolution","dataset":"WDC Computers-small","model":"HG","rank_in_archive_order":3,"of":6,"metrics":{"F1 (%)":"88.50"},"uses_additional_data":false},{"leaderboard":"/sota/entity-resolution-on-wdc-computers-xlarge","task":"Entity Resolution","dataset":"WDC Computers-xlarge","model":"HG","rank_in_archive_order":4,"of":6,"metrics":{"F1 (%)":"96.50"},"uses_additional_data":false},{"leaderboard":"/sota/entity-resolution-on-wdc-watches-small","task":"Entity Resolution","dataset":"WDC Watches-small","model":"HG","rank_in_archive_order":1,"of":4,"metrics":{"F1 (%)":"94"},"uses_additional_data":false},{"leaderboard":"/sota/entity-resolution-on-wdc-watches-xlarge","task":"Entity Resolution","dataset":"WDC Watches-xlarge","model":"HG","rank_in_archive_order":3,"of":3,"metrics":{"F1 (%)":"96.50"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"CGCL-codes/HierGAT","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"3483609b27f98f20ff5c8457d8b59d94ce7ce1f3f7c890b4a4e749cdb6241132","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}