Please use this identifier to cite or link to this item:
|Title:||Adaptive quantization of the high-dimensional data for efficient KNN processing|
|Authors:||Cui, B. |
|Citation:||Cui, B., Hu, J., Shen, H., Yu, C. (2004). Adaptive quantization of the high-dimensional data for efficient KNN processing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2973 : 302-303. ScholarBank@NUS Repository.|
|Abstract:||In this paper, we present a novel index structure, called the SA-tree, to speed up processing of high-dimensional K-nearest neighbor (KNN) queries. The SA-tree employs data clustering and compression, i.e. utilizes the characteristics of each cluster to adaptively compress feature vectors into bit-strings. Hence our proposed mechanism can reduce the disk I/O and computational cost significantly, and adapt to different data distributions. We also develop efficient KNN search algorithms using MinMax Pruning and Partial MinDist Pruning methods. We conducted extensive experiments to evaluate the SA-tree and the results show that our approaches provide superior performance. © Springer-Verlag 2004.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.