面向学术专家招聘的主题敏感链接排序方法

Hao Wu, Hao Li, Xuejie Zhang, Shaowen Yao
{"title":"面向学术专家招聘的主题敏感链接排序方法","authors":"Hao Wu, Hao Li, Xuejie Zhang, Shaowen Yao","doi":"10.1109/IMSCCS.2008.35","DOIUrl":null,"url":null,"abstract":"The problem of academic expert recruiting is concerned with finding the experts on a specified research field. It has many real-world applications and has recently attracted much attention. However, the existing methods are not versatile and entirely suit for the special requirements from academic area where the co-authorship and the citation relation play important roles in judging researcherspsila achievement. In this paper, we propose and develop a flexible data schema and a topic-sensitive co-pagerank algorithm for studying this problem. The main idea is measuring the authorspsila authorities with considering topics bias on the basis of their social networks and citation networks, and then, recommending expert candidates for the requests. To infer association between authors and topics, we derive a probability model on the basis of latent Dirichlet allocation (LDA) model. We further propose several techniques such as reasoning the interested topics of query, modeling author profile on the supporting documents to instruct the practices. Our experiments show that the proposed strategies are all effective to improve retrieval accuracy.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Topic-Sensitive Link-Ranking Approach for Academic Expert Recruiting\",\"authors\":\"Hao Wu, Hao Li, Xuejie Zhang, Shaowen Yao\",\"doi\":\"10.1109/IMSCCS.2008.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of academic expert recruiting is concerned with finding the experts on a specified research field. It has many real-world applications and has recently attracted much attention. However, the existing methods are not versatile and entirely suit for the special requirements from academic area where the co-authorship and the citation relation play important roles in judging researcherspsila achievement. In this paper, we propose and develop a flexible data schema and a topic-sensitive co-pagerank algorithm for studying this problem. The main idea is measuring the authorspsila authorities with considering topics bias on the basis of their social networks and citation networks, and then, recommending expert candidates for the requests. To infer association between authors and topics, we derive a probability model on the basis of latent Dirichlet allocation (LDA) model. We further propose several techniques such as reasoning the interested topics of query, modeling author profile on the supporting documents to instruct the practices. Our experiments show that the proposed strategies are all effective to improve retrieval accuracy.\",\"PeriodicalId\":122953,\"journal\":{\"name\":\"2008 International Multi-symposiums on Computer and Computational Sciences\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Multi-symposiums on Computer and Computational Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMSCCS.2008.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Multi-symposiums on Computer and Computational Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSCCS.2008.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

学术专家招聘问题涉及到找到某一特定研究领域的专家。它有许多实际应用,最近引起了很多关注。然而,现有的方法并不通用,完全适合学术领域的特殊要求,共同作者身份和被引关系是判断研究人员成果的重要因素。在本文中,我们提出并开发了一个灵活的数据模式和主题敏感的co-pagerank算法来研究这个问题。其主要思想是根据作者的社交网络和引用网络,考虑主题偏见,衡量作者的权威,然后为请求推荐专家候选人。为了推断作者和主题之间的关联,我们在潜在狄利克雷分配(latent Dirichlet allocation, LDA)模型的基础上推导了一个概率模型。在此基础上提出了推理查询感兴趣的主题、在支持文档上对作者画像建模等技术来指导实践。实验结果表明,所提策略均能有效提高检索精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Topic-Sensitive Link-Ranking Approach for Academic Expert Recruiting
The problem of academic expert recruiting is concerned with finding the experts on a specified research field. It has many real-world applications and has recently attracted much attention. However, the existing methods are not versatile and entirely suit for the special requirements from academic area where the co-authorship and the citation relation play important roles in judging researcherspsila achievement. In this paper, we propose and develop a flexible data schema and a topic-sensitive co-pagerank algorithm for studying this problem. The main idea is measuring the authorspsila authorities with considering topics bias on the basis of their social networks and citation networks, and then, recommending expert candidates for the requests. To infer association between authors and topics, we derive a probability model on the basis of latent Dirichlet allocation (LDA) model. We further propose several techniques such as reasoning the interested topics of query, modeling author profile on the supporting documents to instruct the practices. Our experiments show that the proposed strategies are all effective to improve retrieval accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信