A K-way spectral partitioning of an ontology for ontology matching
| Autor: | Peter Ochieng, Swaib Kyanda |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Matching (statistics)
Information Systems and Management Theoretical computer science Computer science Process (engineering) Data_MISCELLANEOUS 02 engineering and technology Space (commercial competition) Ontology (information science) Data structure Hardware and Architecture 020204 information systems 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Ontology alignment Software Information Systems |
| Zdroj: | Distributed and Parallel Databases. 36:643-673 |
| ISSN: | 1573-7578 0926-8782 |
| DOI: | 10.1007/s10619-018-7222-8 |
| Popis: | Ontology matching, the process of resolving heterogeneity between two ontologies consumes a lot of computing memory and time. This problem is exacerbated in large ontology matching tasks. To address the problem of time and space complexity in the matching process, ontology partitioning has been adopted as one of the methods, however, most ontology partitioning algorithms either produce incomplete partitions or are slow in the partitioning process hence eroding the benefits of the partitioning. In this paper, we demonstrate that spectral partitioning of an ontology can generate high quality partitions geared towards ontology matching. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink