一种改进的二分网络链路预测算法  

An improved link prediction algorithm of bipartite network

作　　者：马吴迪[1] 胡学钢[1] 何伟[1] 

机构地区：[1]合肥工业大学计算机与信息学院,安徽合肥230009

出　　处：《合肥工业大学学报（自然科学版）》2014年第1期63-68,共6页Journal of Hefei University of Technology：Natural Science

基　　金：国家自然科学基金资助项目(60975034);安徽省自然科学基金资助项目(090412044)

摘　　要：针对二分网络图中基于链路预测的ILP算法在投影过程中只采用了底部节点,从而导致网络拓扑信息利用不充分的问题,文章提出改进的ILPExt算法,将顶部投影信息和底部投影信息结合起来,根据二部图的底部节点和顶部节点分别生成底部投影图和顶部投影图,然后在2个投影图中分别找出顶部节点和底部节点的内部链边集,并进行合并,得到预测链路的边集。实验结果表明,改进的ILPExt算法比ILP算法能够找出更多的链路预测边,并且提高了召回率。The network topology information is underutilized because the ILP algorithm based on bipar- tite network link prediction uses only the bottom nodes in the projection process. An improved algo- rithm ILPExt that adopts the projection information of the top and bottom nodes is proposed in this paper. Firstly, the top and bottom projection graphs are generated by the top and bottom nodes of the bipartite network. Secondly, the internal link sets of the top and bottom nodes are found in the two projection graphs respectively. Then the two sets of internal links are merged to obtain the total link prediction edges. The experimental results show that the proposed ILPExt algorithm gets more link prediction edges and improves the recalls, which outperforms the II.P ~ltrori＊hrn

关 键 词：链路预测 复杂网络 内部链边 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]