{"title":"Can data improve knowledge graph?","authors":"Pengwei Huang, Kehui Liu","doi":"10.1007/s12293-024-00429-z","DOIUrl":null,"url":null,"abstract":"<p>The quality of knowledge graphs (KGs) significantly influences their utility in downstream applications. Traditional methods for enhancing KG quality typically involve manual efforts and knowledge pattern learning to detect errors and complete missing triples. These approaches often incur high manual costs. To address these challenges, this paper proposes a novel “data-driven” approach to KG improvement. This method utilizes numerical data records to validate and enhance the information within KGs, overcoming limitations such as the requirement for a robust internal structure of KGs or the scarcity of expert resources. A pioneering technique that integrates Markov Boundary discovery with correlation analysis of data properties is developed in this study. This technique aims to identify and correct errors, as well as to fill in missing components of the KGs. To evaluate the effectiveness of this approach, experimental analysis was conducted, highlighting its potential to significantly improve KG accuracy and completeness. This data-driven strategy reduces reliance on extensive manual intervention and expert knowledge, introducing a scalable way to refine KGs using empirical data. The results from the experiments demonstrate the capability of this method to enhance the quality of KGs, marking it as a valuable contribution to the field of knowledge management.</p>","PeriodicalId":48780,"journal":{"name":"Memetic Computing","volume":null,"pages":null},"PeriodicalIF":3.3000,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Memetic Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12293-024-00429-z","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
The quality of knowledge graphs (KGs) significantly influences their utility in downstream applications. Traditional methods for enhancing KG quality typically involve manual efforts and knowledge pattern learning to detect errors and complete missing triples. These approaches often incur high manual costs. To address these challenges, this paper proposes a novel “data-driven” approach to KG improvement. This method utilizes numerical data records to validate and enhance the information within KGs, overcoming limitations such as the requirement for a robust internal structure of KGs or the scarcity of expert resources. A pioneering technique that integrates Markov Boundary discovery with correlation analysis of data properties is developed in this study. This technique aims to identify and correct errors, as well as to fill in missing components of the KGs. To evaluate the effectiveness of this approach, experimental analysis was conducted, highlighting its potential to significantly improve KG accuracy and completeness. This data-driven strategy reduces reliance on extensive manual intervention and expert knowledge, introducing a scalable way to refine KGs using empirical data. The results from the experiments demonstrate the capability of this method to enhance the quality of KGs, marking it as a valuable contribution to the field of knowledge management.
知识图谱(KG)的质量极大地影响着其在下游应用中的效用。提高知识图谱质量的传统方法通常涉及人工操作和知识模式学习,以检测错误和补全缺失的三元组。这些方法通常会产生高昂的人工成本。为了应对这些挑战,本文提出了一种新颖的 "数据驱动 "KG 改进方法。这种方法利用数字数据记录来验证和增强知识库中的信息,克服了知识库内部结构不健全或专家资源稀缺等局限性。本研究开发了一种开创性的技术,将马尔可夫边界发现与数据属性的相关性分析相结合。该技术旨在识别和纠正错误,并填补 KGs 中缺失的部分。为了评估这种方法的有效性,我们进行了实验分析,结果表明这种方法具有显著提高 KG 准确性和完整性的潜力。这种数据驱动策略减少了对大量人工干预和专家知识的依赖,引入了一种利用经验数据完善 KG 的可扩展方法。实验结果表明,这种方法有能力提高知识库的质量,是对知识管理领域的宝贵贡献。
Memetic ComputingCOMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-OPERATIONS RESEARCH & MANAGEMENT SCIENCE
CiteScore
6.80
自引率
12.80%
发文量
31
期刊介绍:
Memes have been defined as basic units of transferrable information that reside in the brain and are propagated across populations through the process of imitation. From an algorithmic point of view, memes have come to be regarded as building-blocks of prior knowledge, expressed in arbitrary computational representations (e.g., local search heuristics, fuzzy rules, neural models, etc.), that have been acquired through experience by a human or machine, and can be imitated (i.e., reused) across problems.
The Memetic Computing journal welcomes papers incorporating the aforementioned socio-cultural notion of memes into artificial systems, with particular emphasis on enhancing the efficacy of computational and artificial intelligence techniques for search, optimization, and machine learning through explicit prior knowledge incorporation. The goal of the journal is to thus be an outlet for high quality theoretical and applied research on hybrid, knowledge-driven computational approaches that may be characterized under any of the following categories of memetics:
Type 1: General-purpose algorithms integrated with human-crafted heuristics that capture some form of prior domain knowledge; e.g., traditional memetic algorithms hybridizing evolutionary global search with a problem-specific local search.
Type 2: Algorithms with the ability to automatically select, adapt, and reuse the most appropriate heuristics from a diverse pool of available choices; e.g., learning a mapping between global search operators and multiple local search schemes, given an optimization problem at hand.
Type 3: Algorithms that autonomously learn with experience, adaptively reusing data and/or machine learning models drawn from related problems as prior knowledge in new target tasks of interest; examples include, but are not limited to, transfer learning and optimization, multi-task learning and optimization, or any other multi-X evolutionary learning and optimization methodologies.