Matching Large Ontologies Based on Reduction Anchors
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 2343-2347.
Abstract
Matching large ontologies is a challenge due to the high time complexity. This paper proposes a new matching method for large ontologies based on reduction anchors. This method has a distinct advantage over the divide-and-conquer methods because it dose not need to partition large ontologies. In particular, two kinds of reduction anchors, positive and negative reduction anchors, are proposed to reduce the time complexity in matching. Positive reduction anchors use the concept hierarchy to predict the ignorable similarity calculations. Negative reduction anchors use the locality of matching to predict the ignorable similarity calculations. Our experimental results on the real world data sets show that the proposed method is efficient for matching large ontologies.
@inproceedings{ijcai2011p390,
title = {Matching Large Ontologies Based on Reduction Anchors},
author = {Wang, Peng and Zhou, Yuming and Xu, Baowen},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {2343--2347},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-390},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-390},
}
TY - CPAPER TI - Matching Large Ontologies Based on Reduction Anchors AU - Wang, Peng AU - Zhou, Yuming AU - Xu, Baowen T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 2343 EP - 2347 DO - 10.5591/978-1-57735-516-8/IJCAI11-390 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-390 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: