Periodic-frequent patterns are a class of user-interest-based frequent patterns that exist in a transactional database. A frequent pattern can be said periodic-frequent if it appears at a regular user-specified interval in a database. In the literature, an approach has been proposed to extract periodic-frequent patterns that occur periodically throughout the database. However, it is generally difficult for a frequent pattern to appear periodically throughout the database without any interruption in many real-world applications. In this paper, we propose an improved approach by introducing a new interestingness measure to discover periodic-frequent patterns that occur almost periodically in the database. A pattern-growth algorithm has been proposed to discover the complete set of periodic-frequent patterns. Experimental results show that the proposed model is effective.
[1]
Tomasz Imielinski,et al.
Mining association rules between sets of items in large databases
,
1993,
SIGMOD Conference.
[2]
P. Krishna Reddy,et al.
Towards Efficient Mining of Periodic-Frequent Patterns in Transactional Databases
,
2016,
DEXA.
[3]
Jian Pei,et al.
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
,
2006,
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).
[4]
Young-Koo Lee,et al.
Discovering Periodic-Frequent Patterns in Transactional Databases
,
2009,
PAKDD.