Abstract
Periodic frequent pattern mining, the process of finding frequent patterns which occur periodically in databases, is an important data mining task for various decision making. Though several algorithms have been proposed for their discovery, most employ a two stage process to evaluate the periodicity of patterns. That is, by firstly deriving the set of periods of a pattern from its coverset, and subsequently evaluating the periodicity from the derived set of periods. This two step process thus make algorithms for discovering periodic frequent patterns both time and memory inefficient in the discovery process. In this paper, we present solutions to reduce both runtime and memory consumption in periodic frequent pattern mining. We achieve this by evaluating the periodicity of patterns without deriving the set of periods from their coversets. Our experimental results show that our proposed solutions are efficient both in reducing the runtime and memory consumption in the discovery of periodic frequent patterns.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Rec. 22(2), 207–216 (1993)
Fournier-Viger, P., et al.: The SPMF open-source data mining library version 2. In: Proceedings of European Conference on Machine Learning and Knowledge Discovery in Databases 2016. Springer International Publishing (2016)
Fournier-Viger, P., Lin, C.W., Duong, Q.H., Dam, T.L., Ševčík, L., Uhrin, D., Voznak, M.: PFPM: discovering periodic frequent patterns with novel periodicity measures. In: Proceedings of the 2nd Czech-China Scientific Conference 2017. InTech (2017)
Jian, P., Jiawei, H., Hongjun, L., Shojiro, N., Shiwei, T., Dongqing, Y.: H-Mine: fast and space-preserving frequent pattern mining in large databases. IIE Trans. 39(6), 593–605 (2007)
Kiran, R.U., Kitsuregawa, M.: Discovering quasi-periodic-frequent patterns in transactional databases. In: Bhatnagar, V., Srinivasa, S. (eds.) BDA 2013. LNCS, vol. 8302, pp. 97–115. Springer International Publishing (2013)
Kiran, R.U., Kitsuregawa, M.: Novel techniques to reduce search space in periodic-frequent pattern mining. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds.) DASFAA 2014. LNCS, vol. 8422, pp. 377–391. Springer International Publishing (2014)
Kiran, R.U., Reddy, P.K.: Towards efficient mining of periodic-frequent patterns in transactional databases. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DASFAA 2010. LNCS, vol. 6262, pp. 194–208. Springer, Heidelberg (2010)
Kiran, R.U., Reddy, P.K.: An alternative interestingness measure for mining periodic-frequent patterns. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011. LNCS, vol. 6587, pp. 183–192. Springer, Heidelberg (2011)
Kumar, V., Valli Kumari, V.: Incremental mining for regular frequent patterns in vertical format. Int. J. Eng. Tech. 5(2), 1506–1511 (2013)
Lin, J.C.W., Zhang, J., Fournier-Viger, P., Hong, T.P., Zhang, J.: A two-phase approach to mine short-period high-utility itemsets in transactional databases. Adv. Eng. Inf. 33, 29–43 (2017)
Nofong, V.M.: Discovering productive periodic frequent patterns in transactional databases. Ann. Data Sci. 3(3), 235–249 (2016)
Rashid, M.M., Gondal, I., Kamruzzaman, J.: Regularly frequent patterns mining from sensor data stream. In: Lee, M., Hirose, A., Hou, Z.G., Kil, R. (eds.) NIP 2013. LNCS, vol. 8227, pp. 417–424. Springer, Heidelberg (2013)
Rashid, M.M., Karim, M.R., Jeong, B.S., Choi, H.J.: Efficient mining regularly frequent patterns in transactional databases. In: Lee, S., Peng, Z., Zhou, X., Moon, Y., Unland, R., Yoo, J. (eds.) DASFAA 2012. LNCS, vol. 7238, pp. 258–271. Springer, Heidelberg (2012)
Surana, A., Kiran, R.U., Reddy, P.K.: An efficient approach to mine periodic-frequent patterns in transactional databases. In: Cao, L., Huang, J.Z., Bailey, J., Koh, Y.S., Luo, J. (eds.) PAKDD 2011 Workshops. LNAI, vol. 7104, pp. 254–266. Springer, Heidelberg (2012)
Tanbeer, S.K., Ahmed, C.F., Jeong, B.S., Lee, Y.K.: Discovering periodic-frequent patterns in transactional databases. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T. (eds.) PAKDD 2009. LNAI, vol. 5476, pp. 242–253. Springer, Heidelberg (2009)
Webb, G.I.: Self-sufficient itemsets: an approach to screening potentially interesting associations between items. ACM Trans. Knowl. Discov. Data 4(1), 3:1–3:20 (2010)
Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 326–335 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Nofong, V.M. (2018). Fast and Memory Efficient Mining of Periodic Frequent Patterns. In: Sieminski, A., Kozierkiewicz, A., Nunez, M., Ha, Q. (eds) Modern Approaches for Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 769. Springer, Cham. https://doi.org/10.1007/978-3-319-76081-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-76081-0_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76080-3
Online ISBN: 978-3-319-76081-0
eBook Packages: EngineeringEngineering (R0)