Various types of data structures and algorithms have been proposed to extract frequently occurring patterns from a given data set. In particular, several tree structures have been devised to represent the input data set for efficient pattern discovery. One of the fastest frequent pattern mining algorithms known to date is the CATS algorithm, which can efficiently represent the whole data set and allow mining with a single scan over the database. In this paper, we propose an efficient tree structure and its associated algorithm that provides a considerable performance improvement over CATS in terms of memory usage and processing time. We have demonstrated the effectiveness of our algorithm and performance improvement over the existing approach by a series of experiments.
목차
Abstract 1. Introduction 2. Related Work 3. The Construction Algorithm for a Conditional Condensed Tree 4. Experimental Results 5. Conclusion Acknowledgements References
키워드
frequent itemsetpattern discoverytree structure
저자
Byung Joon Park [ Department of Computer Science, Kwangwoon University, Seoul, Korea ]
보안공학연구지원센터(IJMUE) [Science & Engineering Research Support Center, Republic of Korea(IJMUE)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Multimedia and Ubiquitous Engineering
간기
월간
pISSN
1975-0080
수록기간
2008~2016
등재여부
SCOPUS
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Multimedia and Ubiquitous Engineering Vol.7 No2