.png){kind=icon}
.png){kind=icon}
Return
An ensemble model for link prediction based on graph embedding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.dss.2022.113753.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A network is a form of data representation and is widely used in many fields. For example, in social networks, we regard nodes as individuals or groups, and the edges between nodes are called links, that is, the interaction between people. By analyzing the interaction of nodes, we can learn more about network relationships. The core idea of link prediction is to predict whether there is a new relationship between a pair of nodes or to discover hidden links in the network. Link prediction has been applied to many fields such as social networking, e-commerce, bioinformatics, and so on. In addition, many studies have used graph embedding for link prediction, which effectively preserves the network structure and converts node information into a low-dimensional vector space. In this research, we used three graph embedding approaches: matrix decomposition based methods, random walk based methods, and deep learning based methods. Since each method has its own advantages and disadvantages, we propose an ensemble model to combine these graph embeddings into a new representation of each node. Then, we designed a two-stage link prediction model based on a multi-classifier ensemble and took the new node representation as its input. Performance evaluation was conducted on multiple data sets. Exper-imental results show that the integration of multiple embedding methods and multiple classifiers can signifi-cantly improve the performance of link prediction.
Keywords:
Link prediction
Ensemble learning
Graph embedding
Journal
IF:
6.8
Papers:
3.8K
Citations:
1.5W