Thirty Years of The Network Scale-up Method
网络规模推算法三十年AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要以社会关系网络中的聚合关系数据为基础，估计隐蔽群体规模并比较网络抽样估计方法。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
网络规模推算法三十年
- 研究问题
- 如何通过受访者认识目标群体成员的数量估计难以接触的人群规模，以及不同网络规模推算法有何假设与实施差异？
- 方法与思路
- 作者分析聚合关系数据ARD的性质与采集技术，综述直接、最大似然和贝叶斯估计，并在同一典型数据集上比较方法。
- 材料陈述的贡献
- 摘要称系统梳理了各估计方法的假设、相互关系和实践问题，汇总应用与开放问题；具体模型比较呈现在补充材料中。
- 阅读关注点
- 应核对ARD采集与各估计量假设如何对应、典型数据的比较标准，以及正文综述和补充材料实证结果各自的范围。
- 阅读边界
- 仅据版本未注明的OpenAlex摘要；这是方法综述，摘要未给出统一优胜估计量，也未提供补充材料中的具体比较结果。
原文摘要
Estimating the size of hard-to-reach populations is an important problem for many fields. The Network Scale-up Method (NSUM) is a relatively new approach to estimate the size of these hard-to-reach populations by asking respondents the question, "How many X's do you know," where X is the population of interest (e.g. "How many female sex workers do you know?"). The answers to these questions form Aggregated Relational Data (ARD). The NSUM has been used to estimate the size of a variety of subpopulations, including female sex workers, drug users, and even children who have been hospitalized for choking. Within the Network Scale-up methodology, there are a multitude of estimators for the size of the hidden population, including direct estimators, maximum likelihood estimators, and Bayesian estimators. In this article, we first provide an in-depth analysis of ARD properties and the techniques to collect the data. Then, we comprehensively review different estimation methods in terms of the assumptions behind each model, the relationships between the estimators, and the practical considerations of implementing the methods. We apply many of the models discussed in the review to one canonical data set and compare their performance and unique features, presented in the supplementary materials. Finally, we provide a summary of the dominant methods and an extensive list of the applications, and discuss the open problems and potential research directions in this area.