Variable KD-Tree Algorithms for Spatial Pattern Search and Discovery
Abstract
In this paper we consider the problem of finding sets of points that conform to a given underlying model from within a dense, noisy set of observations. This problem is motivated by the task of efficiently linking faint asteroid detections, but is applicable to a range of spatial queries. We survey current tree-based approaches, showing a trade-off exists between single tree and multiple tree algorithms. To this end, we present a new type of multiple tree algorithm that uses a variable number of trees to exploit the advantages of both approaches. We empirically show that this algorithm performs well using both simulated and astronomical data.
Cite
Text
Kubica et al. "Variable KD-Tree Algorithms for Spatial Pattern Search and Discovery." Neural Information Processing Systems, 2005.Markdown
[Kubica et al. "Variable KD-Tree Algorithms for Spatial Pattern Search and Discovery." Neural Information Processing Systems, 2005.](https://mlanthology.org/neurips/2005/kubica2005neurips-variable/)BibTeX
@inproceedings{kubica2005neurips-variable,
title = {{Variable KD-Tree Algorithms for Spatial Pattern Search and Discovery}},
author = {Kubica, Jeremy and Masiero, Joseph and Jedicke, Robert and Connolly, Andrew and Moore, Andrew W.},
booktitle = {Neural Information Processing Systems},
year = {2005},
pages = {691-698},
url = {https://mlanthology.org/neurips/2005/kubica2005neurips-variable/}
}