首页> 外文会议>International Conference on Behavioural and Social Computing >Collaborator Recommendation Based on Dynamic Attribute Network Representation Learning
【24h】

Collaborator Recommendation Based on Dynamic Attribute Network Representation Learning

机译:基于动态属性网络表示学习的合作者推荐

获取原文

摘要

Scientific collaboration plays an important role in modern academic research. Collaborations between scholars will bring about high-quality papers and improve the academic influence of scholars. However, it is more and more difficult to find a suitable collaborator due to the rapid growth of academic data. There are already some recommendation systems based on calculating the similarity between scholars. But most of them do not consider the dynamic nature of the scientific collaboration network. To this end, we propose a collaborator recommendation algorithm based on dynamic attribute network representation learning (DANRL). It takes advantage of the network topology, scholar attributes and the dynamic nature of the network to represent scholars as low-dimensional vectors. By calculating the cosine similarity between scholar vectors, we can recommend the most similar collaborators to target scholars. Moreover, at each time step of the dynamic network, our method only needs to train embedding vectors for some selected nodes instead of performing random walks and training embedding vectors for all nodes, which can significantly improve the recommendation efficiency. Experiments on two real-world datasets show that DANRL outperforms several baseline methods.
机译:科学合作在现代学术研究中起着重要作用。学者之间的合作将带来高质量的论文,提高学者的学术影响。然而,由于学术数据的快速增长,找到合适的合作者是越来越困难的。已经基于计算学者之间的相似性了一些推荐系统。但大多数人都不认为科学协作网络的动态性质。为此,我们提出了一种基于动态属性网络表示学习(DANRL)的协作者推荐算法。它利用网络拓扑,学术属性以及网络的动态性质来代表学者作为低维向量。通过计算学者向量之间的余弦相似性,我们可以推荐最相似的合作者来定位学者。此外,在动态网络的每个时间步骤中,我们的方法只需要为某些所选节点训练嵌入向量,而不是对所有节点进行随机散步和培训嵌入向量,这可以显着提高推荐效率。两个真实数据集的实验表明,DANRL优于几种基线方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号