Novel Method of Edge-Removing Walk for Graph Representation in User Identity Linkage

• Published in: Electronics (Basel) 2024-02, Vol.13 (4), p.715
• Main Authors: Xie, Xiaqing, Zang, Wenyu, Hu, Yanlin, Ji, Jiangyu, Xiong, Zhihao
• Format: Article
• Language: English
• Subjects: Algorithms; Analysis; Computational linguistics; Efficiency; Graph representations; Graph theory; Graphical representations; Language processing; Methods; Natural language interfaces; Neural networks; Random walk; Sequences; Social networks
• ISSN: 2079-9292; 2079-9292
• DOI: 10.3390/electronics13040715

Random-walk-based graph representation methods have been widely applied in User Identity Linkage (UIL) tasks, which links overlapping users between two different social networks. It can help us to obtain more comprehensive portraits of criminals, which is helpful for improving cyberspace governance. Yet, random walk generates a large number of repeating sequences, causing unnecessary computation and storage overhead. This paper proposes a novel method called Edge-Removing Walk (ERW) that can replace random walk in random-walk-based models. It removes edges once they are walked in a walk round to capture the l−hop features without repetition, and it walks the whole graph for several rounds to capture the different kinds of paths starting from a specific node. Experiments proved that ERW can exponentially improve the efficiency for random-walk-based UIL models, even maintaining better performance. We finally generalize ERW into a general User Identity Linkage framework called ERW-UIL and verify its performance.