通过$n$阶邻近邻域解读节点嵌入距离
Interpreting Node Embedding Distances Through $n$-order Proximity Neighbourhoods
AI总结:
本研究提出新方法评估节点嵌入距离的可解释性,发现矩阵分解模型SVD通过高阶邻近性最具可解释性。
摘要:
在节点表示学习领域,解释潜在维度已成为一个突出且被广泛研究的研究主题。本工作的贡献在于评估节点嵌入中另一个鲜少被利用的特征的可解释性,即节点间嵌入距离,该特征越来越多地用于推荐和消费多样性研究。我们引入了一种新方法来衡量节点间距离的可理解程度,评估了嵌入前从网络导出的邻近权重与嵌入后节点接近度测量之间的关联程度。通过测试几种经典节点嵌入模型,我们的研究得出了一个从业者熟悉但文献中鲜少引用的结论——矩阵分解模型SVD通过1阶、2阶甚至更高阶邻近性最具可解释性。
英文摘要:
In the field of node representation learning the task of interpreting latent dimensions has become a prominent, well-studied research topic. The contribution of this work focuses on appraising the interpretability of another rarely-exploited feature of node embeddings increasingly utilised in recommendation and consumption diversity studies: inter-node embedded distances. Introducing a new method to measure how understandable the distances between nodes are, our work assesses how well the proximity weights derived from a network before embedding relate to the node closeness measurements after embedding. Testing several classical node embedding models, our findings reach a conclusion familiar to practitioners albeit rarely cited in literature - the matrix factorisation model SVD is the most interpretable through 1, 2 and even higher-order proximities.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。