Please use this identifier to cite or link to this item:
Title: Application of Approximate Nearest Neighbour Search Algorithm- Locality Sensitive Hashing
Authors: Mahajan, Shalagha
Saha, Suman [Guided by]
Keywords: Algorithms
Neighbor Algorithm
KD Tree
Locality Sensitive Hashing
Issue Date: 2014
Publisher: Jaypee University of Information Technology, Solan, H.P.
Abstract: In computer science, approximation algorithms are algorithms used to find approximate solutions to optimization problems. Exact nearest neighbour search algorithms return accurate results but with the dimensions the complexity, both time and space increase exponentially. Thus striking a tradeoff between complexity and accuracy, we shift to approximate nearest neighbour search algorithms wherein we cut down on the complexity and in turn compromise on the accuracy. In this year long project, various approximate nearest neighbour search algorithms were explored, the prominent ones being implemented as well. Thereafter, the algorithms so implemented were compared with each other on various grounds like time complexity and dependence on dimension by running the algorithms for various datasets.
Appears in Collections:B.Tech. Project Reports

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.