Locality-sensitive hashing for massive string-based ontology matching
Cochez, M. (2014). Locality-sensitive hashing for massive string-based ontology matching. In D. Ślęzak, B. Dunin-Kęplicz, M. Lewis, & T. Terano (Eds.), 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) (pp. 134-140). IEEE. doi:10.1109/WI-IAT.2014.26 Retrieved from http://users.jyu.fi/~miselico/papers/LSH_ontology_matching.pdf
© 2014 IEEE. This is an author's post-print version of an article whose final and definitive form has been published in the conference proceeding by IEEE. Published in this repository with the kind permission of the publisher.
This paper reports initial research results related to the use of locality-sensitive hashing (LSH) for string-based matching of big ontologies. Two ways of transforming the matching problem into a LSH problem are proposed and experimental results are reported. The performed experiments show that using LSH for ontology matching could lead to a very fast matching process. The quality of the alignment achieved in these experiments is comparable to state-of-the-art matchers, but much faster. Further research is needed to find out whether the use of different metrics or specific hardware would improve the results.
Is part of publication2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)