您的位置:山东大学 -> 科技期刊社 -> 《山东大学学报(理学版)》

山东大学学报(理学版) ›› 2016, Vol. 51 ›› Issue (7): 30-34.doi: 10.6040/j.issn.1671-9352.1.2015.085

• • 上一篇    下一篇

基于随机游走策略的专家关系网络构建

高盛祥,余正涛*,秦雨,程韵如,庙介璞   

  1. 昆明理工大学信息工程与自动化学院, 云南 昆明 650500
  • 收稿日期:2015-11-14 出版日期:2016-07-20 发布日期:2016-07-27
  • 通讯作者: 余正涛(1970— ),男,博士,教授,研究方向为自然语言处理、信息检索、机器翻译.E-mail:ztyu@hotmail.com E-mail:gaoshengxiang.yn@foxmail.com
  • 作者简介:高盛祥(1977— ),女,博士研究生,研究方向为信息检索、自然语言处理、机器翻译. E-mail:gaoshengxiang.yn@foxmail.com
  • 基金资助:
    国家自然科学基金资助项目(61175068,61472168,61163004);云南自然科学基金重点项目(2013FA130);科技部科技创新人才基金资助项目(014HE001);云南大学软件工程重点实验室开放基金资助项目(2011SE14)

Construction of expert relationship network based on random walk strategy

  1. School of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, Yunnan, China
  • Received:2015-11-14 Online:2016-07-20 Published:2016-07-27

摘要: 专家关系组织是专家关系网络构建的核心。提出了一种基于随机游走策略的专家关系网络构建方法,该方法首先提取专家实体及关系,获得专家之间朋友关系、指导关系及同事关系的简单无向图,利用图中专家节点连接关系,构建专家关系矩阵,然后借助随机游走策略思想,将若干表征专家关系的简单无向图进行有机组合,从而构建出复杂专家关系网络。实验结果验证了该方法的有效性。

关键词: 随机游走, 无向图, 专家关系网络, 专家关系矩阵

Abstract: Organizing expert relationship is the core of constructing expert relationship network. A method was proposed to build an expert relationship network based on random walk strategy. Firstly, on the basis of the extracted expert entities and their relationships, the method gets a friend relationship, or a guidance relationship or a colleague relationship between two expert entities to form a simple undirected graph. From the relationships between expert nodes in these graphs, an expert relationship matrix was built. Then according to random walk strategy thought, it is made an organic combination of these simple undirected graphs which characterize expert relationships to construct a complex network of expert relationships. The experimental results show that the proposed method to construct an expert relationship network based on random walk strategy is effective.

Key words: expert relationship network, random walk, expert relationship matrix, undirected graph

中图分类号: 

  • TP393
[1] ZHANG J, ACKERMAN M S, ADAMIC L. Expertise networks in online communities: structure and algorithms[C] //Proceedings of the 16th International Conference on WWW. New York: ACM, 2007: 221-230.
[2] ZHANG J, ACKERMAN M, ADMIC L. Community net simulartor: using simulation to study online community network formation and implications [C] //Proceedings of the third Conference on Communities and Technologies. New York: ACM, 2007: 28-38.
[3] CHEN Haiqiang, SHEN Huawei, XIONG Jin, et al. Social network structure behind the mailing lists: ict-iis at trec 2006 expert finding track[C] //Proceedings of 15th Text REtrieval Conference(TREC2006). New York: ACM, 2006.
[4] ZHANG Jing, TANG Jie, LI Junzi. Expert finding in a socail network[J]. Lecture Notes in Computer Science, 2007, 4443:1066-1069.
[5] TANG Jie, ZHANG Jing, YAO Limin, et al. ArnetMiner: extraction and mining of academic social networks[C] //Proceedings of the 15 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2008: 990-998.
[6] JASCH F, BLUMEN A. Target problem on small-world networks[J]. Physical Review E Statistical Nonlinear and Soft Matter Physics, 2001, 63(4Pt1): 278-300.
[7] SCALA A, AMARAL L A N, BARTHÉLÉMY M. Small-world networks and the conformation space of a short lattice polymer chain[J]. Europhysics Letters, 2001, 55(4): 594-600.
[8] PANDIT S A, AMRITKAR R E. Random spread on the family of small-world networks[J]. Physical Review E Statistical Nonlinear and Soft Matter Physics, 2000, 63(1): 278-300.
[9] LAHTINEN J, KERTESZ J, KASKI K. Random spreading phenomena in annealed small world networks[J]. Physica A: Statistical Mechanics and its Applications, 2002, 311(3): 571-580.
[10] ADAMIC L A, LUKOSE R M, PUNIYANI A R, et al. Search in power-law networks[J]. Physical Review E Statistical Nonlinear and Soft Matter Physics, 2001, 64(4 Pt 2):1515-1523.
[11] NOH J D, RIEGER H. Random walks on complex networks [J]. Physical Review Letters, 2003, 92(11): 87-93.
[12] TADIC B. Exploring complex graphs by random walks[J]. Modeling of Complex Systems: Seventh Granada Lecture, 2003, 661(1):24-27.
[13] HUGHES B D. Random walks and random environments[M]. USA: Oxford University Press, 1996.
[14] 毛存礼,余正涛,吴则建,等.专家证据文档识别无向图模型[J].软件学报,2014,24(11):2734-2746. MAO Cunli, YU Zhengtao, WU Zejian, et al. An undirected graph model for expert evidence document identification[J]. Journal of Software, 2014, 24(11):2734-2746.
[15] PAN Xiao, SHEN Tao, YU Zhengtao, et al. Multi-page Chinese expert metadata extraction method based on the 3d model[J]. Journal of Computational Information System, 2013, 9(6):2251-2259.
[16] JIANG Jin, YAN Xin, YU Zhengtao, et al. A Chinese expert disambiguation method based on semi-supervised graph clustering[J]. International Journal of Machine Learning and Cybernetics, 2014, 5(1):1-8.
[1] 李成江 . 新的k最短路算法[J]. J4, 2006, 41(4): 40-43 .
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!