基于近似特征值轨迹的谱演化链接预测
Spectral Evolution with Approximated Eigenvalue Trajectories for Link Prediction
摘要:
频谱演化模型旨在表征大型网络的增长(即,它们如何随着新边的建立而演变)。它假设,虽然本征向量保持不变,但本征值随时间以可预测的方式演变。本文扩展了原来的配方模型的两倍。首先,提出了一种基于瑞利商的特征值谱演化近似计算方法。其次,它提出了一种算法来估计的演变特征值外推只有一小部分的近似值。该模型用于描述2017年8月至2018年8月(哥伦比亚革命武装力量解除武装结束的时期)发布推文的用户的提及网络,其中包括哥伦比亚最受欢迎的政治标签。为了评估频谱演化模型与这些网络相似的程度,基于学习算法的链接预测方法(即,外推和回归)和图核。实验结果表明,部署在近似轨迹上的学习算法在预测新边缘的形成方面优于通常的核方法和外推方法。
英文摘要:
The spectral evolution model aims to characterize the growth of large networks (i.e., how they evolve as new edges are established) in terms of the eigenvalue decomposition of the adjacency matrices. It assumes that, while eigenvectors remain constant, eigenvalues evolve in a predictable manner over time. This paper extends the original formulation of the model twofold. First, it presents a method to compute an approximation of the spectral evolution of eigenvalues based on the Rayleigh quotient. Second, it proposes an algorithm to estimate the evolution of eigenvalues by extrapolating only a fraction of their approximated values. The proposed model is used to characterize mention networks of users who posted tweets that include the most popular political hashtags in Colombia from August 2017 to August 2018 (the period which concludes the disarmament of the Revolutionary Armed Forces of Colombia). To evaluate the extent to which the spectral evolution model resembles these networks, link prediction methods based on learning algorithms (i.e., extrapolation and regression) and graph kernels are implemented. Experimental results show that the learning algorithms deployed on the approximated trajectories outperform the usual kernel and extrapolation methods at predicting the formation of new edges.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。