An Evaluation of Link Prediction Approaches in Few-Shot Scenarios

被引:0
作者
Braken, Rebecca [1 ]
Paulus, Alexander [2 ]
Pomp, Andre [2 ]
Meisen, Tobias [2 ]
机构
[1] Univ Wuppertal, Inst Business Comp & Operat Res, Gaussstr 20, D-42119 Wuppertal, Germany
[2] Univ Wuppertal, Inst Technol & Management Digtial Transformat, Gaussstr 20, D-42119 Wuppertal, Germany
关键词
link prediction; few-shot learning; semantic models;
D O I
10.3390/electronics12102296
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Semantic models are utilized to add context information to datasets and make data accessible and understandable in applications such as dataspaces. Since the creation of such models is a time-consuming task that has to be performed by a human expert, different approaches to automate or support this process exist. A recurring problem is the task of link prediction, i.e., the automatic prediction of links between nodes in a graph, in this case semantic models, usually based on machine learning techniques. While, in general, semantic models are trained and evaluated on large reference datasets, these conditions often do not match the domain-specific real-world applications wherein only a small amount of existing data is available (the cold-start problem). In this study, we evaluated the performance of link prediction algorithms when datasets of a smaller size were used for training (few-shot scenarios). Based on the reported performance evaluation, we first selected algorithms for link prediction and then evaluated the performance of the selected subset using multiple reduced datasets. The results showed that two of the three selected algorithms were suitable for the task of link prediction in few-shot scenarios.
引用
收藏
页数:23
相关论文
共 51 条
  • [1] Bringing Light Into the Dark: A Large-Scale Evaluation of Knowledge Graph Embedding Models Under a Unified Framework
    Ali, Mehdi
    Berrendorf, Max
    Hoyt, Charles Tapley
    Vermue, Laurent
    Galkin, Mikhail
    Sharifzadeh, Sahand
    Fischer, Asja
    Tresp, Volker
    Lehmann, Jens
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2022, 44 (12) : 8825 - 8845
  • [2] [Anonymous], 2022, Gaia-X Architecture Document 22.10
  • [3] Balazevic I, 2019, Arxiv, DOI arXiv:1901.09590
  • [4] Hypernetwork Knowledge Graph Embeddings
    Balazevic, Ivana
    Allen, Carl
    Hospedales, Timothy M.
    [J]. ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2019: WORKSHOP AND SPECIAL SESSIONS, 2019, 11731 : 553 - 565
  • [5] Bordes A., 2013, ADV NEURAL INFORM PR, V26, P2787, DOI DOI 10.5555/2999792.2999923
  • [6] Chen MY, 2019, 2019 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING AND THE 9TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING (EMNLP-IJCNLP 2019), P4217
  • [7] Dettmers T, 2018, Arxiv, DOI [arXiv:1707.01476, 10.1609/aaai.v32i1.11573]
  • [8] Comprehensive Analysis of Knowledge Graph Embedding Techniques Benchmarked on Link Prediction
    Ferrari, Ilaria
    Frisoni, Giacomo
    Italiani, Paolo
    Moro, Gianluca
    Sartori, Claudio
    [J]. ELECTRONICS, 2022, 11 (23)
  • [9] SeMi: A SEmantic Modeling machIne to build Knowledge Graphs with graph neural networks
    Futia, Giuseppe
    Vetro, Antonio
    De Martin, Juan Carlos
    [J]. SOFTWAREX, 2020, 12
  • [10] Gilmer J, 2017, PR MACH LEARN RES, V70