Multi-Tree Methods for Statistics on Very Large Datasets in Astronomy
摘要
Many fundamental statistical methods have become critical tools for scientific data analysis yet do not scale tractably to modern large datasets. This paper will describe very recent algorithms based on computational geometry which have dramatically reduced the computational complexity of 1) kernel density estimation (which also extends to nonparametric regression, classification, and clustering), and 2) the n-point correlation function for arbitrary n. These new multi-tree methods typically yield orders of magnitude in speedup over the previous state of the art for similar accuracy, making millions of data points tractable on desktop workstations for the first time.
引用
@article{arxiv.astro-ph/0401121,
title = {Multi-Tree Methods for Statistics on Very Large Datasets in Astronomy},
author = {Alexander G. Gray and Andrew W. Moore and Robert C. Nichol and Andrew J. Connolly and Christopher Genovese and Larry Wasserman},
journal= {arXiv preprint arXiv:astro-ph/0401121},
year = {2007}
}
备注
4-page conference proceeding based on talk given at ADASS XIII, 13-15 October, 2003, Strasbourg