Exploiting Cluster-based Meta Paths for Link Prediction in Signed Networks

被引:2
作者
Zeng, Jiangfeng [1 ]
Zhou, Ke [1 ]
Ma, Xiao [1 ]
Zou, Fuhao [1 ]
Wang, Hua [1 ]
机构
[1] Huazhong Univ Sci & Technol, Wuhan 430074, Peoples R China
来源
CIKM'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT | 2016年
关键词
Signed Networks; Link prediction; Cluster-based Meta Path; SOCIAL NETWORKS;
D O I
10.1145/2983323.2983870
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many online social networks can be described by signed networks, where positive links signify friendships, trust and like; while negative links indicate enmity, distrust and dislike. Predicting the sign of the links in these networks has attracted a great deal of attentions in the areas of friendship recommendation and trust relationship prediction. Existing methods for sign prediction tend to rely on path-based features which are somehow limited to the sparsity problem of the network. In order to solve this issue, in this paper, we introduce a novel sign prediction model by exploiting cluster-based meta paths, which can take advantage of both local and global information of the input networks. First, cluster-based meta paths based features are constructed by incorporating the newly generated clusters through hierarchically clustering the input networks. Then, the logistic regression classifier is employed to train the model and predict the hidden signs of the links. Extensive experiments on Epinions and Slashdot datasets demonstrate the efficiency of our proposed method in terms of Accuracy and Coverage.
引用
收藏
页码:1905 / 1908
页数:4
相关论文
共 50 条
[31]   Structure-Enhanced Graph Representation Learning for Link Prediction in Signed Networks [J].
Zhang, Yunke ;
Yang, Zhiwei ;
Yu, Bo ;
Chen, Hechang ;
Li, Yang ;
Zhao, Xuehua .
KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, PT I, 2021, 12815 :40-52
[32]   Link Prediction in Signed Social Networks: From Status Theory to Motif Families [J].
Liu, Si-Yuan ;
Xiao, Jing ;
Xu, Xiao-Ke .
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2020, 7 (03) :1724-1735
[33]   HOPLP - MUL: link prediction in multiplex networks based on higher order paths and layer fusion [J].
Mishra, Shivansh ;
Singh, Shashank Sheshar ;
Kumar, Ajay ;
Biswas, Bhaskar .
APPLIED INTELLIGENCE, 2023, 53 (03) :3415-3443
[34]   HOPLP − MUL: link prediction in multiplex networks based on higher order paths and layer fusion [J].
Shivansh Mishra ;
Shashank Sheshar Singh ;
Ajay Kumar ;
Bhaskar Biswas .
Applied Intelligence, 2023, 53 :3415-3443
[35]   A New Link Prediction Method for Complex Networks Based onTopological Effectiveness of Resource Transmission Paths [J].
Wang K. ;
Li X. ;
Lan J. ;
Wei H. ;
Liu S. .
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2020, 42 (03) :653-660
[36]   A New Link Prediction Method for Complex Networks Based on Topological Effectiveness of Resource Transmission Paths [J].
Wang Kai ;
Li Xing ;
Lan Julong ;
Wei Hongquan ;
Liu Shuxin .
JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2020, 42 (03) :653-660
[37]   A meta-learning based approach for temporal link prediction in multiplex networks [J].
Tofighy, Sajjad ;
Charkari, Nasrollah Moghadam ;
Ghaderi, Foad .
KNOWLEDGE-BASED SYSTEMS, 2025, 309
[38]   Improving link prediction in complex networks by adaptively exploiting multiple structural features of networks [J].
Ma, Chuang ;
Bao, Zhong-Kui ;
Zhang, Hai-Feng .
PHYSICS LETTERS A, 2017, 381 (39) :3369-3376
[39]   Mining odd-length paths for link prediction in bipartite networks [J].
Zhao, Zhili ;
Wu, Simin ;
Luo, Ge ;
Zhang, Nana ;
Hu, Ahui ;
Liu, Jun .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2024, 646
[40]   Link prediction based on node weighting in complex networks [J].
Findik, Oguz ;
Ozkaynak, Emrah .
SOFT COMPUTING, 2021, 25 (03) :2467-2482