Cross-domain Scientific Collaborations Prediction Using Citation

被引:0
作者
Guo, Ying [1 ]
Chen, Xi [1 ]
机构
[1] Tsinghua Univ, Dept Automat, Tsinghua Natl Lab Informat Sci & Technol, Beijing 100084, Peoples R China
来源
2013 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM) | 2013年
关键词
link predictioin; social network; recommender systems;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cross-domain Scientific Collaborations have promoted rapid development of science and generated many innovative breakthroughs. However, predicting cross-domain scientific collaboration problem is rarely studied in academic research. Moreover, collaboration recommendation methods within single domain cannot be directly utilized for solving cross-domain problems, because there are topic skewness and sparse connections challenges. In this paper, we propose a Hybrid Graph Model, which combines both explicit co-author relationships and implicit co-citation relationships together to construct graph, then Random Walks with Restarts concept is used to measure and rank relatedness between nodes. Because co-citations appear in both source domain and target domain, they represent the topics which can be shared across domains. In this way, topic skewness problem is solved much cheaper and effectively compared with probabilistic topic models. In addition, co-citation relationship solves sparse connection problem by mining more potential connections between authors. However, few previous works use citation information for scientific collaboration recommendations. Finally, we compare the performances of Hybrid Graph Model with some baseline approaches on large publication data sets from different domains. The experiments show that Hybrid Graph Model outperforms comparison methods on several recommendation metrics. Moreover, citation information has been demonstrated to be very helpful for scientific collaboration recommendations.
引用
收藏
页码:771 / 776
页数:6
相关论文
共 20 条
  • [1] Friends and neighbors on the Web
    Adamic, LA
    Adar, E
    [J]. SOCIAL NETWORKS, 2003, 25 (03) : 211 - 230
  • [2] [Anonymous], 2012, 18 ACM SIGKDD INT C, DOI DOI 10.1145/2339530.2339730
  • [3] [Anonymous], 2010, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, Association for Computing Machinery
  • [4] [Anonymous], 2011, PROC 4 ACM INT C WEB, DOI DOI 10.1145/1935826.1935914
  • [5] [Anonymous], 2011, Proceeding of the 11th annual international ACM/IEEE joint conference on Digital libraries, DOI DOI 10.1145/1998076.1998121
  • [6] [Anonymous], 2004, Proceedings of the International Conference on Knowledge Discovery and Data Mining (SIGKDD), DOI [10.1145/1014052, DOI 10.1145/1014052]
  • [7] [Anonymous], 2006, KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
  • [8] [Anonymous], 2006, LINK PREDICTION USIN
  • [9] [Anonymous], 2012, WSDM
  • [10] Latent Dirichlet allocation
    Blei, DM
    Ng, AY
    Jordan, MI
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2003, 3 (4-5) : 993 - 1022