Classification of knowledge graph completeness measurement techniques  

作　　者：ZHANG Ying XIAO Gang 

机构地区：[1]Institute of Systems Engineering,Academy of Military Sciences,Beijing 100107,China

出　　处：《Journal of Systems Engineering and Electronics》2024年第1期154-162,共9页系统工程与电子技术（英文版）

基　　金：supported by the National Key Laboratory for Complex Systems Simulation Foundation(6142006190301)。

摘　　要：At present,although knowledge graphs have been widely used in various fields such as recommendation systems,question and answer systems,and intelligent search,there are always quality problems such as knowledge omissions and errors.Quality assessment and control,as an important means to ensure the quality of knowledge,can make the applications based on knowledge graphs more complete and more accurate by reasonably assessing the knowledge graphs and fixing and improving the quality problems at the same time.Therefore,as an indispensable part of the knowledge graph construction process,the results of quality assessment and control determine the usefulness of the knowledge graph.Among them,the assessment and enhancement of completeness,as an important part of the assessment and control phase,determine whether the knowledge graph can fully reflect objective phenomena and reveal potential connections among entities.In this paper,we review specific techniques of completeness assessment and classify completeness assessment techniques in terms of closed world assumptions,open world assumptions,and partial completeness assumptions.The purpose of this paper is to further promote the development of knowledge graph quality control and to lay the foundation for subsequent research on the completeness assessment of knowledge graphs by reviewing and classifying completeness assessment techniques.

关 键 词：quality assessment completeness assessment closed world assumptions open world assumption partial completeness assumption 

分 类 号：TP391.1[自动化与计算机技术—计算机应用技术]