An ensemble model for link prediction based on graph embedding

被引:25
作者
Chen, Yen-Liang [1 ]
Hsiao, Chen-Hsin [1 ]
Wu, Chia-Chi [2 ]
机构
[1] Natl Cent Univ, Sch Management, Dept Informat Management, Chungli 32001, Taiwan
[2] Natl Chung Hsing Univ, Coll Management, Dept Mkt, 145 Xingda Rd, Taichung 402, Taiwan
关键词
Link prediction; Ensemble learning; Graph embedding;
D O I
10.1016/j.dss.2022.113753
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页数:11
相关论文
共 54 条
[1]   Improving experimental studies about ensembles of classifiers for bankruptcy prediction and credit scoring [J].
Abellan, Joaquin ;
Mantas, Carlos J. .
EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (08) :3825-3830
[2]  
Ahmed A., 2013, WWW, P37
[3]   Friendship Prediction and Homophily in Social Media [J].
Aiello, Luca Maria ;
Barrat, Alain ;
Schifanella, Rossano ;
Cattuto, Ciro ;
Markines, Benjamin ;
Menczer, Filippo .
ACM TRANSACTIONS ON THE WEB, 2012, 6 (02)
[4]  
Al Hasan M., 2006, P WORKSHOP LINK DISC
[5]  
Ba J., 2013, Adv. Neural Inf. Process. Syst., P3084, DOI DOI 10.1109/ACCESS.2019.2929174
[6]   A random forest guided tour [J].
Biau, Gerard ;
Scornet, Erwan .
TEST, 2016, 25 (02) :197-227
[7]  
Breiman L, 1996, MACH LEARN, V24, P123, DOI 10.1023/A:1018054314350
[8]   A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications [J].
Cai, HongYun ;
Zheng, Vincent W. ;
Chang, Kevin Chen-Chuan .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (09) :1616-1637
[9]   Select the potential brand spokesperson on social network based on the smart link prediction [J].
Cai, Nannan ;
Li, Shugang ;
Yu, Zhaoxu ;
Shi, Miaojing .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2019, 37 (01) :625-634
[10]  
Cao Shaosheng, 2015, P 24 ACM INT C INF K, P891