Sciweavers

409 search results - page 4 / 82
» Compact Similarity Joins
Sort
View
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 8 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
SIGMOD
2012
ACM
288views Database» more  SIGMOD 2012»
11 years 10 months ago
Exploiting MapReduce-based similarity joins
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
Yasin N. Silva, Jason M. Reed
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 7 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...
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 2 months ago
Similarity Join Size Estimation using Locality Sensitive Hashing
Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector similarity join size estimation (VSJ). It is a generali...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
ACL
2010
13 years 5 months ago
A Generalized-Zero-Preserving Method for Compact Encoding of Concept Lattices
Constructing an encoding of a concept lattice using short bit vectors allows for efficient computation of join operations on the lattice. Join is the central operation any unifica...
Matthew Skala, Victoria Krakovna, János Kra...