无需种子对齐,用树状注意力实现个性化实体对齐
Unsupervised Entity Alignment Based on Personalized Discriminative Rooted Tree
- 为每个实体构建个性化树结构,通过注意力机制生成专属嵌入
- 引入互信息最大化辅助任务,缓解知识图谱间分布偏移
- 在无监督场景下超越多数有监督基线,适合跨域知识融合
实体对齐(EA)旨在链接不同知识图谱中可能等价的实体。现有大多数方法依赖种子对齐(即人工标注的对齐实体对),属于有监督学习。尽管近期研究尝试摆脱种子对齐,但仍存在两大局限:(1) 其基于GNN的编码器生成的实体嵌入缺乏个性化,因部分聚合路径被不同实体共享;(2) 由于缺少监督信号,无法充分缓解候选知识图谱间的分布失真问题。本文提出一种新型无监督实体对齐方法UNEA,以解决上述问题。首先,参数化地为每个实体采样根植于自身的树邻域,并设计树注意力聚合机制,提取个性化嵌入;其次,引入最大化输入与输出之间互信息的辅助任务,正则化模型并抑制分布失真。大量实验表明,UNEA在无监督实体对齐任务上达到新基准性能,甚至优于多个已有有监督基线。
原文摘要 · Abstract (English)
Entity Alignment (EA) is to link potential equivalent entities across different knowledge graphs (KGs). Most existing EA methods are supervised as they require the supervision of seed alignments, i.e., manually specified aligned entity pairs. Very recently, several EA studies have made some attempts to get rid of seed alignments. Despite achieving preliminary progress, they still suffer two limitations: (1) The entity embeddings produced by their GNN-like encoders lack personalization since some of the aggregation subpaths are shared between different entities. (2) They cannot fully alleviate the distribution distortion issue between candidate KGs due to the absence of the supervised signal. In this work, we propose a novel unsupervised entity alignment approach called UNEA to address the above two issues. First, we parametrically sample a tree neighborhood rooted at each entity, and accordingly develop a tree attention aggregation mechanism to extract a personalized embedding for each entity. Second, we introduce an auxiliary task of maximizing the mutual information between the input and the output of the KG encoder, to regularize the model and prevent the distribution distortion. Extensive experiments show that our UNEA achieves a new state-of-the-art for the unsupervised EA task, and can even outperform many existing supervised EA baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。