Abstract Paper
| Title | : Graph Laplacian Based Ontology Regularization Distance Framework for Ontology Similarity Measuring and Ontology Mapping |
|---|---|
| Author(s) | : 1 Linli Zhu, 2 Yu Pan 3 Mohammad Reza Farahani and 4 Wei Gao |
| Article Information | : , 89-97 |
| Affiliation(s) | : 1, 2 School of Computer Engineering, Jiangsu University of Technology, Changzhou, Jiangsu - 213001, China |
| : 3 Department of Applied Mathematics, Iran University of Science and Technology, Narmak, Tehran - 16844, Iran | |
| : 4 School of Information Science and Technology, Yunnan Normal University, Kunming 650500, China |
Abstract :
The core of a large number of ontology engineering applications is similarity measuring, and the essence of ontology mapping and its applications are also similarity computation. There are a great variety of learning techniques are designed for ontology similarity calculating in di erent engineering circumstances. In these learning settings, all the semantic information of concept is enclosed in the p dimensional vector. In this paper, the ontology similarity measuring is considered via geometric distance calculating between the vectors of ontology vertex corresponding to. We use regularization framework to solute the optimal ontology distance function and apply graph Laplacian to make full use of the unlabeled ontology information. Finally, two simulation experiments imply that our graph Laplacian based ontology regularization distance framework works well in plant and humanoid robotics ontology applications in which higher precision ratio results are obtained from our algorithm than previous ontology learning tricks.
| Keywords | : Ontology; Similarity computation; Ontology mapping; Graph Laplacian; Regularization framework |
|---|---|
| Document Type | : Research Paper |
| Publication date | : May 20, 2017 |