5 search results - page 1 / 1 » Joining Massive High-Dimensional Datasets |
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
SIGMOD
2001
ACM
14 years 7 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 8 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...
IDEAL
2004
Springer
14 years 21 days ago
2004
Springer
Microarray datasets are often too large to visualise due to the high dimensionality. The self-organising map has been found useful to analyse massive complex datasets. It can be us...
ICDM
2002
IEEE
14 years 9 days ago
2002
IEEE
In this paper, we devise an efficient algorithm for clustering market-basket data. Different from those of the traditional data, the features of market-basket data are known to b...