Show simple item record  

dc.contributor.authorKibriya, Ashraf Masooden_NZ
dc.date.accessioned2007-03-15T12:29:56Z
dc.date.available2007-08-29T15:36:15Z
dc.date.issued2007en_NZ
dc.identifier.citationKibriya, A. M. (2007). Fast Algorithms for Nearest Neighbour Search (Thesis, Master of Science (MSc)). The University of Waikato, Hamilton, New Zealand. Retrieved from https://hdl.handle.net/10289/2463en
dc.identifier.urihttps://hdl.handle.net/10289/2463
dc.description.abstractThe nearest neighbour problem is of practical significance in a number of fields. Often we are interested in finding an object near to a given query object. The problem is old, and a large number of solutions have been proposed for it in the literature. However, it remains the case that even the most popular of the techniques proposed for its solution have not been compared against each other. Also, many techniques, including the old and popular ones, can be implemented in a number of ways, and often the different implementations of a technique have not been thoroughly compared either. This research presents a detailed investigation of different implementations of two popular nearest neighbour search data structures, KDTrees and Metric Trees, and compares the different implementations of each of the two structures against each other. The best implementations of these structures are then compared against each other and against two other techniques, Annulus Method and Cover Trees. Annulus Method is an old technique that was rediscovered during the research for this thesis. Cover Trees are one of the most novel and promising data structures for nearest neighbour search that have been proposed in the literature.en_NZ
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherThe University of Waikatoen_NZ
dc.rightsAll items in Research Commons are provided for private study and research purposes and are protected by copyright with all rights reserved unless otherwise indicated.
dc.subjectNearest Neighbouren_NZ
dc.subjectNearest Neighboren_NZ
dc.subjectNearest Neighbour searchen_NZ
dc.subjectNearest Neighbor searchen_NZ
dc.subjectbest-matchen_NZ
dc.subjectclosest-matchen_NZ
dc.subjectclosest pointen_NZ
dc.subjectpost office problemen_NZ
dc.subjectkd-treesen_NZ
dc.subjectKDTreesen_NZ
dc.subjectBall Treesen_NZ
dc.subjectMetric Treesen_NZ
dc.subjectCover Treesen_NZ
dc.titleFast Algorithms for Nearest Neighbour Searchen_NZ
dc.typeThesisen_NZ
thesis.degree.disciplineSCMSen_NZ
thesis.degree.grantorUniversity of Waikatoen_NZ
thesis.degree.levelMasters
thesis.degree.nameMaster of Science (MSc)en_NZ
uow.date.accession2007-03-15T12:29:56Zen_NZ
uow.date.available2007-08-29T15:36:15Zen_NZ
uow.identifier.adthttp://adt.waikato.ac.nz/public/adt-uow20070315.122956en_NZ
uow.date.migrated2009-06-09T23:34:31Zen_NZ
pubs.place-of-publicationHamilton, New Zealanden_NZ


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record