Improving dual-tree algorithms

Improving dual-tree algorithms

This large body of work is entirely centered around dual-tree algorithms, a class of algorithm based on spatial indexing structures that often provide large amounts of acceleration for various problems. This work focuses on understanding dual-tree algorithms using a new, tree-independent abstraction...

Full description

Bibliographic Details
Main Author: Curtin, Ryan Ross
Other Authors: Anderson, David V.
Format: Others
Language:en_US
Published: Georgia Institute of Technology 2016
Subjects:
Machine learning
Computational geometry
Tree-based algorithms
Dual-tree algorithms
Kd-tree
Nearest neighbor search
K-means clustering
Data mining
Online Access:http://hdl.handle.net/1853/54354

Internet

http://hdl.handle.net/1853/54354

Similar Items