arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.07530math.STmath.PRstat.TH
收藏

基于图的无分布双样本检验的一般渐近框架

A General Asymptotic Framework for Distribution-Free Graph-Based Two-Sample Tests

Bhaswar B. Bhattacharya

摘要:

两个多元分布的相等性检验是一个经典的问题,多年来已经提出了许多非参数检验。大多数流行的两样本检验是渐近分布自由的,它们基于使用观测值之间的点间距离构建的几何图(Wald-Wolfowitz游程检验的多变量推广)或基于多变量数据深度(Mann-Whitney秩检验的推广)。本文提出了基于分布自由图的两样本检验的一般概念,并为分析和比较它们的渐近性质提供了一个统一的框架。推导了一般图检验的渐近(Pitman)有效性,包括基于几何图的检验,如Friedman-Rafsky检验(1979)、基于$K$ -最近邻图的检验、交叉匹配检验(2005)、广义边数检验(2017)、以及基于多变量深度函数的检验(Liu-Singh秩和统计(1993))。结果显示了底层图的组合性质如何影响相关双样本测试的性能,并且可以用于验证和决定在实践中使用哪些测试。合成和真实数据集上的结果的应用进行了说明。

英文摘要:

Testing equality of two multivariate distributions is a classical problem for which many non-parametric tests have been proposed over the years. Most of the popular two-sample tests, which are asymptotically distribution-free, are based either on geometric graphs constructed using inter-point distances between the observations (multivariate generalizations of the Wald-Wolfowitz's runs test) or on multivariate data-depth (generalizations of the Mann-Whitney rank test). This paper introduces a general notion of distribution-free graph-based two-sample tests, and provides a unified framework for analyzing and comparing their asymptotic properties. The asymptotic (Pitman) efficiency of a general graph-based test is derived, which include tests based on geometric graphs, such as the Friedman-Rafsky test (1979), the test based on the $K$-nearest neighbor graph, the cross-match test (2005), the generalized edge-count test (2017), as well as tests based on multivariate depth functions (the Liu-Singh rank sum statistic (1993)). The results show how the combinatorial properties of the underlying graph effect the performance of the associated two-sample test, and can be used to validate and decide which tests to use in practice. Applications of the results are illustrated both on synthetic and real datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑