6533b82dfe1ef96bd12914bd
RESEARCH PRODUCT
Locality-Sensitive Hashing for Massive String-Based Ontology Matching
Michael Cochezsubject
Matching (statistics)Computer sciencebusiness.industryString (computer science)Hash functionBig datastring-based ontology matchingProcess (computing)computer.software_genreLocality-sensitive hashinglocality-sensitive hashingData miningbusinessOntology alignmentcomputerdescription
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. peerReviewed
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2014-08-01 | 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) |