A genetic algorithms-based approach for optimizing similarity aggregation in ontology matching

Ver/ abrir
Use este enlace para citar
http://hdl.handle.net/2183/20776Coleccións
- Investigación (FIC) [1634]
Metadatos
Mostrar o rexistro completo do ítemTítulo
A genetic algorithms-based approach for optimizing similarity aggregation in ontology matchingAutor(es)
Data
2013Cita bibliográfica
Martínez-Romero M, Vázquez-Naya JM, Nóvoa FJ, Vázquez G, Pereira J. A genetic algorithms-based approach for optimizing similarity aggregation in ontology matching. Ponencia presentada en International Work-Conference on Artificial Neural Networks. IWANN 2013; 2013 Jun 12-14; Puerto de la Cruz, Tenerife. Berlin: Springer; 2013. p.435-444 (Lecture Notes in Computer Science; 7902)
Resumo
[Abstract] Ontology matching consists of finding the semantic relations between different ontologies and is widely recognized as an essential process to achieve an adequate interoperability between people, systems or organizations that use different, overlapping ontologies to represent the same knowledge. There are several techniques to measure the semantic similarity of elements from separate ontologies, which must be adequately combined in order to obtain precise and complete results. Nevertheless, combining multiple similarity measures into a single metric is a complex problem, which has been traditionally solved using weights determined manually by an expert, or through general methods that do not provide optimal results. In this paper, a genetic algorithms based approach to aggregate different similarity metrics into a single function is presented. Starting from an initial population of individuals, each one representing a combination of similarity measures, our approach allows to find the combination that provides the optimal matching quality.
Palabras chave
Genetic algorithms
Ontology matching
Ontologies
Semantic web
Ontology matching
Ontologies
Semantic web
Versión do editor
Dereitos
The final publication is avaliable at Springer Link
ISBN
978-3-642-38678-7 978-3-642-38679-4