Nearest neighbour queries on commercial databases
When you are in need of cash now, how can you quickly find the two nearest ATMs around you that are within one km? This can also be thought of as a k-nearest neighbour (KNN) problem. To help solving the problem, the objective of the project is to develop an application that allows users to search fo...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Final Year Project |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/48694 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |