Abstract
High utility itemset mining (HUIM) is a popular and important mining task in recent years. The problem is considered computational expensive in terms of execution time and memory consumption. Many algorithms have been proposed to solve this problem efficiently. In this paper, we propose a parallel approach for mining HUIs, which utilizes the modern multi-core processors by splitting the search space in to disjointed sub-spaces, assign them to the processor cores and explore them in parallel. Experimental results show that the proposed algorithm outperformed the original state-of-the-art HUIM algorithm EFIM in terms of execution times and have comparable memory usage.
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., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994 Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499 (1994)
Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach to mining itemset utilities from databases. In: 3rd SIAM International Conference on Data Mining, pp. 482–486 (2004)
Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: 21st International Symposium on Methodologies of Intelligent Systems, pp. 83–92 (2014)
Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: 21st ACM International Conference on Information and Knowledge Management, pp. 55–64 (2012)
Tseng, V.S., Shie, B.-E., Cheng-Wei, W., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772–1786 (2013)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000 Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas, pp. 1–12 (2000)
Yao, H., Hamilton, H.J.: Mining itemset utilities from transaction databases. Data Knowl. Eng. 59(3), 603–626 (2006)
Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 689–695 (2005)
Ahmed, C.F., Tanbeer, S.K., Jeong, B.-S., Lee, Y.-K.: Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans. Knowl. Data Eng. 21(12), 1708–1721 (2009)
Tseng, V.S., Wu, C.-W., Shie, B.-E., Yu, P.S.: UP-Growth: an efficient algorithm for high utility itemset mining. In: 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 253–262 (2010)
Solihin, Y.: Fundamentals of Parallel Computer Architecture. CRC Press, Boca Raton (2009)
Le, B., Nguyen, H., Cao, T.A., Vo, B.: A novel algorithm for mining high utility itemsets. In: 1st Intelligent Information and Database Systems, pp. 13–17 (2009)
Le, B., Nguyen, H., Vo, B.: An efficient strategy for mining high utility itemsets. Int. J. Intell. Inf. Database Syst. 5(2), 164–176 (2011)
Krishnamoorthy, S.: Pruning strategies for mining high utility itemsets. Expert Syst. Appl. Int. J. 42(5), 2371–2381 (2015)
Zida, S., Fournier-Viger, P., Lin, J.C.-W., Wu, C.-W., Tseng, V.S.: EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl. Inf. Syst. 51(2), 595–625 (2017)
Zaki, M.J.: SPADE: an efficient algorithm for mining frequent sequences. Mach. Learn. 42, 31–60 (2010)
Cong, S., Han, J., Padua, D.: Parallel mining of closed sequential pattern. In: Proceedings of ACM SIGKDD, vol. 5, pp. 562–567 (2005)
Chen, Y., An, A.: Approximate parallel high utility itemset mining. Big Data Res. 6, 26–42 (2016)
Zaki, M.J.: Parallel and distributed association mining: a survey. IEEE Concurr. 7(4), 14–25 (1999)
Fournier-Viger, P., et al.: SPMF: a Java open-source pattern mining library. J. Mach. Learn. Res. 15(1), 3389–3393 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Nguyen, T.D.D., Nguyen, L.T.T., Vo, B. (2019). A Parallel Algorithm for Mining High Utility Itemsets. In: Świątek, J., Borzemski, L., Wilimowska, Z. (eds) Information Systems Architecture and Technology: Proceedings of 39th International Conference on Information Systems Architecture and Technology – ISAT 2018. ISAT 2018. Advances in Intelligent Systems and Computing, vol 853. Springer, Cham. https://doi.org/10.1007/978-3-319-99996-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-99996-8_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99995-1
Online ISBN: 978-3-319-99996-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)