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

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 condu...

• Type: Conference
• Year: 2003
• Where: ICDE
• Authors: Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoying Zhou
• Keywords: Database, Dimensionality Curse, Extensive Performance Study, ICDE 2003, Multi-level Mahalanobisbased Dimensionality