Integration of Projected Clusters and Principal Axis Trees for High-Dimensional Data Indexing and Query

High-dimensional data indexing and query is a challenging problem due to the inherent sparsity of the data. Fast algorithms are in an urgent need in this field. In this paper, an automatic subspace dimension selection (ASDS) based clustering algorithm is derived from the well-known projection-based clustering algorithm, ORCLUS, and a two-level architecture for high-dimensional data indexing and query is also proposed, which integrates projected clusters and principal axis trees (PAT) to generate efficient high-dimensional data indexes. The query performances of similarity search by ASDS+PAT, ORCLUS+PAT, PAT alone, and Clindex are compared on two high-dimensional data sets. The results show that the integration of ASDS and PAT is an efficient indexing architecture and considerably reduces the query time.