Discovering Stable Periodic-Frequent Patterns in Transactional Data

Periodic-frequent patterns are sets of items (values) that periodically appear in a sequence of transactions. The periodicity of a pattern is measured by counting the number of times that its periods (the interval between two successive occurrences of the patterns) are greater than a user-defined maxPer threshold. However, an important limitation of this model is that it can find many patterns having a periodicity that vary widely due to the strict maxPer constraint. But finding stable patterns is desirable for many applications as they are more predictable than unstable patterns. This paper addresses this limitation by proposing to discover a novel type of periodic-frequent patterns in transactional databases, called Stable Periodic-frequent Pattern (SPP), which are patterns having a stable periodicity, and a pattern-growth algorithm named SPP-growth to discover all SPP. An experimental evaluation on four datasets shows that SPP-growth is efficient and can find insightful patterns that are not found by traditional algorithms.