Within-cluster resampling
簇内重抽样AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要只明确聚类数据与信息性簇大小,未说明面板结构、因果目标或网络干扰,故不强行归类。
簇内重抽样AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Within‐cluster resampling is proposed as a new method for analysing clustered data. Although the focus of this paper is clustered binary data, the within‐cluster resampling asymptotic theory is general for many types of clustered data. Within‐cluster resampling is a simple but computationally intensive estimation method. Its main advantage over other marginal analysis methods, such as generalised estimating equations (Liang & Zeger, 1986; Zeger & Liang, 1986) is that it remains valid when the risk for the outcome of interest is related to the cluster size, which we term nonignorable cluster size. We present theory for the asymptotic normality and provide a consistent variance estimator for the within‐cluster resampling estimator. Simulations and an example are developed that assess the finite‐sample behaviour of the new method and show that when both methods are valid its performance is similar to that of generalised estimating equations.