Ontology matching method based on bidding algorithm
A matching method and ontology technology, which are applied in the field of ontology matching based on bidding algorithm, can solve the problems of consuming large running time and memory space, and can not be satisfied, and achieve the effect of saving memory consumption, improving quality and reducing running time.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0017] (1) Multi-target ontology matching problem
[0018] In the present invention, ontology O is defined as O={C, P, I}, where C, P and I respectively represent the concept set, attribute set and instance set in the ontology, wherein concepts, attributes and instances are collectively referred to as entities of the ontology. The ontology matching result A is a set of entity matching pairs, and each entity matching pair can be expressed as a quadruple {e, e', n, rel}, where e and e' represent the entities of the meta ontology and the target ontology respectively, n is the reliability value of the relationship between e and e', and rel is the relationship between e and e' (specifically, the equivalence relationship in the present invention).
[0019] Given two ontologies O to be matched 1 ={e 11 ,e 12 ,... e 1n} and O 2 ={e 21 ,e 22 ,... e 2n},e 1i , i=1,2,...,n and e 2j , j=1,2,...,n are the entities in the two ontology respectively, the optimization model of the on...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


