5 search results - page 1 / 1 » Epsilon Grid Order: An Algorithm for the Similarity Join on ... |
SIGMOD
2001
ACM
14 years 4 months ago
2001
ACM
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...
ICDE
1997
IEEE
14 years 5 months ago
1997
IEEE
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...
KDD
2001
ACM
14 years 4 months ago
2001
ACM
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...
ICPP
2000
IEEE
13 years 9 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
WWW
2004
ACM
14 years 5 months ago
2004
ACM
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...