Author Name Disambiguation Based on Multi Relationship Fusion and Representation Learning

Author Name disambiguation constitutes a critical technology for building scholar profiles and enabling accurate academic search systems. While existing unsupervised name disambiguation approaches often rely on simplistic combinations of explicit paper relationships while overlooking latent network...

Full description

Saved in:
Bibliographic Details
Published in:2025 5th International Conference on Artificial Intelligence, Big Data and Algorithms (CAIBDA) pp. 353 - 361
Main Authors: Cui, Huanqing, Huang, Qian, Yang, Junzhu, Liu, Ruixia, Hu, Kekun, Dong, Gang
Format: Conference Proceeding
Language:English
Published: IEEE 20.06.2025
Subjects:
Accuracy
Autoencoders
Clustering algorithms
graph embedding
Heuristic algorithms
multi-relation fusion
name disambiguation
Performance gain
Reliability
Representation learning
Semantics
Supervised learning
unsupervised
variational graph autoencoder
Vectors
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Author Name disambiguation constitutes a critical technology for building scholar profiles and enabling accurate academic search systems. While existing unsupervised name disambiguation approaches often rely on simplistic combinations of explicit paper relationships while overlooking latent network structures, this study develops an advanced disambiguation framework through multi-relational feature fusion. Our model systematically constructs a scholarly information network incorporating both semantic features (professional term sets from titles, abstracts and keywords) and relational patterns (implicit connections via important authors), learns unified paper representations using Variational Graph Autoencoder (VGAE), and produces final clusters through Hierarchical Agglomerative Clustering (HAC). Experimental validation on the AMiner-na benchmark demonstrates significant performance gains, with ournum and our-distance methods achieving F1-scores of \mathbf{6 8. 9 \%} and 63.25 % respectively, substantially outperforming conventional baselines by effectively exploiting both explicit and implicit academic data characteristics.
DOI:10.1109/CAIBDA65784.2025.11182797