Cross-social-network user alignment research based on multi-dimensional user features

Accurately aligning the same users on different flat social networks to merge user information and create more nuanced user profiles is critical. However, the current research in this area faces challenges related to low efficiency and inadequate alignment accuracy. To address these challenges, we introduce a cross-social network user alignment model based on multi-dimensional user features (MDUF). First, inspired by the principles of entity recognition and Hartley's association method, we employed a block matrix association algorithm to project the original dataset into different high-dimensional spaces. Second, we proposed a new inertia weight calculation method to improve the convergence speed from linear to nonlinear transformations. This method improves the performance of traditional particle swarm optimization algorithms. Finally, we utilize improved particle swarm optimization and residual connection techniques to optimize bidirectional long short-term memory networks. The experimental results show that our proposed model significantly outperforms traditional alignment models in terms of alignment efficiency and accuracy, which is highly practical and has the potential to inspire further research on social network user alignment.

Authors

Institutions

Publication Details

Journal
Systems Science & Control Engineering
Published
2024-12-07
DOI
https://doi.org/10.1080/21642583.2024.2436660
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cross-social-network user alignment research based on multi-dimensional user features

Dianjie Bi, Xuemin Chen, Zecheng Wang, Tao Zhao et al.
Systems Science & Control Engineering
Complex Network Analysis Techniques
article

Cross-social-network user alignment research based on multi-dimensional user features

Dianjie Bi, Xuemin Chen, Zecheng Wang, Tao Zhao, Heng Gao
article en

Abstract

Accurately aligning the same users on different flat social networks to merge user information and create more nuanced user profiles is critical. However, the current research in this area faces challenges related to low efficiency and inadequate alignment accuracy. To address these challenges, we introduce a cross-social network user alignment model based on multi-dimensional user features (MDUF). First, inspired by the principles of entity recognition and Hartley's association method, we employed a block matrix association algorithm to project the original dataset into different high-dimensional spaces. Second, we proposed a new inertia weight calculation method to improve the convergence speed from linear to nonlinear transformations. This method improves the performance of traditional particle swarm optimization algorithms. Finally, we utilize improved particle swarm optimization and residual connection techniques to optimize bidirectional long short-term memory networks. The experimental results show that our proposed model significantly outperforms traditional alignment models in terms of alignment efficiency and accuracy, which is highly practical and has the potential to inspire further research on social network user alignment.

Systems Science & Control EngineeringVol. 12(1)
Anhui University of Finance and Economics (CN), Texas Southern University (US)
Anhui Provincial Department of Education, Natural Science Foundation of Anhui Province
Openalex Percentile: Top 79%
Complex Network Analysis 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.