LAUSR

Recently, the problem of user identification across multiple social networks (UIAMSNs) has attracted considerable attention since it is a prerequisite for many downstream tasks and applications. Although substantial network feature-based approaches have been proposed to solve the UIAMSNs' problem, the matching degree in most of the current works is given by experience, which lacks a solid theoretical basis. To alleviate the above predicament, we propose a user identification algorithm based on naive Bayes model (UI-NBM) within the network feature-based framework. First, a matching degree index is designed based on the naive Bayes model, which can accurately measure the contributions of different common matched node pairs (MNPs) to the connection probability of unmatched node pairs (UMNPs). Second, the matching degrees of all UMNPs are formulated as the product of matrices, giving rise to the great reduction of the time complexity and the compact expression; Finally, with the idea of recursion process, more UMNPs can be iteratively predicted even when only a small amount of prior information (i.e., a few number of MNPs) is known. The experimental results on the synthetic and real cross platforms demonstrate that the method outperforms the baseline methods within the feature-based framework.