The sequential rejection principle of familywise error control
族错误率控制的序贯拒绝原理AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要讨论一般多重检验的族错误率控制，所述图组织的是原假设而非经济网络或处理干扰，因此不归入网络方向。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
族错误率控制的序贯拒绝原理
- 研究问题
- 能否用统一的序贯拒绝框架解释多种多重检验方法，并为具有逻辑关系或图结构的原假设建立强族错误率控制？
- 方法与思路
- 作者提出一般序贯拒绝程序，将多种既有方法表示为特例，并以临界值单调性和每一步受限的弱错误率控制建立证明。
- 材料陈述的贡献
- 摘要称，该原理统一涵盖多种经典及图结构检验程序，并用于开发新程序，示例中对一项既有方法给出一致改进。
- 阅读关注点
- 应核对强控制与逐步弱控制的区别、临界值单调性的准确要求，以及逻辑关系和图结构如何进入拒绝规则与改进证明。
- 阅读边界
- 仅据版本未注明的 OpenAlex 摘要；准则细节及示例方法未提供，图结构指假设组织方式，不能据此推断网络干扰分析。
原文摘要
Closed testing and partitioning are recognized as fundamental principles of familywise error control. In this paper, we argue that sequential rejection can be considered equally fundamental as a general principle of multiple testing. We present a general sequentially rejective multiple testing procedure and show that many well-known familywise error controlling methods can be constructed as special cases of this procedure, among which are the procedures of Holm, Shaffer and Hochberg, parallel and serial gatekeeping procedures, modern procedures for multiple testing in graphs, resampling-based multiple testing procedures and even the closed testing and partitioning procedures themselves. We also give a general proof that sequentially rejective multiple testing procedures strongly control the familywise error if they fulfill simple criteria of monotonicity of the critical values and a limited form of weak familywise error control in each single step. The sequential rejection principle gives a novel theoretical perspective on many well-known multiple testing procedures, emphasizing the sequential aspect. Its main practical usefulness is for the development of multiple testing procedures for null hypotheses, possibly logically related, that are structured in a graph. We illustrate this by presenting a uniform improvement of a recently published procedure.