An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing

Abstract

The notorious “dimensionality curse” is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to overcoming degradation in performance with respect to increasing dimensions is to reduce the dimensionality of the original dataset before constructing the index. However, identifying the correlation among the dimensions and effectively reducing them is a challenging task. In this paper, we present an adaptive Multi-level Mahalanobisbased Dimensionality Reduction (MMDR) technique for high-dimensional indexing. Our MMDR technique has three notable features compared to existing methods. First, it discovers elliptical clusters using only the low-dimensional subspaces. Second, data points in the different axis systems are indexed using a single B -tree. Third, our technique is highly scalable in terms of data size and dimensionality. An extensive performance study using both real and synthetic datasets was conducted, and the results show that our technique not only achieves higher precision, but also enables queries to be processed efficiently.

DOI: 10.1109/ICDE.2003.1260784

Extracted Key Phrases

11 Figures and Tables

Statistics

051015'04'06'08'10'12'14'16
Citations per Year

61 Citations

Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Jin2003AnAA, title={An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing}, author={Hui Jin and Beng Chin Ooi and Heng Tao Shen and Cui Yu and Aoying Zhou}, booktitle={ICDE}, year={2003} }