在降雨数据集的符号序列中发现频繁的连续事件

A. Ahmed, A. Bakar, A. Hamdan, Sharifah Mastura Syed Abdullah, O. Jaafar
{"title":"在降雨数据集的符号序列中发现频繁的连续事件","authors":"A. Ahmed, A. Bakar, A. Hamdan, Sharifah Mastura Syed Abdullah, O. Jaafar","doi":"10.1109/DMO.2012.6329809","DOIUrl":null,"url":null,"abstract":"Serial episode is a type of temporal frequent pattern in time series. Many different algorithms have been proposed to discover different types of episodes for different applications. In this paper we propose an algorithm for discovering frequent episodes from processed rain fall data. The algorithm is based on three main steps. (1) The rainfall data is first represented in symbolic representation (2) Then numbers of events are detected by applying sliding window for segmentation and CBR for classification. (3)Finally the processed rain fall data is passed through mining phase. Frequent algorithm is used to discover frequent episodes with fixed width. The experiment shows that many frequent episodes with different structure in different years are extracted.","PeriodicalId":330241,"journal":{"name":"2012 4th Conference on Data Mining and Optimization (DMO)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Discovering frequent serial episodes in symbolic sequences for rainfall dataset\",\"authors\":\"A. Ahmed, A. Bakar, A. Hamdan, Sharifah Mastura Syed Abdullah, O. Jaafar\",\"doi\":\"10.1109/DMO.2012.6329809\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Serial episode is a type of temporal frequent pattern in time series. Many different algorithms have been proposed to discover different types of episodes for different applications. In this paper we propose an algorithm for discovering frequent episodes from processed rain fall data. The algorithm is based on three main steps. (1) The rainfall data is first represented in symbolic representation (2) Then numbers of events are detected by applying sliding window for segmentation and CBR for classification. (3)Finally the processed rain fall data is passed through mining phase. Frequent algorithm is used to discover frequent episodes with fixed width. The experiment shows that many frequent episodes with different structure in different years are extracted.\",\"PeriodicalId\":330241,\"journal\":{\"name\":\"2012 4th Conference on Data Mining and Optimization (DMO)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 4th Conference on Data Mining and Optimization (DMO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMO.2012.6329809\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 4th Conference on Data Mining and Optimization (DMO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMO.2012.6329809","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

连续事件是时间序列中的一种时间频繁模式。针对不同的应用,人们提出了许多不同的算法来发现不同类型的剧集。本文提出了一种从处理过的降雨数据中发现频繁事件的算法。该算法基于三个主要步骤。(1)首先对降雨数据进行符号表示;(2)然后采用滑动窗口分割和CBR分类的方法检测事件数。(3)最后将处理后的降雨量数据通过挖掘阶段。频繁算法用于发现固定宽度的频繁事件。实验表明,该方法提取出了不同年份、不同结构的频繁事件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Discovering frequent serial episodes in symbolic sequences for rainfall dataset
Serial episode is a type of temporal frequent pattern in time series. Many different algorithms have been proposed to discover different types of episodes for different applications. In this paper we propose an algorithm for discovering frequent episodes from processed rain fall data. The algorithm is based on three main steps. (1) The rainfall data is first represented in symbolic representation (2) Then numbers of events are detected by applying sliding window for segmentation and CBR for classification. (3)Finally the processed rain fall data is passed through mining phase. Frequent algorithm is used to discover frequent episodes with fixed width. The experiment shows that many frequent episodes with different structure in different years are extracted.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信