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

• 영문명: Elastic Rule Discovering in Sequence Databases
• 발행기관: 강원대학교 산업기술연구소
• 저자명: 박상현(Park Sang Hyun) 김상욱(Kim Sang Wook) 김만순(Kim Man Soon)
• 간행물 정보: 『산업기술연구』vol.21, 147~153쪽, 전체 7쪽
• 주제분류: 공학 > 공학일반
• 파일형태: PDF
• 발행일자: 2001.09.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.

목차

Abstract

1. 서론

2. 연구 배경

3. 규칙 탐사 방법

4. 완전 일치 규칙 매칭 방법

5. 완화 규칙 매칭 방법

6. 성능 평가

7. 결론

참고문헌

키워드

시퀀스 데이터베이스 유연규칙의 탐사 sequence database discovering elastic rules