Scalable Nearest Neighbor Algorithms 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 neighbor matches to high dimensional vectors that represent t...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on pattern analysis and machine intelligence Ročník 36; číslo 11; s. 2227 - 2240
Hlavní autoři:	Muja, Marius, Lowe, David G.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States IEEE 01.11.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Approximation algorithms Approximation methods Clustering algorithms Computer vision Libraries Machine learning Machine learning algorithms Matching Partitioning algorithms Searching Training Trees Vegetation Nearest neighbor search algorithm configuration approximate search big data
ISSN:	0162-8828, 1939-3539, 2160-9292, 1939-3539
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!