SPEA: Large-Scale Entity Alignment via Self-Partitioning

The task of entity alignment (EA) seeks to identify corresponding entities across different knowledge graphs (KGs). However, in large-scale KG alignment tasks, the complexity of the problem renders traditional entity structure representation methods, designed for small-scale KGs, ineffective. Partition-based approaches address this challenge by breaking large KGs into smaller subgraphs, but this inevitably results in a loss of structural information. Although existing methods have sought to mitigate this issue, they have largely overlooked the interplay between partitioning and entity structure representation learning. To address this, we propose a Self-Partitioning Entity Alignment (SPEA) pipeline for large-scale EA, in which partitioning and entity structure representation learning are mutually optimized. Within this framework, we introduce the Inter-Subgraph Neighbor Interaction (ISNI) for enhanced entity structure representation, the Bidirectional Margin-based Confidence (BMC) for pseudo-pairing, the Seed-oriented Cross Graph Partitioner (SCGP) for dynamic repartitioning, and the Historical Confidence Ensembling (HCE) strategy for consistent training. Extensive experiments demonstrate that SPEA significantly outperforms existing methods for large-scale EA tasks.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10889854
Primary Topic
Advanced Data Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SPEA: Large-Scale Entity Alignment via Self-Partitioning

Kele Xu, Yuan Yuan, Wei Chen, Zhen Dong et al.
Advanced Data Processing Techniques
article

SPEA: Large-Scale Entity Alignment via Self-Partitioning

Kele Xu, Yuan Yuan, Wei Chen, Zhen Dong, Changjian Wang, Weiguo Chen
article en

Abstract

The task of entity alignment (EA) seeks to identify corresponding entities across different knowledge graphs (KGs). However, in large-scale KG alignment tasks, the complexity of the problem renders traditional entity structure representation methods, designed for small-scale KGs, ineffective. Partition-based approaches address this challenge by breaking large KGs into smaller subgraphs, but this inevitably results in a loss of structural information. Although existing methods have sought to mitigate this issue, they have largely overlooked the interplay between partitioning and entity structure representation learning. To address this, we propose a Self-Partitioning Entity Alignment (SPEA) pipeline for large-scale EA, in which partitioning and entity structure representation learning are mutually optimized. Within this framework, we introduce the Inter-Subgraph Neighbor Interaction (ISNI) for enhanced entity structure representation, the Bidirectional Margin-based Confidence (BMC) for pseudo-pairing, the Seed-oriented Cross Graph Partitioner (SCGP) for dynamic repartitioning, and the Historical Confidence Ensembling (HCE) strategy for consistent training. Extensive experiments demonstrate that SPEA significantly outperforms existing methods for large-scale EA tasks.

National University of Defense Technology (CN)
Openalex Percentile: Top 95%
Advanced Data Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

SPEA: Large-Scale Entity Alignment via Self-Partitioning — Kele Xu, Yuan Yuan, et al. · (2025) | TGRS Research Map | TGRS