Link Prediction Based on Three-Type Heterogeneity Punishment

2023 IEEE 11th International Conference on Information, Communication and Networks (ICICN)(2023)

引用 0|浏览4
暂无评分
摘要
Link prediction based on node similarity has become a popular research topic in complex networks. Many existing models focus on endpoint influence on two-order paths, and rarely consider endpoint influence on one-order, two-order and three-order paths simultaneously. The one-order, two order and three-order paths between two endpoint pairs are called three-type paths. Endpoint influence is usually expressed by node degree. We consider the endpoint heterogeneity on the three-type of paths on different feature networks. The heterogeneity of endpoints plays a crucial role in attracting each other and forming stable links. Endpoints with greater heterogeneity have a higher likelihood of generating stable links. This paper proposes a link prediction model that enhances prediction performance by utilizing heterogenous path penalization. To compare our model with mainstream models, we will conduct experiments on 12 different data sets and analyze the results theoretically.
更多
查看译文
关键词
complex network,link prediction,endpoint degree heterogeneity,three-type paths punishment
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要