Issue No. 01 - January/February (2002 vol. 14)

ISSN: 1041-4347

pp: 156-171

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.979979

ABSTRACT

<p><b>Abstract</b>—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, called the <tmath>$\epsilon$</tmath> tree, for fast spatial similarity joins on high-dimensional points. This index structure reduces the number of neighboring leaf nodes that are considered for the join test, as well as the traversal cost of finding appropriate branches in the internal nodes. The storage cost for internal nodes is independent of the number of dimensions. Hence, the proposed index structure scales to high-dimensional data. We analyze the cost of the join for the <tmath>$\epsilon$</tmath> tree and the R-tree family, and show that the <tmath>$\epsilon$</tmath> tree will perform better for high-dimensional joins. Empirical evaluation, using synthetic and real-life data sets, shows that similarity join using the <tmath>$\epsilon$</tmath> tree is twice to an order of magnitude faster than the <tmath>$R^+$</tmath> tree, with the performance gap increasing with the number of dimensions. We also discuss how some of the ideas of the <tmath>$\epsilon$</tmath> tree can be applied to the R-tree family. These biased R-trees perform better than the corresponding traditional R-trees for high-dimensional similarity joins, but do not match the performance of the <tmath>$\epsilon$</tmath> tree.</p>

INDEX TERMS

Data mining, similar time sequences, similarity join

CITATION

R. Agrawal, K. Shim, R. Srikant, "High-Dimensional Similarity Joins",

*IEEE Transactions on Knowledge & Data Engineering*, vol. 14, no. , pp. 156-171, January/February 2002, doi:10.1109/69.979979