Discovering frequent serial episodes in symbolic sequences for rainfall dataset

Almahdi Ahmed, Azuraliza Abu Bakar, Abdul Razak Hamdan, Sharifah Mastura Syed Abdullah, Othman Jaafar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationConference on Data Mining and Optimization
Pages121-126
Number of pages6
DOIs
Publication statusPublished - 2012
Event2012 4th Conference on Data Mining and Optimization, DMO 2012 - Langkawi
Duration: 2 Sep 20124 Sep 2012

Other

Other2012 4th Conference on Data Mining and Optimization, DMO 2012
CityLangkawi
Period2/9/124/9/12

Fingerprint

Rain
Time series
Experiments

Keywords

  • frequent episodes
  • serial episodes
  • time series

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Ahmed, A., Abu Bakar, A., Hamdan, A. R., Syed Abdullah, S. M., & Jaafar, O. (2012). Discovering frequent serial episodes in symbolic sequences for rainfall dataset. In Conference on Data Mining and Optimization (pp. 121-126). [6329809] https://doi.org/10.1109/DMO.2012.6329809

Discovering frequent serial episodes in symbolic sequences for rainfall dataset. / Ahmed, Almahdi; Abu Bakar, Azuraliza; Hamdan, Abdul Razak; Syed Abdullah, Sharifah Mastura; Jaafar, Othman.

Conference on Data Mining and Optimization. 2012. p. 121-126 6329809.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ahmed, A, Abu Bakar, A, Hamdan, AR, Syed Abdullah, SM & Jaafar, O 2012, Discovering frequent serial episodes in symbolic sequences for rainfall dataset. in Conference on Data Mining and Optimization., 6329809, pp. 121-126, 2012 4th Conference on Data Mining and Optimization, DMO 2012, Langkawi, 2/9/12. https://doi.org/10.1109/DMO.2012.6329809
Ahmed A, Abu Bakar A, Hamdan AR, Syed Abdullah SM, Jaafar O. Discovering frequent serial episodes in symbolic sequences for rainfall dataset. In Conference on Data Mining and Optimization. 2012. p. 121-126. 6329809 https://doi.org/10.1109/DMO.2012.6329809
Ahmed, Almahdi ; Abu Bakar, Azuraliza ; Hamdan, Abdul Razak ; Syed Abdullah, Sharifah Mastura ; Jaafar, Othman. / Discovering frequent serial episodes in symbolic sequences for rainfall dataset. Conference on Data Mining and Optimization. 2012. pp. 121-126
@inproceedings{1026fe9dfa1346158d48ae547dc80681,
title = "Discovering frequent serial episodes in symbolic sequences for rainfall dataset",
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.",
keywords = "frequent episodes, serial episodes, time series",
author = "Almahdi Ahmed and {Abu Bakar}, Azuraliza and Hamdan, {Abdul Razak} and {Syed Abdullah}, {Sharifah Mastura} and Othman Jaafar",
year = "2012",
doi = "10.1109/DMO.2012.6329809",
language = "English",
isbn = "9781467327183",
pages = "121--126",
booktitle = "Conference on Data Mining and Optimization",

}

TY - GEN

T1 - Discovering frequent serial episodes in symbolic sequences for rainfall dataset

AU - Ahmed, Almahdi

AU - Abu Bakar, Azuraliza

AU - Hamdan, Abdul Razak

AU - Syed Abdullah, Sharifah Mastura

AU - Jaafar, Othman

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - frequent episodes

KW - serial episodes

KW - time series

UR - http://www.scopus.com/inward/record.url?scp=84869464327&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84869464327&partnerID=8YFLogxK

U2 - 10.1109/DMO.2012.6329809

DO - 10.1109/DMO.2012.6329809

M3 - Conference contribution

AN - SCOPUS:84869464327

SN - 9781467327183

SP - 121

EP - 126

BT - Conference on Data Mining and Optimization

ER -