Memory efficient mining of periodic-frequent patterns in transactional databases
A Anirudh, R. Uday Kirany, P. Krishna Reddy, Masaru Kitsuregaway · 2016
Periodic-frequent patterns are an important class of regularities which exists in a transactional database. A frequent pattern is called periodic-frequent if it appears at regular intervals in a transactional database. In the literature, a model of periodic-frequent patterns was proposed and pattern growth like approaches to extract patterns are being explored. In these approaches, a periodic-frequent pattern tree is built in which a transaction-id list is maintained at each path's tail-node. As the typical size of transactional database is very huge in the modern e-commerce era, extraction of periodic-frequent patterns by maintaining transaction-ids in the tree requires more memory. In this paper, to reduce the memory requirements, we introduced a notion of period summary by capturing the periodicity of the patterns in a sequence of transaction-ids. While building the tree, the period summary of the transactions is computed and stored at the tail-node of the tree instead of the transaction-ids. We have also proposed a merging framework for period summaries for mining periodic-frequent patterns. The performance could be improved significantly as the memory required to store the period summaries is significantly less than the memory required to store the transaction-id list. Experimental results show that the proposed approach reduces the memory consumption significantly and also improves the runtime efficiency considerably over the existing approaches.