Retrospective technology of segmentation and classification for GARCH models based on the concept of the $ \epsilon $-complexity of continuous functions

IF 2.8
A. Piryatinska, B. Darkhovsky
{"title":"Retrospective technology of segmentation and classification for GARCH models based on the concept of the $ \\epsilon $-complexity of continuous functions","authors":"A. Piryatinska, B. Darkhovsky","doi":"10.3934/dsfe.2022012","DOIUrl":null,"url":null,"abstract":"We consider a retrospective segmentation and classification problem for GARCH models. Segmentation is the partition of a long time series into homogeneous fragments. A fragment is homogeneous if only one mechanism generates it. The points of \"concatenation\" of homogeneous segments we call (by analogy with the term used in the stochastic literature) points of disorder or change-points. We call classification the separation of two relatively short time series generated by different mechanisms. By classification, we mean the way in which two groups of time series with unknown generating mechanism (in particularly, generated by GARCH models) can be distinguished, and the new time series can be assigned to the class. Our model free technology is based on our concept of $ \\epsilon $-complexity of individual continuous functions. This technology does not use information about the time series generation mechanism. We demonstrate our approach on time series generated by GARCH models. We present simulations and real data analysis results confirming the effectiveness of the methodology.","PeriodicalId":290300,"journal":{"name":"Data Science in Finance and Economics","volume":"22 1","pages":"0"},"PeriodicalIF":2.8000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Data Science in Finance and Economics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3934/dsfe.2022012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We consider a retrospective segmentation and classification problem for GARCH models. Segmentation is the partition of a long time series into homogeneous fragments. A fragment is homogeneous if only one mechanism generates it. The points of "concatenation" of homogeneous segments we call (by analogy with the term used in the stochastic literature) points of disorder or change-points. We call classification the separation of two relatively short time series generated by different mechanisms. By classification, we mean the way in which two groups of time series with unknown generating mechanism (in particularly, generated by GARCH models) can be distinguished, and the new time series can be assigned to the class. Our model free technology is based on our concept of $ \epsilon $-complexity of individual continuous functions. This technology does not use information about the time series generation mechanism. We demonstrate our approach on time series generated by GARCH models. We present simulations and real data analysis results confirming the effectiveness of the methodology.
基于连续函数复杂度概念的GARCH模型回溯式分割分类技术
我们考虑了GARCH模型的回溯分割和分类问题。分割是将长时间序列分割成均匀的片段。如果只有一种机制产生一个片段,那么它就是同质的。同质片段的“串联”点我们称之为(与随机文献中使用的术语类似)无序点或变化点。我们把由不同机制产生的两个相对较短的时间序列的分离称为分类。通过分类,我们指的是可以区分两组生成机制未知的时间序列(特别是GARCH模型生成的时间序列),并将新的时间序列分配给该类。我们的无模型技术是基于我们的概念-单个连续函数的复杂性。该技术不使用有关时间序列生成机制的信息。我们在GARCH模型生成的时间序列上演示了我们的方法。我们给出了仿真和真实数据分析结果,证实了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书