Partial periodic patterns mining with multiple minimum supports

Kung Jiuan Yang, Guo Cheng Lan, Tzung Pei Hong, Yuh-Min Chen

Research output: Contribution to conferencePaper

Abstract

Partial periodic patterns are commonly seen in real-world applications. Most of the previous approaches set a single minimum support threshold for all the events in a sequence. However using only one minimum support for all events in an event sequence to assume they have similar frequencies is not easy to happen in real-life applications. In this paper, we propose an algorithm which applies the projection-based mechanism and specifies multiple minimum supports to effectively discover appropriate partial periodic patterns. Finally, the experimental result shows the good performance of the proposed approach.

Original languageEnglish
DOIs
Publication statusPublished - 2013 Jan 1
Event9th International Conference on Information, Communications and Signal Processing, ICICS 2013 - Tainan, Taiwan
Duration: 2013 Dec 102013 Dec 13

Other

Other9th International Conference on Information, Communications and Signal Processing, ICICS 2013
CountryTaiwan
CityTainan
Period13-12-1013-12-13

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Cite this

Yang, K. J., Lan, G. C., Hong, T. P., & Chen, Y-M. (2013). Partial periodic patterns mining with multiple minimum supports. Paper presented at 9th International Conference on Information, Communications and Signal Processing, ICICS 2013, Tainan, Taiwan. https://doi.org/10.1109/ICICS.2013.6782910
Yang, Kung Jiuan ; Lan, Guo Cheng ; Hong, Tzung Pei ; Chen, Yuh-Min. / Partial periodic patterns mining with multiple minimum supports. Paper presented at 9th International Conference on Information, Communications and Signal Processing, ICICS 2013, Tainan, Taiwan.
@conference{092fa266cafd4d9d919edb27798fa71f,
title = "Partial periodic patterns mining with multiple minimum supports",
abstract = "Partial periodic patterns are commonly seen in real-world applications. Most of the previous approaches set a single minimum support threshold for all the events in a sequence. However using only one minimum support for all events in an event sequence to assume they have similar frequencies is not easy to happen in real-life applications. In this paper, we propose an algorithm which applies the projection-based mechanism and specifies multiple minimum supports to effectively discover appropriate partial periodic patterns. Finally, the experimental result shows the good performance of the proposed approach.",
author = "Yang, {Kung Jiuan} and Lan, {Guo Cheng} and Hong, {Tzung Pei} and Yuh-Min Chen",
year = "2013",
month = "1",
day = "1",
doi = "10.1109/ICICS.2013.6782910",
language = "English",
note = "9th International Conference on Information, Communications and Signal Processing, ICICS 2013 ; Conference date: 10-12-2013 Through 13-12-2013",

}

Yang, KJ, Lan, GC, Hong, TP & Chen, Y-M 2013, 'Partial periodic patterns mining with multiple minimum supports' Paper presented at 9th International Conference on Information, Communications and Signal Processing, ICICS 2013, Tainan, Taiwan, 13-12-10 - 13-12-13, . https://doi.org/10.1109/ICICS.2013.6782910

Partial periodic patterns mining with multiple minimum supports. / Yang, Kung Jiuan; Lan, Guo Cheng; Hong, Tzung Pei; Chen, Yuh-Min.

2013. Paper presented at 9th International Conference on Information, Communications and Signal Processing, ICICS 2013, Tainan, Taiwan.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Partial periodic patterns mining with multiple minimum supports

AU - Yang, Kung Jiuan

AU - Lan, Guo Cheng

AU - Hong, Tzung Pei

AU - Chen, Yuh-Min

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Partial periodic patterns are commonly seen in real-world applications. Most of the previous approaches set a single minimum support threshold for all the events in a sequence. However using only one minimum support for all events in an event sequence to assume they have similar frequencies is not easy to happen in real-life applications. In this paper, we propose an algorithm which applies the projection-based mechanism and specifies multiple minimum supports to effectively discover appropriate partial periodic patterns. Finally, the experimental result shows the good performance of the proposed approach.

AB - Partial periodic patterns are commonly seen in real-world applications. Most of the previous approaches set a single minimum support threshold for all the events in a sequence. However using only one minimum support for all events in an event sequence to assume they have similar frequencies is not easy to happen in real-life applications. In this paper, we propose an algorithm which applies the projection-based mechanism and specifies multiple minimum supports to effectively discover appropriate partial periodic patterns. Finally, the experimental result shows the good performance of the proposed approach.

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

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

U2 - 10.1109/ICICS.2013.6782910

DO - 10.1109/ICICS.2013.6782910

M3 - Paper

AN - SCOPUS:84899087019

ER -

Yang KJ, Lan GC, Hong TP, Chen Y-M. Partial periodic patterns mining with multiple minimum supports. 2013. Paper presented at 9th International Conference on Information, Communications and Signal Processing, ICICS 2013, Tainan, Taiwan. https://doi.org/10.1109/ICICS.2013.6782910