Partition-Based Approach for Fast Mining of Transitional Patterns

Abstract

Studying the dynamic behaviour of patterns whose frequency changes over time is of recent interest. Such patterns are named as transitional patterns [1] and were found only upon mining the frequent patterns in a transaction database. In this paper, a partition-based algorithm is proposed to find a variation of transitional patterns. Our approach do not require a set of frequent patterns mined over the database to initiate the process of finding transitional patterns and thus reduces the number of scans over the database. In [1] the range of T ξ was fixed, whereas we expressed it in terms of support so as it varies with the sizes of the databases and minimum pattern support value.