@Article{iasc.2022.020218,
AUTHOR = {Donglei Lu, Yundong Sun, Qinrui Dai, Xiaofang Li, Dongjie Zhu, Haiwen Du, Yansong Wang, Rongning Qu, Ning Cao, Gregory M. P. O’Hare},
TITLE = {MSM: A Method of Multi-Neighborhood Sampling Matching for Entity Alignment},
JOURNAL = {Intelligent Automation \& Soft Computing},
VOLUME = {32},
YEAR = {2022},
NUMBER = {2},
PAGES = {1141--1151},
URL = {http://www.techscience.com/iasc/v32n2/45575},
ISSN = {2326-005X},
ABSTRACT = {The heterogeneity of knowledge graphs brings great challenges to entity alignment. In particular, the attributes of network entities in the real world are complex and changeable. The key to solving this problem is to expand the neighborhoods in different ranges and extract the neighborhood information efficiently. Based on this idea, we propose Multi-neighborhood Sampling Matching Network (MSM), a new KG alignment network, aiming at the structural heterogeneity challenge. MSM constructs a multi-neighborhood network representation learning method to learn the KG structure embedding. It then adopts a unique sampling and cosine cross-matching method to solve different sizes of neighborhoods and distinct topological structures in two entities. To choose the right neighbors, we apply a down-sampling process to select the most informative entities towards the central target entity from its one-hop and two-hop neighbors. To verify the effectiveness of matching this neighborhood with any neighborhood in the corresponding node, we give a cosine cross-graph neighborhood matching method and conduct detailed research and analysis on three entity matching datasets, which proves the effectiveness of MSM.},
DOI = {10.32604/iasc.2022.020218}
}