Dimensionality Reduced Clustered Data And Order Partition And Stepwise Dimensionality Increasing Indices
2024 Β· Alexander Thomasian
Abstract
One of the goals of NASA funded project at IBM T. J. Watson Research Center was to build an index for similarity searching satellite images, which were characterized by high-dimensional feature image texture vectors. Reviewed is our effort on data clustering, dimensionality reduction via Singular Value Decomposition - SVD and indexing to build a smaller index and more efficient k-Nearest Neighbor - k-NN query processing for similarity search. k-NN queries based on scanning of the feature vectors of all images is obviously too costly for ever-increasing number of images. The ubiquitous multidimensional R-tree index and its extensions were not an option given their limited scalability dimension-wise. The cost of processing k-NN queries was further reduced by building memory resident Ordered Partition indices on dimensionality reduced clusters. Further research in a university setting included the following: (1) Clustered SVD was extended to yield exact k-NN queries by issuing appropriate
Authors
(none)
Tags
Stats
Related papers
- Hd-index: Pushing The Scalability-accuracy Boundary For Approximate Knn Search In High-dimensional Spaces (2018)14.02
- Order-preserving Dimension Reduction For Multimodal Semantic Embedding (2024)2.26
- In Search Of The Most Efficient And Memory-saving Visualization Of High Dimensional Data (2023)0.00
- High Dimensional Similarity Search With Satellite System Graph: Efficiency, Scalability, And Unindexed Query Compatibility (2019)17.30
- Dimensionality-reduction Techniques For Approximate Nearest Neighbor Search: A Survey And Evaluation (2024)0.00
- Interactive Dimensionality Reduction Using Similarity Projections (2018)8.09
- Unconventional Application Of K-means For Distributed Approximate Similarity Search (2022)5.84
- Gleanvec: Accelerating Vector Search With Minimalist Nonlinear Dimensionality Reduction (2024)0.00