Efficient Mining of Non-Redundant Periodic Frequent Patterns

Periodic frequent patterns are frequent patterns which occur at periodic intervals in databases. They are useful in decision making where event occurrence intervals are vital. Traditional algorithms for discovering periodic frequent patterns, however, often report a large number of such patterns, most of which are often redundant as their periodic occurrences can be derived from other periodic frequent patterns. Using such redundant periodic frequent patterns in decision making would often be detrimental, if not trivial. This paper addresses the challenge of eliminating redundant periodic frequent patterns by employing the concept of deduction rules in mining and reporting only the set of non-redundant periodic frequent patterns. It subsequently proposes and develops a Non-redundant Periodic Frequent Pattern Miner (NPFPM) to achieve this purpose. Experimental analysis on benchmark datasets shows that NPFPM is efficient and can effectively prune the set of redundant periodic frequent patterns.

Automated summary

This paper discusses the issue of redundant periodic frequent patterns in databases and proposes a Non-redundant Periodic Frequent Pattern Miner (NPFPM) to eliminate such redundancy and report only non-redundant patterns. Experimental analysis shows that NPFPM is efficient in pruning the set of redundant periodic frequent patterns.