Proceedings of the KSRS Conference (대한원격탐사학회:학술대회논문집)
- 2005.10a
- /
- Pages.454-457
- /
- 2005
- /
- 1226-9743(pISSN)
DISCOVERY TEMPORAL FREQUENT PATTERNS USING TFP-TREE
- Jin Long (Dept. of Computer Science, Chungbuk National University) ;
- Lee Yongmi (Dept. of Computer Science, Chungbuk National University) ;
- Seo Sungbo (Dept. of Computer Science, Chungbuk National University) ;
-
Ryu Keun Ho
(Dept. of Computer Science, Chungbuk National University)
- Published : 2005.10.01
Abstract
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. And calendar based on temporal association rules proposes the discovery of association rules along with their temporal patterns in terms of calendar schemas, but this approach is also adopt an Apriori-like candidate set generation. In this paper, we propose an efficient temporal frequent pattern mining using TFP-tree (Temporal Frequent Pattern tree). This approach has three advantages: (1) this method separates many partitions by according to maximum size domain and only scans the transaction once for reducing the I/O cost. (2) This method maintains all of transactions using FP-trees. (3) We only have the FP-trees of I-star pattern and other star pattern nodes only link them step by step for efficient mining and the saving memory. Our performance study shows that the TFP-tree is efficient and scalable for mining, and is about an order of magnitude faster than the Apriori algorithm and also faster than calendar based on temporal frequent pattern mining methods.