Efficient Ontology Meta-Matching Based on Interpolation Model Assisted Evolutionary Algorithm
نویسندگان
چکیده
Ontology is the kernel technique of Semantic Web (SW), which models domain knowledge in a formal and machine-understandable way. To ensure different ontologies’ communications, cutting-edge technology to determine heterogeneous entity mappings through ontology matching process. During this procedure, it utmost importance integrate similarity measures distinguish correspondence. The way find most appropriate aggregating weights enhance alignment’s quality called meta-matching problem, recently, Evolutionary Algorithm (EA) has become great methodology addressing it. Classic EA-based evaluates each individual traversing reference alignment, increases computational complexity algorithm’s running time. For overcoming drawback, an Interpolation Model assisted EA (EA-IM) proposed, introduces IM predict fitness value newly generated individual. In particular, we first divide feasible region into several uniform sub-regions using lattice design method, then precisely evaluate Interpolating Individuals (INIDs). On basis, constructed for new forecast its value, with help neighborhood. testing EA-IM’s performance, use Alignment Evaluation Initiative (OAEI) Benchmark experiment final results show that EA-IM capable improving EA’s searching efficiency without sacrificing solution’s quality, f-measure values are better than OAEI’s participants.
منابع مشابه
An Evolutionary Algorithm based Ontology Matching System
Due to the high heterogeneity of ontologies, a combination of many methods is necessary to discover correctly the semantic correspondences between their elements. An ontology matching system can be seen as a collection of several matching components, which implements a specific method dealing with a specific heterogeneity type like the terminological, structural and semantic matchers. In this p...
متن کاملEfficient Ontology Meta-Matching Based on Metamodel-assisted Compact MOEA/D
In this paper we propose an improved Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), i.e. metamodel-assisted compact MOEA/D, to efficiently solve the ontology meta-matching problem. Particularly, we dedicate to determine the optimal ontology alignment by tuning four different basic similarity measures, i.e. Syntactic Measure, Linguistic Measure, Taxonomy-based Measure an...
متن کاملA Robust and Efficient Evolutionary Algorithm based on Probabilistic Model
Evolutionary algorithms commonly search for the best solutions by maintaining a population of individuals that evolves from one generation to the next. The evolution consists of selecting a set of individuals from the population and applying, to some subsets of it, recombination operators that create new solutions. In this paper, Estimation of distribution algorithms arise as an alternative to ...
متن کاملmortality forecasting based on lee-carter model
over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...
15 صفحه اولAn Evolutionary Trend Discovery Algorithm Based on Cubic Spline Interpolation
The speed of evolution, measured by the number of mutations over a fixed number of years, varies greatly in various branches of the evolutionary tree. This paper proposes an evolutionary trend discovery algorithm that reveals the distinguishing characteristics of any branch of the evolutionary tree. The evolutionary trend discovery algorithm is designed to work with either fossil-based data or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10173212