本文已被:浏览 1509次 下载 2571次
Received:April 28, 2015 Revised:June 08, 2015
Received:April 28, 2015 Revised:June 08, 2015
中文摘要: 链接预测的一个关键问题在于如何合理高效地结合链接属性、节点属性等相关信息以用于预测的目的,针对该问题提出了一种基于节点影响力和兴趣的链接预测算法IPI(Influence Plus Interest),即通过拓扑结构信息来量化用户的影响力,通过文本信息来模拟用户兴趣.结合两类信息对节点间的联系进行打分,得分高的节点对即代表具有较强的联系.在真实数据集上的实验表明,我们提出的方法具有一定的可行性.
Abstract:Currently one of core issues of link prediction is how to rationally and efficiently combine link attributes, node attributes and other relevant information for forecasting purposes. Aim at this problem, we propose a link prediction algorithm based on influence and interest, which mainly consists of quantizing the influence of nodes by topology structure information and simulating users' interests by text information. These two types of information are aggregated to give the relation score to the node pairs. High-scoring pair of nodes which represents a strong link. Experiments on real datasets show the method proposed in this paper is feasible.
文章编号: 中图分类号: 文献标志码:
基金项目:
引用文本:
杨林瑞,廖倡.IPI:一种基于影响力和兴趣的链接预测算法.计算机系统应用,2016,25(1):160-164
YANG Lin-Rui,LIAO Chang.IPI:A Link Prediction Algorithm Based on Users' Influences and Interests.COMPUTER SYSTEMS APPLICATIONS,2016,25(1):160-164
杨林瑞,廖倡.IPI:一种基于影响力和兴趣的链接预测算法.计算机系统应用,2016,25(1):160-164
YANG Lin-Rui,LIAO Chang.IPI:A Link Prediction Algorithm Based on Users' Influences and Interests.COMPUTER SYSTEMS APPLICATIONS,2016,25(1):160-164