用于分布式数据的可伸缩$k$ -d树
Scalable $k$-d trees for distributed data
摘要:
被称为$k$ -d树的数据结构在科学计算中有许多应用,特别是在现代统计和数据科学的领域中,例如决策树中的范围搜索、聚类、最近邻搜索、局部回归等。在这篇文章中,我们提出了一个可扩展的机制来构建分布式数据的$k$ -d树,基于近似中位数的数据的每个递归细分。我们提供了理论保证的质量近似使用这种方法,随着模拟研究量化的准确性和可扩展性,我们提出的方法在实践中。
英文摘要:
Data structures known as $k$-d trees have numerous applications in scientific computing, particularly in areas of modern statistics and data science such as range search in decision trees, clustering, nearest neighbors search, local regression, and so forth. In this article we present a scalable mechanism to construct $k$-d trees for distributed data, based on approximating medians for each recursive subdivision of the data. We provide theoretical guarantees of the quality of approximation using this approach, along with a simulation study quantifying the accuracy and scalability of our proposed approach in practice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。