Unsupervised Entity Alignment Based on Personalized Discriminative Rooted Tree

๐Ÿ“… 2025-02-14
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
This work addresses two key challenges in unsupervised entity alignment (EA): (1) embedding homogenization, caused by shared aggregation paths in graph neural networks (GNNs) that hinder entity-level personalization; and (2) cross-graph distribution shift, exacerbated by the absence of supervision and leading to structural mismatch between knowledge graphs. To tackle these, we propose a personalized root-tree modeling framework: discriminative root-tree sampling constructs entity-specific neighborhoods, and tree-based attention aggregation generates distinctive embeddings; additionally, a mutual information maximization (MIM) auxiliary task explicitly enforces cross-graph embedding distribution consistency in a fully unsupervised manner. Our approach eliminates reliance on seed alignments and establishes the first EA paradigm integrating personalized topological modeling with unsupervised mutual information regularization. Experiments demonstrate new state-of-the-art performance for unsupervised EA across multiple benchmarks, surpassing most supervised baselines.

Technology Category

Application Category

๐Ÿ“ Abstract
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.
Problem

Research questions and friction points this paper is trying to address.

Unsupervised entity alignment in knowledge graphs
Personalized entity embeddings extraction
Mitigation of distribution distortion between KGs
Innovation

Methods, ideas, or system contributions that make the work stand out.

Unsupervised entity alignment technique
Personalized tree attention aggregation
Mutual information maximization regularization
Y
Yaming Yang
State Key Laboratory of Integrated Services Networks, School of Computer Science and Technology, Xidian University, Xiโ€™an, China 710071
Z
Zhe Wang
State Key Laboratory of Integrated Services Networks, School of Computer Science and Technology, Xidian University, Xiโ€™an, China 710071
Ziyu Guan
Ziyu Guan
Xidian University
Data miningmachine learningsocial media
W
Wei Zhao
State Key Laboratory of Integrated Services Networks, School of Computer Science and Technology, Xidian University, Xiโ€™an, China 710071
X
Xinyan Huang
Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education, School of Artificial Intelligence, Xidian University, Xiโ€™an, China 710071
Xiaofei He
Xiaofei He
Professor of Computer Science, Zhejiang University
machine learningcomputer visiondata mining