Zero-Shot and Few-Shot Learning With Knowledge Graphs: A Comprehensive Survey

被引:27
作者
Chen, Jiaoyan [1 ,2 ]
Geng, Yuxia [3 ]
Chen, Zhuo [3 ]
Pan, Jeff Z. Z. [4 ]
He, Yuan [5 ]
Zhang, Wen [6 ]
Horrocks, Ian [5 ]
Chen, Huajun [3 ]
机构
[1] Univ Manchester, Dept Comp Sci, Manchester M13 9PL, England
[2] Univ Oxford, Dept Comp Sci, Oxford OX1 3QG, England
[3] Zhejiang Univ, Coll Comp Sci & Technol, Hangzhou 310027, Peoples R China
[4] Univ Edinburgh, Sch Informat, Edinburgh EH8 9AB, Scotland
[5] Univ Oxford, Dept Comp Sci, Oxford OX1 3QG, England
[6] Zhejiang Univ, Sch Software Technol, Hangzhou 310027, Peoples R China
基金
英国工程与自然科学研究理事会;
关键词
Few-shot learning (FSL); inductive knowledge graph completion; knowledge graph (KG); sample shortage; zero-shot learning (ZSL); INDUCTIVE LINK PREDICTION; CLASSIFICATION; ONTOLOGY; RECOGNITION; ENTITIES; LANGUAGE; NETWORK; MODELS; WEB;
D O I
10.1109/JPROC.2023.3279374
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Machine learning (ML), especially deep neural networks, has achieved great success, but many of them often rely on a number of labeled samples for supervision. As sufficient labeled training data are not always ready due to, e.g., continuously emerging prediction targets and costly sample annotation in real-world applications, ML with sample shortage is now being widely investigated. Among all these studies, many prefer to utilize auxiliary information including those in the form of knowledge graph (KG) to reduce the reliance on labeled samples. In this survey, we have comprehensively reviewed over 90 articles about KG-aware research for two major sample shortage settings-zero-shot learning (ZSL) where some classes to be predicted have no labeled samples and few-shot learning (FSL) where some classes to be predicted have only a small number of labeled samples that are available. We first introduce KGs used in ZSL and FSL as well as their construction methods and then systematically categorize and summarize KG-aware ZSL and FSL methods, dividing them into different paradigms, such as the mapping-based, the data augmentation, the propagation-based, and the optimization-based. We next present different applications, including not only KG augmented prediction tasks such as image classification, question answering, text classification, and knowledge extraction but also KG completion tasks and some typical evaluation resources for each task. We eventually discuss some challenges and open problems from different perspectives.
引用
收藏
页码:653 / 685
页数:33
相关论文
共 193 条
[1]   Label-Embedding for Image Classification [J].
Akata, Zeynep ;
Perronnin, Florent ;
Harchaoui, Zaid ;
Schmid, Cordelia .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2016, 38 (07) :1425-1438
[2]   Label-Embedding for Attribute-Based Classification [J].
Akata, Zeynep ;
Perronnin, Florent ;
Harchaoui, Zaid ;
Schmid, Cordelia .
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2013, :819-826
[3]  
Albooyeh M, 2020, FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, EMNLP 2020, P2657
[4]   Improving Inductive Link Prediction Using Hyper-relational Facts [J].
Ali, Mehdi ;
Berrendorf, Max ;
Galkin, Mikhail ;
Thost, Veronika ;
Ma, Tengfei ;
Tresp, Volker ;
Lehmann, Jens .
SEMANTIC WEB - ISWC 2021, 2021, 12922 :74-92
[5]   An ontology-based deep learning approach for triple classification with out-of-knowledge-base entities [J].
Amador-Dominguez, Elvira ;
Serrano, Emilio ;
Manrique, Daniel ;
Hohenecker, Patrick ;
Lukasiewicz, Thomas .
INFORMATION SCIENCES, 2021, 564 :85-102
[6]  
[Anonymous], 2013, NEURIPS
[7]  
[Anonymous], 2012, P NIPS WORKSH PROB P
[8]  
[Anonymous], 2009, Advances in neural information processing systems
[9]   DBpedia: A nucleus for a web of open data [J].
Auer, Soeren ;
Bizer, Christian ;
Kobilarov, Georgi ;
Lehmann, Jens ;
Cyganiak, Richard ;
Ives, Zachary .
SEMANTIC WEB, PROCEEDINGS, 2007, 4825 :722-+
[10]  
Baek J, 2020, ADV NEUR IN, V33