Suppr超能文献

改进的最小二乘拓扑测试和估计。

Improved least squares topology testing and estimation.

机构信息

Department of Mathematics and Statistics, Dalhousie University, Halifax, Nova Scotia, Canada B3H3J5.

出版信息

Syst Biol. 2011 Oct;60(5):668-75. doi: 10.1093/sysbio/syr028. Epub 2011 Apr 11.

Abstract

Generalized least squares (GLS) methods provide a relatively fast means of constructing a confidence set of topologies. Because they utilize information about the covariances between distances, it is reasonable to expect additional efficiency in estimation and confidence set construction relative to other least squares (LS) methods. Difficulties have been found to arise in a number of practical settings due to estimates of covariance matrices being ill conditioned or even noninvertible. We present here new ways of estimating the covariance matrices for distances that are much more likely to be positive definite, as the actual covariance matrices are. A thorough investigation of performance is also conducted. An alternative to GLS that has been proposed for constructing confidence sets of topologies is weighted least squares (WLS). As currently implemented, this approach is equivalent to the use of GLS but with covariances set to zero rather than being estimated. In effect, this approach assumes normality of the estimated distances and zero covariances. As the results here illustrate, this assumption leads to poor performance. A 95% confidence set is almost certain to contain the true topology but will contain many more topologies than are needed. On the other hand, the results here also indicate that, among LS methods, WLS performs quite well at estimating the correct topology. It turns out to be possible to improve the performance of WLS for confidence set construction through a relatively inexpensive normal parametric bootstrap that utilizes the same variances and covariances of GLS. The resulting procedure is shown to perform at least as well as GLS and thus provides a reasonable alternative in cases where covariance matrices are ill conditioned.

摘要

广义最小二乘法(GLS)为构建拓扑置信集提供了一种相对快速的方法。由于它利用了距离之间协方差的信息,因此相对于其他最小二乘法(LS)方法,在估计和置信集构建方面有望提高效率。由于协方差矩阵的估计条件不良甚至不可逆转,在许多实际情况下都会出现困难。我们在这里提出了新的方法来估计距离的协方差矩阵,这些方法更有可能是正定的,就像实际的协方差矩阵一样。还对性能进行了彻底的调查。另一种用于构建拓扑置信集的 GLS 替代方法是加权最小二乘法(WLS)。如前所述,这种方法相当于使用 GLS,但将协方差设置为零而不是进行估计。实际上,这种方法假设估计距离的正态性和零协方差。正如这里的结果所示,这种假设会导致性能不佳。95%置信集几乎肯定包含真实拓扑结构,但包含的拓扑结构比需要的多得多。另一方面,这里的结果还表明,在 LS 方法中,WLS 在估计正确拓扑方面表现相当出色。通过相对便宜的正态参数引导,可以改进 WLS 用于置信集构建的性能,该引导利用 GLS 的相同方差和协方差。结果表明,该过程的性能至少与 GLS 一样好,因此在协方差矩阵条件不良的情况下提供了一种合理的替代方法。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验