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:
Main Author: | Edian, Ikraduya |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/61872 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
Two ellipse-based pruning methods for group nearest neighbor queries
by: Li, H., et al.
Published: (2013) -
Visible Reverse K-Nearest Neighbor Queries
by: GAO, Yunjun, et al.
Published: (2009) -
Distributed k-nearest neighbor queries in metric spaces
by: DING, Xin, et al.
Published: (2018) -
Group Nearest Neighbor Queries
by: PAPADIAS, Dimitris, et al.
Published: (2004) -
Nearest neighbor queries in spatial database
by: Liu, Danzhou.
Published: (2008)