An Efficient Mining for Closed Frequent Sequences

효율적인 닫힌 빈발 시퀀스 마이닝

  • 김형근 (강원대학교 컴퓨터정보통신공학과) ;
  • 황환규 (강원대학교 컴퓨터정보통신공학과)
  • Published : 2005.02.28

Abstract

Recent sequential pattern mining algorithms mine all of the frequent sequences satisfying a minimum support threshold in a large database. However, when a frequent sequence becomes very long, such mining will generate an explosive number of frequent sequence, which is prohibitively expensive in time. In this paper, we proposed a novel sequential pattern algorithm using only closed frequent sequences which are small subset of very large frequent sequences. Our algorithm extends the sequence by depth-first search strategy with effective pruning. Using bitmap representation of underlying databases, we can obtain a closed frequent sequence considerably faster than the currently reported methods.

Keywords