상세정보
학술지
WIS : Weighted Interesting Sequential Pattern Mining with a Similar Level of Support and/or Weight
- 저자
- 윤은일
- 발행일
- 200706
- 출처
- ETRI Journal, v.29 no.3, pp.336-352
- ISSN
- 1225-6463
- 출판사
- 한국전자통신연구원 (ETRI)
- 협약과제
- 07MD2500, VDMS(Vehicle & Driver Management System) 기술 개발, 김현숙
- 초록
- Sequential pattern mining has become an essential task with broad applications. Most sequential pattern mining algorithms use a minimum support threshold to prune the combinatorial search space. This strategy provides basic pruning; however, it cannot mine correlated sequential patterns with similar support and/or weight levels. If the minimum support is low, many spurious patterns having items with different support levels are found; if the minimum support is high, meaningful sequential patterns with low support levels may be missed. We present a new algorithm, weighted interesting sequential (WIS) pattern mining based on a pattern growth method in which new measures, sequential s-confidence and w-confidence, are suggested. Using these measures, weighted interesting sequential patterns with similar levels of support and/or weight are mined. The WIS algorithm gives a balance between the measures of support and weight, and considers correlation between items within sequential patterns. A performance analysis shows that WIS is efficient and scalable in weighted sequential pattern mining.
- KSP 제안 키워드
- Combinatorial Search, Growth method, Low support, Pattern growth, Performance analysis, Search Space, Sequential pattern mining, minimum support threshold, mining algorithm, new algorithm