Locality-sensitive hashing for massive string-based ontology matching

Michael Cochez*

*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2014 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2014
EditorsDominik Slezak, Hung Son Nguyen, Eugene Santos, Marek Reformat
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages651-660
Number of pages10
ISBN (Electronic)9781479941438
DOIs
Publication statusPublished - 16 Oct 2014
Externally publishedYes
Event2014 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2014 - Warsaw, Poland
Duration: 11 Aug 201414 Aug 2014

Publication series

NameProceedings - 2014 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2014
Volume1

Conference

Conference2014 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2014
Country/TerritoryPoland
CityWarsaw
Period11/08/1414/08/14

Fingerprint

Dive into the research topics of 'Locality-sensitive hashing for massive string-based ontology matching'. Together they form a unique fingerprint.

Cite this