NobleBlocks
Public

EmbedJoin

Published • Aug 4, 2017
NobleIDNI4P27W09R26S25
Authors:
Haoyu Zhang
,
Qin Zhang

Abstract

We study the problem of edit similarity joins, where given a set of strings and a threshold value K, we want to output all pairs of strings whose edit distances are at most K. Edit similarity join is a fundamental problem in data cleaning/integration, bioinformatics, collaborative filtering and natu...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!