32 search results - page 1 / 7 » An Incremental Prefix Filtering Approach for the All Pairs S... |
APWEB
2010
Springer
13 years 8 months ago
2010
Springer
Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t....
DEXA
2010
Springer
13 years 5 months ago
2010
Springer
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we ...
RECOMB
2004
Springer
14 years 5 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
SIGIR
2006
ACM
13 years 10 months ago
2006
ACM
Memory-based methods for collaborative filtering predict new ratings by averaging (weighted) ratings between, respectively, pairs of similar users or items. In practice, a large ...