...
【24h】

Simple polynomial multiplication algorithms for exact conditional tests of linearity in a logistic model.

机译:简单的多项式乘法算法,用于在逻辑模型中进行线性的精确条件测试。

获取原文
获取原文并翻译 | 示例

摘要

The linear logistic model is often employed in the analysis of binary response data. The well-known asymptotic chi-square and likelihood ratio tests are usually used to detect the assumption of linearity in such a model. For small, sparse, or skewed data, the asymptotic theory is however dubious and exact conditional chi-square and likelihood ratio tests may provide reliable alternatives. In this article, we propose efficient polynomial multiplication algorithms to compute exact significance levels as well as exact powers of these tests. Two options, namely the cell- and stage-wise approaches, in implementing these algorithms will be discussed. When sample sizes are large, we propose an efficient Monte Carlo method for estimating the exact significance levels and exact powers. Real data are used to demonstrate the performance with an application of the proposed algorithms.
机译:线性逻辑模型通常用于分析二进制响应数据。通常使用众所周知的渐近卡方检验和似然比检验来检测此类模型中的线性假设。对于小数据,稀疏数据或偏斜数据,渐近理论是可疑的,精确的条件卡方检验和似然比检验可能提供可靠的选择。在本文中,我们提出了有效的多项式乘法算法,以计算确切的显着性水平以及这些测试的确切功效。将讨论实现这些算法的两种方法,即单元方法和阶段方法。当样本量很大时,我们提出一种有效的蒙特卡洛方法来估计确切的显着性水平和确切的功效。实际数据用于通过所提出算法的应用来演示性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号