Automatic Knowledge Graph matching via Self-adaptive Designed Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8081

@Article{XUE:2024:knosys,

• author = "Xingsi Xue",
• title = "Automatic Knowledge Graph matching via Self-adaptive Designed Genetic Programming",
• journal = "Knowledge-Based Systems",
• volume = "293",
• pages = "111628",
• year = "2024",
• ISSN = "0950-7051",
• DOI = "doi:10.1016/j.knosys.2024.111628",
• URL = "https://www.sciencedirect.com/science/article/pii/S0950705124002636",
• keywords = "genetic algorithms, genetic programming, Knowledge graph matching, Similarity measure construction, Automated algorithm design, Self-adaptive designed genetic programming",
• abstract = "Knowledge Graph (KG) provides a structured representation of domain knowledge by formally defining entities and their relationships. However, distinct communities tend to employ different terminologies and granularity levels to describe the same entity, leading to the KG heterogeneity issue that hampers their communications. KG matching can identify semantically similar entities in two KGs, which is an effective solution to this problem. Similarity Measures (SMs) are the foundation of the KG matching technique, and due to the complexity of entity heterogeneity, it is necessary to construct a high-level SM by selecting and combining the basic SMs. However, the large number of SMs and their intricate relationships make SM construction an open challenge. Inspired by the success of Evolutionary Algorithms (EA) in addressing the entity matching problem, this work further proposes a novel Self-adaptive Designed Genetic Programming (SDGP) to automatically construct the SM for KG matching. To overcome the drawbacks of the classic EA-based matching methods, a new individual representation and a novel fitness function are proposed to enable SDGP automatically explore the SM selection and combination. Then, a new Adaptive Automatic Design (AAD) method is introduced to adaptively trade off SDGP's exploration and exploitation, which can determine the timing of AAD and efficiently determine the suitable breeding operators and control parameters for SDGP. The experiment uses the Ontology Alignment Evaluation Initiative's Knowledge Graph (KG) data set to test the performance of SDGP. The experimental results show that SDGP can effectively determine high-quality KG alignments, which significantly outperform state-of-the-art KG matching methods",

}

Genetic Programming entries for Xingsi Xue

Citations