• Title/Summary/Keyword: Incremental TFP-Tree

Search Result 3, Processing Time 0.02 seconds

TFP tree-based Incremental Emerging Patterns Mining for Analysis of Safe and Non-safe Power Load Lines (Safe와 Non-safe 전력 부하 라인 분석을 위한 TFP트리 기반의 점진적 출현패턴 마이닝)

  • Lee, Jong-Bum;Piao, Ming Hao;Ryu, Keun-Ho
    • Spatial Information Research
    • /
    • v.19 no.2
    • /
    • pp.71-76
    • /
    • 2011
  • In this paper, for using emerging patterns to define and analyze the significant difference of safe and non-safe power load lines, and identify which line is potentially non-safe, we proposed an incremental TFP-tree algorithm for mining emerging patterns that can search efficiently within limitation of memory. Especially, the concept of pre-infrequent patterns pruning and use of two different minimum supports, made the algorithm possible to mine most emerging patterns and handle the problem of mining from incrementally increased, large size of data sets such as power consumption data.

IMTAR: Incremental Mining of General Temporal Association Rules

  • Dafa-Alla, Anour F.A.;Shon, Ho-Sun;Saeed, Khalid E.K.;Piao, Minghao;Yun, Un-Il;Cheoi, Kyung-Joo;Ryu, Keun-Ho
    • Journal of Information Processing Systems
    • /
    • v.6 no.2
    • /
    • pp.163-176
    • /
    • 2010
  • Nowadays due to the rapid advances in the field of information systems, transactional databases are being updated regularly and/or periodically. The knowledge discovered from these databases has to be maintained, and an incremental updating technique needs to be developed for maintaining the discovered association rules from these databases. The concept of Temporal Association Rules has been introduced to solve the problem of handling time series by including time expressions into association rules. In this paper we introduce a novel algorithm for Incremental Mining of General Temporal Association Rules (IMTAR) using an extended TFP-tree. The main benefits introduced by our algorithm are that it offers significant advantages in terms of storage and running time and it can handle the problem of mining general temporal association rules in incremental databases by building TFP-trees incrementally. It can be utilized and applied to real life application domains. We demonstrate our algorithm and its advantages in this paper.

TFP-tree based Incremental Frequent Patterns mining Method for Handling Large Data Set (대용량 데이터를 처리하기 위한 TFP-tree 기반의 점진적 빈발 패턴 마이닝 기법)

  • Lee, Jong Bum;Piao, Minghao;Shin, Jin-ho;Ryu, Keun Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.761-762
    • /
    • 2009
  • 이 논문에서는 점진적 마이닝 기법을 사용하여 대용량 전력 사용량 데이터로부터 빈발 패턴들을 찾아내고, 빈발 패턴들을 기반으로 하여 분류 작업을 효과적으로 완성하는데 목적을 두고 있다. 이를 위하여 본 논문에서는 TFP-tree를 기반으로 하는 점진적 빈발 패턴 마이닝 기법 및 분류 알고리즘에 대해서 설명한다.