Sciweavers

7 search results - page 1 / 2
» Similarity Join for Low-and High-Dimensional Data
Sort
View
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 4 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
ICDE
1998
IEEE
142views Database» more  ICDE 1998»
14 years 5 months ago
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing r...
Nick Koudas, Kenneth C. Sevcik
DASFAA
2003
IEEE
108views Database» more  DASFAA 2003»
13 years 9 months ago
Similarity Join for Low-and High-Dimensional Data
Dmitri V. Kalashnikov, Sunil Prabhakar
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 5 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
14 years 4 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger