Granular representation schemes of time series: A study in an optimal allocation of information granularity

R. Al-Hmouz, W. Pedrycz, A. Balamash, A. Morfeq
{"title":"Granular representation schemes of time series: A study in an optimal allocation of information granularity","authors":"R. Al-Hmouz, W. Pedrycz, A. Balamash, A. Morfeq","doi":"10.1109/FOCI.2013.6602454","DOIUrl":null,"url":null,"abstract":"Information granularity augments a variety of schemes of representation of time series, helps quantify the quality of models of the series and supports a thorough analysis of their parameters. This study introduces a concept of a granular representation of time series. We show that information granules formed on a basis of a given original numeric representation of the series can be optimized through a process of allocation (distribution) of information granularity being regarded here as an essential design asset. We formulate an optimization criterion and utilize a Particle Swarm Optimization (PSO) as an optimization vehicle to distribute a predefined level of information granularity. An optimization criterion used in the formation of the granular representation scheme is concerned with expressing and maximizing coverage of available temporal data by their granular representation. Experimental results in which we focus on the Piecewise Aggregate Approximation (PAA) offer details of the optimization of the allocation of granularity completed for some synthetic and real-world time series and quantify the performance of the resulting granular schemes of representation of time series.","PeriodicalId":237129,"journal":{"name":"2013 IEEE Symposium on Foundations of Computational Intelligence (FOCI)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Symposium on Foundations of Computational Intelligence (FOCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FOCI.2013.6602454","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Information granularity augments a variety of schemes of representation of time series, helps quantify the quality of models of the series and supports a thorough analysis of their parameters. This study introduces a concept of a granular representation of time series. We show that information granules formed on a basis of a given original numeric representation of the series can be optimized through a process of allocation (distribution) of information granularity being regarded here as an essential design asset. We formulate an optimization criterion and utilize a Particle Swarm Optimization (PSO) as an optimization vehicle to distribute a predefined level of information granularity. An optimization criterion used in the formation of the granular representation scheme is concerned with expressing and maximizing coverage of available temporal data by their granular representation. Experimental results in which we focus on the Piecewise Aggregate Approximation (PAA) offer details of the optimization of the allocation of granularity completed for some synthetic and real-world time series and quantify the performance of the resulting granular schemes of representation of time series.
时间序列的粒度表示方案:信息粒度最优分配的研究
信息粒度增加了时间序列的各种表示方案,有助于量化序列模型的质量,并支持对其参数的彻底分析。本研究引入了时间序列粒度表示的概念。我们表明,在给定的原始数字表示的基础上形成的信息颗粒可以通过信息粒度的分配(分布)过程进行优化,在这里被视为基本的设计资产。我们制定了一个优化准则,并利用粒子群优化(PSO)作为优化工具来分配预定义的信息粒度级别。在形成粒度表示方案时使用的优化准则是通过粒度表示来表达和最大化可用时间数据的覆盖范围。在实验结果中,我们重点研究了分段聚合近似(PAA),提供了对一些合成时间序列和现实世界时间序列完成的粒度分配的优化细节,并量化了时间序列表示的颗粒方案的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信