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

Hansong Nie, Xiangtai Chen, Xinbei Chu, Wei Wang, Zhenzhen Xu, Feng Xia
{"title":"基于动态属性网络表示学习的合作者推荐","authors":"Hansong Nie, Xiangtai Chen, Xinbei Chu, Wei Wang, Zhenzhen Xu, Feng Xia","doi":"10.1109/BESC51023.2020.9348323","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":224502,"journal":{"name":"2020 7th International Conference on Behavioural and Social Computing (BESC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collaborator Recommendation Based on Dynamic Attribute Network Representation Learning\",\"authors\":\"Hansong Nie, Xiangtai Chen, Xinbei Chu, Wei Wang, Zhenzhen Xu, Feng Xia\",\"doi\":\"10.1109/BESC51023.2020.9348323\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":224502,\"journal\":{\"name\":\"2020 7th International Conference on Behavioural and Social Computing (BESC)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 7th International Conference on Behavioural and Social Computing (BESC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BESC51023.2020.9348323\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 7th International Conference on Behavioural and Social Computing (BESC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BESC51023.2020.9348323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

科学合作在现代学术研究中占有重要地位。学者之间的合作将带来高质量的论文,提高学者的学术影响力。然而,由于学术数据的快速增长,找到一个合适的合作者越来越困难。已经有一些基于学者之间相似度计算的推荐系统。但是他们中的大多数没有考虑到科学合作网络的动态性。为此,我们提出了一种基于动态属性网络表示学习(DANRL)的合作者推荐算法。它利用网络拓扑结构、学者属性和网络的动态性,将学者表示为低维向量。通过计算学者向量之间的余弦相似度,我们可以向目标学者推荐最相似的合作者。此外,在动态网络的每个时间步,我们的方法只需要对选定的部分节点训练嵌入向量,而不是对所有节点进行随机行走和训练嵌入向量,可以显著提高推荐效率。在两个真实数据集上的实验表明,DANRL优于几种基线方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信