Time series symbolization and search for frequent patterns

Mai Van Hoan, M. Exbrayat
{"title":"Time series symbolization and search for frequent patterns","authors":"Mai Van Hoan, M. Exbrayat","doi":"10.1145/2542050.2542057","DOIUrl":null,"url":null,"abstract":"In this paper, we focus on two aspects of time series mining: first on the transformation of numerical data to symbolic data; then on the search for frequent patterns in the resulting symbolic time series. We are thus interested in some patterns which have a high frequency in our database of time series and might help to generate candidates for various tasks in the area of time series mining. During the symbolization phase, we transform the numerical time series into a symbolic time series by i) splitting this latter into consecutive subsequences, ii) using a clustering algorithm to cluster these subsequences, each subsequence being then replaced by the name of its cluster to produce the symbolic time series. In the second phase, we use a sliding window to create a collection of transactions from the symbolic time series, then we use some algorithm for mining sequential pattern to find out some interesting motifs in the original time series. An example experiment based on environmental data is presented.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th Symposium on Information and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2542050.2542057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, we focus on two aspects of time series mining: first on the transformation of numerical data to symbolic data; then on the search for frequent patterns in the resulting symbolic time series. We are thus interested in some patterns which have a high frequency in our database of time series and might help to generate candidates for various tasks in the area of time series mining. During the symbolization phase, we transform the numerical time series into a symbolic time series by i) splitting this latter into consecutive subsequences, ii) using a clustering algorithm to cluster these subsequences, each subsequence being then replaced by the name of its cluster to produce the symbolic time series. In the second phase, we use a sliding window to create a collection of transactions from the symbolic time series, then we use some algorithm for mining sequential pattern to find out some interesting motifs in the original time series. An example experiment based on environmental data is presented.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
时间序列符号化和频繁模式搜索
本文主要研究了时间序列挖掘的两个方面:一是数值数据到符号数据的转换;然后在得到的符号时间序列中寻找频繁的模式。因此,我们对时间序列数据库中频率较高的一些模式感兴趣,这些模式可能有助于为时间序列挖掘领域的各种任务生成候选模式。在符号化阶段,我们将数值时间序列转换为符号时间序列,i)将后者分割成连续的子序列,ii)使用聚类算法对这些子序列进行聚类,然后将每个子序列替换为其聚类的名称以产生符号时间序列。在第二阶段,我们使用滑动窗口从符号时间序列中创建事务集合,然后使用挖掘序列模式的算法在原始时间序列中发现一些有趣的主题。给出了一个基于环境数据的实例实验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Toward a practical visual object recognition system P2P shared-caching model: using P2P to improve client-server application performance Modeling and debugging numerical constraints of cyber-physical systems design Iterated local search in nurse rostering problem Towards tangent-linear GPU programs using OpenACC
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1