Robust Singular Value Decompositions: A New Approach to Projection Pursuit
稳健奇异值分解:投影寻踪的新方法AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要涉及一般多元稳健估计与主成分分析,未明确建立宏观或金融因子模型。
稳健奇异值分解:投影寻踪的新方法AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Robust location and covariance estimators are developed via general M estimation for covariance matrix eigenvectors and eigenvalues. The solution to this GM estimation problem is obtained by transforming it into a series of robust regression problems based on a new algorithm for the singular value decomposition. It is shown here that the singular value decomposition can be represented as an iteration of two steps: a least squares regression fit of the data matrix followed by a rotation to the regression hyperplanes. An algorithm to obtain the solution to this GM estimation problem is presented, along with results of a Monte Carlo study and examples of its application. In addition, it is shown how the output of this algorithm can be used to numerically search for multivariate outliers, which is especially useful in exploratory data analysis with high-dimensional data and large sample sizes, where standard graphical techniques are difficult to implement. Because the algorithm computes robust estimates of the eigenvectors and eigenvalues of the covariance matrix, it can be used as a basis for other multivariate methods such as errors-in-variables regression, discriminant analysis, and principal components.