Efficient Indexing of High-Dimensional Data Through Dimensionality Reduction


The performance of the R-tree indexing method is known to deteriorate rapidly when the dimensionality of data increases. In this paper, we present a technique for dimensionality reduction by grouping d distinct attributes into k disjoint clusters and mapping each cluster to a linear space. The resulting k-dimensional space (which may be much smaller than d… (More)
DOI: 10.1016/S0169-023X(99)00031-2

11 Figures and Tables


  • Presentations referencing similar topics