ACCELERATION OF K-NEAREST NEIGHBOR QUERY WITH TRIANGLE INEQUALITY PRUNING ON PRODUCT QUANTIZATION
This thesis conducts research to accelerate k-Nearest Neighbor (k-NN) query execution on the Product Quantization (PQ) algorithm. Product Quantization is an approximate kNN algorithm for large and high-dimensional datasets. The main idea behind PQ is to decompose the data vectors dimension into s...
Saved in:
主要作者: | Edian, Ikraduya |
---|---|
格式: | Final Project |
語言: | Indonesia |
在線閱讀: | https://digilib.itb.ac.id/gdl/view/61872 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Institut Teknologi Bandung |
語言: | Indonesia |
相似書籍
-
Two ellipse-based pruning methods for group nearest neighbor queries
由: Li, H., et al.
出版: (2013) -
Visible Reverse K-Nearest Neighbor Queries
由: GAO, Yunjun, et al.
出版: (2009) -
Distributed k-nearest neighbor queries in metric spaces
由: DING, Xin, et al.
出版: (2018) -
Group Nearest Neighbor Queries
由: PAPADIAS, Dimitris, et al.
出版: (2004) -
Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases
由: GAO, Yunjun, et al.
出版: (2009)