Statistical inference based on robust low-rank data matrix approximation
基于稳健低秩数据矩阵近似的统计推断AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:文本研究一般低秩矩阵近似并应用于基因数据,没有宏观或金融因子模型的直接依据。
基于稳健低秩数据矩阵近似的统计推断AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
The singular value decomposition is widely used to approximate data matrices with lower rank matrices. Feng and He [Ann. Appl. Stat. 3 (2009) 1634–1654] developed tests on dimensionality of the mean structure of a data matrix based on the singular value decomposition. However, the first singular values and vectors can be driven by a small number of outlying measurements. In this paper, we consider a robust alternative that moderates the effect of outliers in low-rank approximations. Under the assumption of random row effects, we provide the asymptotic representations of the robust low-rank approximation. These representations may be used in testing the adequacy of a low-rank approximation. We use oligonucleotide gene microarray data to demonstrate how robust singular value decomposition compares with the its traditional counterparts. Examples show that the robust methods often lead to a more meaningful assessment of the dimensionality of gene intensity data matrices.