Please use this identifier to cite or link to this item:
|Title:||An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing|
|Citation:||Jin, H., Ooi, B.C., Shen, H.T., Yu, C., Zhou, A.Y. (2003). An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing. Proceedings - International Conference on Data Engineering : 87-98. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2003.1260784|
|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 Mahalanobis-based 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.|
|Source Title:||Proceedings - International Conference on Data Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 12, 2018
WEB OF SCIENCETM
checked on Oct 3, 2018
checked on Jun 30, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.