원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.5 No.2
2012.04
pp.187-192
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Research on periodic pattern mining has gained a great attention in the past decade.
Periodic pattern mining discovers valid periodic patterns in a time-related dataset. This study
proposed an efficient 2-D linked structure and the OEOP (One Event One Pattern) algorithm
to discover all kinds of valid segments in each single event sequence. Then, this study
combines these valid segments found by OEOP into 1-patterns with multiple events, and
multiple patterns with multiple events periodic patterns. The experimental results show that
the proposed algorithm has good performance and scalability.
목차
Abstract
1. Introduction
2. Notations and Definitions
3. Proposed Data Structures and Algorithms
3.1. Proposed Process for Periodic Pattern Mining
3.2. The linked Data Structures
3.3. OEOP (One Event One Pattern Mining) Algorithm
4. Experimental Results
4.1 Datasets
4.2. Numbers of valid segments and sub-sequences
4.3. OEOP Results
5. Conclusions
Acknowledgements
References
1. Introduction
2. Notations and Definitions
3. Proposed Data Structures and Algorithms
3.1. Proposed Process for Periodic Pattern Mining
3.2. The linked Data Structures
3.3. OEOP (One Event One Pattern Mining) Algorithm
4. Experimental Results
4.1 Datasets
4.2. Numbers of valid segments and sub-sequences
4.3. OEOP Results
5. Conclusions
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보