Entity Resolution (ER) is the task of identifying pairs of records that refer to the same real-world entity (e.g., same products or persons). Pretrained Language Models (PLMs) achieve state-of-the-art ER performance but rely on large labeled datasets, which are costly to acquire. Data augmentation (DA) addresses this issue by generating synthetic training samples, yet methods like MixDA often produce unrealistic samples, limiting their effectiveness. In this paper, we propose a novel DA pipeline that integrates MixDA with symbolic rule-based validation. Our approach generates samples in the embedding space, reconstructs their textual representations via a generative model, and applies domain-specific rules to ensure real-world validity. Experiments on public ER benchmarks demonstrate that our method achieves F1-scores comparable to, and in some cases exceeding, those of PLM-based baselines trained on the full dataset. This work advances data-centric AI by reducing the costs associated with labeling.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Domain-Constrained Data Augmentation for Entity Resolution

  • Marco Napoleone,
  • Marco Console,
  • Maurizio Lenzerini,
  • Paolo Merialdo,
  • Laura Papi,
  • Antonella Poggi,
  • Federico Scafoglieri,
  • Riccardo Torlone

摘要

Entity Resolution (ER) is the task of identifying pairs of records that refer to the same real-world entity (e.g., same products or persons). Pretrained Language Models (PLMs) achieve state-of-the-art ER performance but rely on large labeled datasets, which are costly to acquire. Data augmentation (DA) addresses this issue by generating synthetic training samples, yet methods like MixDA often produce unrealistic samples, limiting their effectiveness. In this paper, we propose a novel DA pipeline that integrates MixDA with symbolic rule-based validation. Our approach generates samples in the embedding space, reconstructs their textual representations via a generative model, and applies domain-specific rules to ensure real-world validity. Experiments on public ER benchmarks demonstrate that our method achieves F1-scores comparable to, and in some cases exceeding, those of PLM-based baselines trained on the full dataset. This work advances data-centric AI by reducing the costs associated with labeling.