OLMNE+FT: Multiplex network embedding based on overlapping links

Network embedding or graph representation learning has recently attracted more researchers’ attention and achieved state-of-the-art performance in many areas and tasks. Nevertheless, most of these methods are targeted for monolayer networks and ignore the multiplexity property of nodes which refers to the multifaceted relationships between two elements. Multiplexity provides multiple types of auxiliary information to refine the characteristics of nodes and can be modeled as a multiplex network. In this study, we propose a multiplex network embedding algorithm to learn a unique embedding for each node in each layer or each relation type. A biased path-dependency random walk strategy is adopted to generate node sequences for integrating different types of relations between nodes, which pays more attention to overlapping links and makes neighbor nodes in the sampling sequence more similar to each other. Then the skip-gram model is used to learn an overall embedding over node sequences. To strengthen the expressive power of the embedding in a specific layer, a fine tuning strategy with low time cost is employed to make the embedding comprise information of nodes at this particular layer and preserve their distinctive properties, and the unique embedding is achieved ultimately. To verify the effectiveness of our algorithms, we validate the performance of our algorithm and other baseline methods in the link prediction task. The results demonstrate that the learned embedding can capture the interlayer relationships and preserve the specific characteristics of nodes, and our algorithms can stably obtain better or comparable performance compared with other methods.