移动平均模型鲁棒修正递推拟合的实证研究

IF 0.3 Q4 MATHEMATICS
M. Ismail, Hend Auda, J. McKean, Mahmoud M. Sadek
{"title":"移动平均模型鲁棒修正递推拟合的实证研究","authors":"M. Ismail, Hend Auda, J. McKean, Mahmoud M. Sadek","doi":"10.3844/jmssp.2022.87.100","DOIUrl":null,"url":null,"abstract":": The time-series Moving Average (MA) model is a nonlinear model; see, for example. For traditional Least Squares (LS) fits, there are several algorithms to use for computing its fit. Since the model is nonlinear, Fuller discusses a Newton-type step algorithm. proposed a recursive algorithm based on a sequence of three linear LS regressions. In this study, we robustify Koreisha and Pukkila’s algorithm, by replacing these LS fits with robust fits. We selected an efficient, high breakdown robust fit that has good properties for skewed as well as symmetrically distributed random errors. Other robust estimates, however, can be chosen. We present the results of a simulation study comparing our robust modification with the Maximum Likelihood Estimates (MLE) in terms of efficiency and forecasting. Our robust modification has relatively high empirical efficiency relative to the MLE estimates under normally distributed errors, while it is much more efficient for heavy-tailed error distributions, including heavy-tailed skewed distributions.","PeriodicalId":41981,"journal":{"name":"Jordan Journal of Mathematics and Statistics","volume":"31 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Empirical Study of Robust Modified Recursive Fits of Moving Average Models\",\"authors\":\"M. Ismail, Hend Auda, J. McKean, Mahmoud M. Sadek\",\"doi\":\"10.3844/jmssp.2022.87.100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": The time-series Moving Average (MA) model is a nonlinear model; see, for example. For traditional Least Squares (LS) fits, there are several algorithms to use for computing its fit. Since the model is nonlinear, Fuller discusses a Newton-type step algorithm. proposed a recursive algorithm based on a sequence of three linear LS regressions. In this study, we robustify Koreisha and Pukkila’s algorithm, by replacing these LS fits with robust fits. We selected an efficient, high breakdown robust fit that has good properties for skewed as well as symmetrically distributed random errors. Other robust estimates, however, can be chosen. We present the results of a simulation study comparing our robust modification with the Maximum Likelihood Estimates (MLE) in terms of efficiency and forecasting. Our robust modification has relatively high empirical efficiency relative to the MLE estimates under normally distributed errors, while it is much more efficient for heavy-tailed error distributions, including heavy-tailed skewed distributions.\",\"PeriodicalId\":41981,\"journal\":{\"name\":\"Jordan Journal of Mathematics and Statistics\",\"volume\":\"31 1\",\"pages\":\"\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jordan Journal of Mathematics and Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3844/jmssp.2022.87.100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jordan Journal of Mathematics and Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3844/jmssp.2022.87.100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

:时间序列移动平均(MA)模型是一种非线性模型;比如说。对于传统的最小二乘(LS)拟合,有几种算法用于计算其拟合。由于模型是非线性的,Fuller讨论了一种牛顿型步进算法。提出了一种基于三个线性LS回归序列的递归算法。在本研究中,我们通过将这些LS拟合替换为鲁棒拟合来鲁棒化Koreisha和Pukkila的算法。我们选择了一种有效的、高击穿的鲁棒拟合,它对倾斜分布和对称分布的随机误差具有良好的性能。然而,可以选择其他可靠的估计。我们提出了一项模拟研究的结果,比较了我们的鲁棒修正与最大似然估计(MLE)在效率和预测方面的效果。我们的鲁棒修正相对于正态分布误差下的MLE估计具有相对较高的经验效率,而对于重尾误差分布,包括重尾偏态分布,它的效率要高得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Empirical Study of Robust Modified Recursive Fits of Moving Average Models
: The time-series Moving Average (MA) model is a nonlinear model; see, for example. For traditional Least Squares (LS) fits, there are several algorithms to use for computing its fit. Since the model is nonlinear, Fuller discusses a Newton-type step algorithm. proposed a recursive algorithm based on a sequence of three linear LS regressions. In this study, we robustify Koreisha and Pukkila’s algorithm, by replacing these LS fits with robust fits. We selected an efficient, high breakdown robust fit that has good properties for skewed as well as symmetrically distributed random errors. Other robust estimates, however, can be chosen. We present the results of a simulation study comparing our robust modification with the Maximum Likelihood Estimates (MLE) in terms of efficiency and forecasting. Our robust modification has relatively high empirical efficiency relative to the MLE estimates under normally distributed errors, while it is much more efficient for heavy-tailed error distributions, including heavy-tailed skewed distributions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.70
自引率
33.30%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信