Sciweavers

1246 search results - page 2 / 250
» High Performance Clustering Based on the Similarity Join
Sort
View
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 6 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
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 5 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...
TKDE
2002
124views more  TKDE 2002»
13 years 5 months ago
Clustering for Approximate Similarity Search in High-Dimensional Spaces
In this paper we present a clustering and indexing paradigm called Clindex for high-dimensional search spaces. The scheme is designed for approximate similarity searches, where on...
Chen Li, Edward Y. Chang, Hector Garcia-Molina, Gi...
IQIS
2007
ACM
13 years 6 months ago
Accuracy of Approximate String Joins Using Grams
Approximate join is an important part of many data cleaning and integration methodologies. Various similarity measures have been proposed for accurate and efficient matching of st...
Oktie Hassanzadeh, Mohammad Sadoghi, Renée ...
DASFAA
2006
IEEE
183views Database» more  DASFAA 2006»
13 years 11 months ago
Probabilistic Similarity Join on Uncertain Data
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...