Shall I Work with Them? A Knowledge Graph-Based Approach for Predicting Future Research Collaborations

被引:10
作者
Kanakaris, Nikos [1 ]
Giarelis, Nikolaos [1 ]
Siachos, Ilias [1 ]
Karacapilidis, Nikos [1 ]
机构
[1] Univ Patras, Ind Management & Informat Syst Lab, MEAD, Rion 26504, Greece
关键词
knowledge graph; link prediction; natural language processing; document representation; future research collaborations; graph kernels; word embeddings; LINK PREDICTION; NEIGHBORS;
D O I
10.3390/e23060664
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We consider the prediction of future research collaborations as a link prediction problem applied on a scientific knowledge graph. To the best of our knowledge, this is the first work on the prediction of future research collaborations that combines structural and textual information of a scientific knowledge graph through a purposeful integration of graph algorithms and natural language processing techniques. Our work: (i) investigates whether the integration of unstructured textual data into a single knowledge graph affects the performance of a link prediction model, (ii) studies the effect of previously proposed graph kernels based approaches on the performance of an ML model, as far as the link prediction problem is concerned, and (iii) proposes a three-phase pipeline that enables the exploitation of structural and textual information, as well as of pre-trained word embeddings. We benchmark the proposed approach against classical link prediction algorithms using accuracy, recall, and precision as our performance metrics. Finally, we empirically test our approach through various feature combinations with respect to the link prediction problem. Our experimentations with the new COVID-19 Open Research Dataset demonstrate a significant improvement of the abovementioned performance metrics in the prediction of future research collaborations.
引用
收藏
页数:18
相关论文
共 56 条
  • [11] Shortest-path kernels on graphs
    Borgwardt, KM
    Kriegel, HP
    [J]. Fifth IEEE International Conference on Data Mining, Proceedings, 2005, : 74 - 81
  • [12] Fey M., 2019, ARXIV190302428V3
  • [13] Fire M., 2011, Proceedings of the 2011 IEEE Third International Conference on Privacy, Security, Risk and Trust and IEEE Third International Conference on Social Computing (PASSAT/SocialCom 2011), P73, DOI 10.1109/PASSAT/SocialCom.2011.20
  • [14] On graph kernels:: Hardness results and efficient alternatives
    Gärtner, T
    Flach, P
    Wrobel, S
    [J]. LEARNING THEORY AND KERNEL MACHINES, 2003, 2777 : 129 - 143
  • [15] Giarelis Nikolaos, 2020, Discovery Science. 23rd International Conference, DS 2020. Proceedings. Lecture Notes in Artificial Intelligence. Subseries of Lecture Notes in Computer Science (LNAI 12323), P437, DOI 10.1007/978-3-030-61527-7_29
  • [16] Giarelis N., 2020, P 12 KES INT C INTEL
  • [17] An Innovative Graph-Based Approach to Advance Feature Selection from Multiple Textual Documents
    Giarelis, Nikolaos
    Kanakaris, Nikos
    Karacapilidis, Nikos
    [J]. ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS, AIAI 2020, PT I, 2020, 583 : 96 - 106
  • [18] Recommending research collaborations using link prediction and random forest classifiers
    Guns, Raf
    Rousseau, Ronald
    [J]. SCIENTOMETRICS, 2014, 101 (02) : 1461 - 1473
  • [19] Jaccard P., 1901, B SOC VAUD SCI N, V37, P547, DOI [DOI 10.5169/SEALS-266450, 10.5169/seals-266450]
  • [20] Joulin A., 2016, P INT C LANG RES EV