arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.11696stat.ME
收藏

存在缺失数据时Spearman's footrule的精确界及其在独立性检验中的应用

Exact Bounds of Spearman's footrule in the Presence of Missing Data with Applications to Independence Testing

Yijin Zeng, Niall M. Adams, Dean A. Bodenham

AI总结:

本研究给出部分观测向量间Spearman's footrule的精确上下界及高效算法,并据此提出一种在任意缺失机制下控制第一类错误率的两样本独立性检验方法。

摘要:

本研究探讨了两个部分观测的n维不同实值向量X和Y之间Spearman's footrule的精确界。下界通过依次构造部分观测向量的插补值获得,每个插补值的Spearman's footrule值非递增。上界首先考虑X和Y插补值的所有可能Spearman's footrule值集合,然后利用若干约束逐步缩小该集合的大小。分别提供了计算X和Y的Spearman's footrule下界和上界的算法,其计算复杂度分别为O(n^2)和O(n^3)。作为这些界的应用,我们提出了一种针对含缺失值数据的新的两样本独立性检验方法。该方法改进了所有现有方法,能在任意缺失机制下控制第一类错误率。模拟结果表明,当含缺失数据的配对比例低于15%时,我们的方法通常具有良好的检验功效。

英文摘要:

This work studies exact bounds of Spearman's footrule between two partially observed $n$-dimensional distinct real-valued vectors $X$ and $Y$. The lower bound is obtained by sequentially constructing imputations of the partially observed vectors, each with a non-increasing value of Spearman's footrule. The upper bound is found by first considering the set of all possible values of Spearman's footrule for imputations of $X$ and $Y$, and then the size of this set is gradually reduced using several constraints. Algorithms with computational complexities $O(n^2)$ and $O(n^3)$ are provided for computing the lower and upper bound of Spearman's footrule for $X$ and $Y$, respectively. As an application of the bounds, we propose a novel two-sample independence testing method for data with missing values. Improving on all existing approaches, our method controls the Type I error under arbitrary missingness. Simulation results demonstrate our method has good power, typically when the proportion of pairs containing missing data is below $15\%$.

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

↑