跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要讨论线性回归中的通用离群点诊断,未明确对应所列领域细分。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Ali S. Hadi

线性模型中多个离群点的识别程序

研究问题
当多个离群点相互影响并妨碍识别时,如何在线性模型中检测这些观测,同时减少掩蔽和误判正常点的问题?
方法与思路
作者提出两种程序,将数据分为干净子集与潜在离群点,再用适当缩放的预测误差检验潜在离群点的极端程度。
材料陈述的贡献
摘要称两种程序在所用数据与模拟中有效,无需预设离群点数量或用模拟确定阈值,并较能抵抗掩蔽与误判。
阅读关注点
应核对干净子集的形成规则、预测误差的缩放与阈值、重复检验的处理,以及比较方法和污染情形的设定。
阅读边界
材料为版本未注明的OpenAlex索引摘要;摘要中的优越性陈述限于所考察数据和模拟,未给出普遍性能保证。

原文摘要

We consider the problem of identifying and testing multiple outliers in linear models. The available outlier identification methods often do not succeed in detecting multiple outliers because they are affected by the observations they are supposed to identify. We introduce two test procedures for the detection of multiple outliers that appear to be less sensitive to this problem. Both procedures attempt to separate the data into a set of “clean” data points and a set of points that contain the potential outliers. The potential outliers are then tested to see how extreme they are relative to the clean subset, using an appropriately scaled version of the prediction error. The procedures are illustrated and compared to various existing methods, using several data sets known to contain multiple outliers. Also, the performances of both procedures are investigated by a Monte Carlo study. The data sets and the Monte Carlo indicate that both procedures are effective in the detection of multiple outliers in linear models and are superior to other methods, including methods based on robust fits (e.g., least median of squares residuals). In particular, the methods do not require presetting numbers of outliers to test for, do not require the efficiency level of an estimator, do not require Monte Carlo to determine cutoff values, are not highly computationally intensive, and are relatively resistant to both masking and swamping effects.

笔记与分组
相关领域论文