{"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}
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.