On Asymptotic Power and Efficiency of Tests of Independence in Contingency Tables with Ordered Classifications
有序分类列联表独立性检验的渐近功效与效率AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:文本研究有序列联表的独立性检验,未涉及离散选择行为模型或其他所列细分。
反馈分类问题有序分类列联表独立性检验的渐近功效与效率AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Asymptotic power formulas for tests of independence against simple association models in I × J contingency tables with ordered categories are presented. Yates's score correlation test and Spearman's tied rank correlation test are compared with a likelihood ratio test proposed by S. J. Haberman for testing independence in log-linear models with ordered classifications. Asymptotic power and relative efficiencies are derived under local alternatives that need not be included in the likelihood model assumed by Haberman's procedure. Some computations for real and fictitious data are presented.