Affiliation:
1. School of Computing and Information Systems, Singapore Management University, Singapore, Singapore
Abstract
Knowledge graph (KG) refinement refers to the process of filling in missing information, removing redundancies, and resolving inconsistencies in KGs. With the growing popularity of KG in various domains, many techniques involving machine learning have been applied, but there is no survey dedicated to machine learning-based KG refinement yet. Based on a novel framework following the KG refinement process, this article presents a survey of machine learning approaches to KG refinement according to the kind of operations in KG refinement, the training datasets, mode of learning, and process multiplicity. Furthermore, the survey aims to provide broad practical insights into the development of fully automated KG refinement.
Funder
A*STAR under its Advanced Manufacturing and Engineering (AME) Programmatic Grant
Jubilee Technology Fellowship awarded to Ah-Hwee Tan by Singapore Management University
Publisher
Association for Computing Machinery (ACM)
Reference142 articles.
1. Domain-specific knowledge graphs: A survey
2. Named Entity Extraction for Knowledge Graphs: A Literature Overview
3. Samur Araújo, Duc Tran, Arjen DeVries, Jan Hidders, and Daniel Schwabe. 2012. SERIMI: Class-based disambiguation for effective instance matching over heterogeneous web data. In Proceedings of the 15th International Workshop on the Web and Databases 2012, Zachary G. Ives and Yannis Velegrakis (Eds.). 25–30. Retrieved from http://db.disi.unitn.eu/pages/WebDB2012/papers/p4.pdf
4. Siddhant Arora. 2020. A survey on graph neural networks for knowledge graph completion. arxiv:2007.12374. Retrieved from http://arxiv.org/abs/2007.12374
5. Caleb Belth Xinyi Zheng Jilles Vreeken and Danai Koutra. 2020. What is normal what is strange and what is missing in a knowledge graph: Unified characterization via inductive summarization. Proceedings of the Web Conference (WWW’20) 1115–1126. DOI:10.1145/3366423.3380189
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献