Using a projection-based approach to mine frequent inter-transaction patterns

In this paper, we propose an algorithm called PITP-Miner that utilizes a projection based approach to mine frequent inter-transaction patterns efficiently. The algorithm only searches for local frequent items in a projected database that stores potential local inter-transaction items and partitions the database into a set of smaller databases recursively. In addition, two pruning strategies are designed to further condense the partitioned databases and thus accelerate the algorithm. Our experiment results demonstrate that the proposed PITP-Miner algorithm outperforms the ITP-Miner and FITI algorithms in most cases.

► An projection-based PITP-Miner algorithm.
► Mine frequent inter-transaction patterns efficiently.
► Two pruning strategies to further condense the partitioned databases.
► PITP-Miner outperforms the ITP-Miner and FITI algorithms in most cases.