Scalable nearest neighbour methods for high dimensional data
For many computer vision and machine learning problems, large training sets are key for good performance. However, the most computationally expensive part of many computer vision and machine learning algorithms consists of finding nearest neighbour matches to high dimensional vectors that repres...
Main Author: | Muja, Marius |
---|---|
Language: | English |
Published: |
University of British Columbia
2013
|
Online Access: | http://hdl.handle.net/2429/44402 |
Similar Items
-
Scalable nearest neighbour methods for high dimensional data
by: Muja, Marius
Published: (2013) -
Scalable nearest neighbour methods for high dimensional data
by: Muja, Marius
Published: (2013) -
Nearest neighbour imputation and variance estimation methods.
by: Mittinty, Murthy N.
Published: (2011) -
Nearest neighbour epidemic processes
by: Lloyd, Michael
Published: (1994) -
Efficient computation of k-Nearest Neighbour Graphs for large high-dimensional data sets on GPU clusters.
by: Ali Dashti, et al.
Published: (2013-01-01)