IMTAR: Incremental Mining of General Temporal Association Rules

Abstract

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.

Optimized Incremental Mining of Customer Buying Behavior using Temporal Association Rules

“…Dafa-Alla et al [11] introduced algorithm IMTAR for incremental mining of TARs using TFP-tree (Total from Partial tree). Fouad et al [23] suggested an incremental temporal association rules mining algorithm called IndxTAR.…”

“…In dynamic and time-series databases, the size of the database grows as time progresses. The incremental updating procedure is developed to perform maintenance (insertion, deletion, and update) of the patterns and rules without mining the complete updated database from scratch [9][10][11]. Traditional algorithms consider all previous transactions to discover future patterns.…”

Impact of Sybil and Wormhole Attacks in Location Based Geographic Multicast Routing Protocol for Wireless Sensor Networks

“…Murugam and Shanmugam (2010) have suggested a cumulative isolation technique to detect MAC and routing attacks in mobile ad hoc networks. Sharif and Ahmed (2010) have found that the existing routing protocols were more inefficient against a wormhole attack on the WSN. In the previous work (Shyamala and Valli, 2009) a TESLA based secure route discovery is suggested for MAODV.…”