Searching for "High-Dimensional Similarity Joins." – sorted by Relevance.
-
High-dimensional Similarity Joins
- High-dimensional Similarity Joins Kyuseok Shim Ramakrishnan Srikant Rakesh Agrawal IBM Almaden
- Cited by 29 (2 self) – Add To MetaCart
-
An efficient parallel algorithm for high dimensional similarity join
- similarity join on high-dimensional points [2]. It has been shown to be considerably superior to other
- Cited by 6 (0 self) – Add To MetaCart
-
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
- High Dimensional Similarity Joins: Algorithms and Performance Evaluation Nick Koudas K. C. Sevcik
- Cited by 37 (0 self) – Add To MetaCart
-
Vafiles vs. r*-trees in distance join queries
- ] an index structure (ε-kdB tree) and an algorithm for similarity self-join on high-dimensional points
- Add To MetaCart
-
The k-nearest neighbor join: Turbo charging the kdd process
- which is particularly suited for high-dimensional similarity joins, in order to reduce both CPU and I
- Cited by 12 (2 self) – Add To MetaCart
-
Efficient Similarity String Joins in Large Data Sets
- . Section 4 presents the second step of the solution, which conducts a similarity join in the high-dimensional
- Cited by 1 (0 self) – Add To MetaCart
-
Efficient Record Linkage in Large Data Sets
- similarity join in the high-dimensional space. Section 5 studies how to solve the record-linkage problem
- Cited by 35 (9 self) – Add To MetaCart
-
High performance data mining using the nearest neighbor join
- for high-dimensional similarity joins, in order to reduce both CPU and I/O cost and efficiently compute
- Cited by 10 (0 self) – Add To MetaCart

