基于边重要度的矩阵分解链路预测算法

基于矩阵分解的链路预测方法的领域适应性较好.然而在已有基于矩阵分解的链路预测方法中,0-1矩阵的网络数据表示对网络中未知连边的假设较强,同时对网络中已知连边的重要度无区分性.为此,文中放松0-1矩阵的网络数据表示假设,对未知节点对连边不做任何假设,并提出边重要度度量方法,对网络中已知连边进行重要度度量,最终建立基于网络权重矩阵分解的链路预测模型.在8个公开网络数据集上对比基于度量的链路预测方法和已有矩阵分解方法,文中方法链路预测结果更好.

Link Prediction Algorithm by Matrix Factorization Based on Importance of Edges

The domain adaptability of link prediction method based on matrix factorization is fine. However, in the existing link prediction method based on matrix factorization, the network data representation of 0-1 matrix has a strong assumption of unknown edge in the network, while the importance of the known edges in the network is indistinguishable. The network data representation hypothesis of 0-1 matrix is relaxed in this paper, and no assumption to the edges of the unknown node-pairs is made. The measure method of importance of edges is put forward. Finally, the link prediction model based on the network weight matrix factorization is established by measuring the importance of the known edges in the network. The model is compared with the prediction algorithms based on metric and matrix factorization. Experimental results on eight public network datasets show the proposed algorithm is more effective.