310 search results - page 29 / 62 » High-Dimensional Similarity Joins |
AAAI
2010
15 years 1 months ago
2010
Kernelized sorting is an approach for matching objects from two sources (or domains) that does not require any prior notion of similarity between objects across the two sources. U...
108
click to vote
ECEASST
2010
14 years 9 months ago
2010
: A new approach for topographic mapping, called Swarm-Organized Projection (SOP) is presented. SOP has been inspired by swarm intelligence methods for clustering and is similar to...
KDD
1998
ACM
15 years 4 months ago
1998
ACM
WHIRL is an extensionof relational databasesthat canperform "soft joins" basedon the similarity of textual identifiers;thesesoftjoins extendthe traditional operationof j...
COLING
2010
14 years 6 months ago
2010
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
101
click to vote
SBBD
2001
15 years 1 months ago
2001
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...