331 search results - page 26 / 67 » Fast Matching for All Pairs Similarity Search |
PKDD
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
VLDB
2000
ACM
15 years 1 months ago
2000
ACM
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean...
190
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
103
click to vote
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...