시퀀스 데이터베이스에서 유연 규칙의 탐사

Elastic Rule Discovering in Sequence Databases

  • 박상현 (IBM T.J. 왓슨 연구소) ;
  • 김상욱 (강원대학교 컴퓨터정보통신공학부) ;
  • 김만순 (강원대학교 정보통신공학과 대학원)
  • 발행 : 2001.06.30

초록

This paper presents techniques for discovering rules with elastic patterns. Elastic patterns are useful for discovering rules from data sequences with different sampling rates. For fast discovery of rules whose heads and bodies are elastic patterns, we construct a suffix tree from succinct forms of data sequences. The suffix tree is a compact representation of rules, and is also used as an index structure for finding rules matched to a target head sequence. When matched rules cannot be found, the concept of rule relaxation is introduced. Using a cluster hierarchy and a relaxation error, we find the least relaxed rules that provide the most specific information on a target head sequence. Performance evaluation through extensive experiments reseals the effectiveness of the proposed approach.

키워드