Lambda: Learning Matchable Prior For Entity Alignment with Unlabeled Dangling Cases

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Yin, Hang, Xiang, Liyao, Ding, Dong, He, Yuheng, Wu, Yihan, Wang, Xinbing, Zhou, Chenghu
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910691053535232
author Yin, Hang
Xiang, Liyao
Ding, Dong
He, Yuheng
Wu, Yihan
Wang, Xinbing
Zhou, Chenghu
author_facet Yin, Hang
Xiang, Liyao
Ding, Dong
He, Yuheng
Wu, Yihan
Wang, Xinbing
Zhou, Chenghu
contents We investigate the entity alignment (EA) problem with unlabeled dangling cases, meaning that partial entities have no counterparts in the other knowledge graph (KG), and this type of entity remains unlabeled. To address this challenge, we propose the framework \textit{Lambda} for dangling detection and then entity alignment. Lambda features a GNN-based encoder called KEESA with spectral contrastive learning for EA and a positive-unlabeled learning algorithm for dangling detection called iPULE. iPULE offers theoretical guarantees of unbiasedness, uniform deviation bounds, and convergence. Experimental results demonstrate that each component contributes to overall performances that are superior to baselines, even when baselines additionally exploit 30\% of dangling entities labeled for training.
format Preprint
id arxiv_https___arxiv_org_abs_2403_10978
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Lambda: Learning Matchable Prior For Entity Alignment with Unlabeled Dangling Cases
Yin, Hang
Xiang, Liyao
Ding, Dong
He, Yuheng
Wu, Yihan
Wang, Xinbing
Zhou, Chenghu
Computation and Language
Information Retrieval
I.2.4; H.3.3
We investigate the entity alignment (EA) problem with unlabeled dangling cases, meaning that partial entities have no counterparts in the other knowledge graph (KG), and this type of entity remains unlabeled. To address this challenge, we propose the framework \textit{Lambda} for dangling detection and then entity alignment. Lambda features a GNN-based encoder called KEESA with spectral contrastive learning for EA and a positive-unlabeled learning algorithm for dangling detection called iPULE. iPULE offers theoretical guarantees of unbiasedness, uniform deviation bounds, and convergence. Experimental results demonstrate that each component contributes to overall performances that are superior to baselines, even when baselines additionally exploit 30\% of dangling entities labeled for training.
title Lambda: Learning Matchable Prior For Entity Alignment with Unlabeled Dangling Cases
topic Computation and Language
Information Retrieval
I.2.4; H.3.3
url https://arxiv.org/abs/2403.10978