A Unified Framework for Variable Selection in Model-Based Clustering with Missing Not at Random
缺失非随机下基于模型聚类的变量选择统一框架AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
本页为预印本版本；arXiv 收录、作者填写的期刊信息以及作者既有发表经历，都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对，只展示已核实例，档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要讨论的是基于模型聚类的变量选择与缺失非随机建模，属于统计方法与生物信息应用，未涉及所提供领域细分中的因果推断、面板、时间序列、资产定价等方向，故不选择。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
缺失非随机下基于模型聚类的变量选择统一框架
- 研究问题
- 摘要称，如何在同时存在缺失非随机（MNAR）与异质子群变量选择需求时，进行基于模型的聚类；作者指出既有方法通常分别处理这两个问题，灵活性与适应性受限。
- 方法与思路
- 作者提出一个统一框架：在惩罚聚类中引入数据驱动的惩罚矩阵以实现更灵活的变量选择，并加入显式刻画缺失机制与潜在类别归属关系的机制；摘要称在一定的正则条件下推导了渐近一致性与选择一致性。
- 材料陈述的贡献
- 摘要明确陈述的贡献是：将变量选择与缺失非随机建模纳入同一惩罚聚类框架，并在存在缺失数据时给出渐近一致性与选择一致性结论；通过模拟以及合成与真实转录组数据评估性能与计算效率。
- 阅读关注点
- 应核对正则条件的具体内容与可验证性、缺失机制与潜在类别关系的识别假设、惩罚矩阵的构造与调参方式、一致性结论的证明范围，以及模拟与转录组数据中缺失机制的设定是否与理论相符。
- 阅读边界
- 仅依据摘要，无法判断定理证明细节、识别假设是否合理、数值结果优劣与计算效率高低；该文为 arXiv 预印本，未经同行评审验证，不能据此声称已被期刊接收。
原文摘要
Model-based clustering integrated with variable selection is a powerful tool for uncovering latent structures within complex data. However, its effectiveness is often hindered by challenges such as identifying relevant variables that define heterogeneous subgroups and handling data that are missing not at random, a prevalent issue in fields like transcriptomics. While several notable methods have been proposed to address these problems, they typically tackle each issue in isolation, thereby limiting their flexibility and adaptability. This paper introduces a unified framework designed to address these challenges simultaneously. Our approach incorporates a data-driven penalty matrix into penalized clustering to enable more flexible variable selection, along with a mechanism that explicitly models the relationship between missingness and latent class membership. We demonstrate that, under certain regularity conditions, the proposed framework achieves both asymptotic consistency and selection consistency, even in the presence of missing data. This unified strategy significantly enhances the capability and efficiency of model-based clustering, advancing methodologies for identifying informative variables that define homogeneous subgroups in the presence of complex missing data patterns. The performance of the framework, including its computational efficiency, is evaluated through simulations and demonstrated using both synthetic and real-world transcriptomic datasets.