다중 해시함수 기반 데이터 스트림에서의 아이템 의사 주기 탐사 기법

• 영문명: Finding Pseudo Periods over Data Streams based on Multiple Hash Functions
• 발행기관: 한국IT서비스학회
• 저자명: 이학주(Hak Joo Lee) 김재완(Jae Wan Kim) 이원석(Won Suk Lee)
• 간행물 정보: 『한국IT서비스학회지』한국IT서비스학회지 제16권 제1호, 73~82쪽, 전체 10쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2017.03.30

영문 초록

Recently in-memory data stream processing has been actively applied to various subjects such as query processing, OLAP, data mining, i.e., frequent item sets, association rules, clustering. However, finding regular periodic patterns of events in an infinite data stream gets less attention. Most researches about finding periods use autocorrelation functions to find certain changes in periodic patterns, not period itself. And they usually find periodic patterns in time-series databases, not in data streams. Literally a period means the length or era of time that some phenomenon recur in a certain time interval. However in real applications a data set indeed evolves with tiny differences as time elapses. This kind of a period is called as a pseudo-period. This paper proposes a new scheme called FPMH (Finding Periods using Multiple Hash functions) algorithm to find such a set of pseudo-periods over a data stream based on multiple hash functions. According to the type of pseudo period, this paper categorizes FPMH into three, FPMH-E, FPMH-PC, FPMH-PP. To maximize the performance of the algorithm in the data stream environment and to keep most recent periodic patterns in memory, we applied decay mechanism to FPMH algorithms. FPMH algorithm minimizes the usage of memory as well as processing time with acceptable accuracy.

목차

1. 서 론

2. 관련 연구

3. 다중 해시함수 기반 주기 탐색 기법

4. 성능 평가

5. 결 론

References

키워드

Data Stream Period Multiple Hash Function