Abstract
High utility pattern mining in transaction databases has emerged to overcome the limitation of frequent pattern mining where only frequency is taken as the measure of importance without considering the actual importance of items. Among existing state-of-the-art algorithms, some are efficient on sparse datasets and some are efficient on dense datasets. In this paper, we propose a novel algorithm called DMHUPS in conjunction with a data structure called IUData List to efficiently mine high utility patterns on both sparse and dense datasets. IUData List stores information of length-1 itemsets along with their positions in the transactions to efficiently obtain the initial projected database. In addition, DMHUPS algorithm simultaneously calculates utility and tighter extension upper-bound values for multiple promising candidates. Therefore, DMHUPS finds multiple high utility patterns simultaneously and prunes the search space efficiently. Experimental results on various sparse and dense datasets show that DMHUPS is more efficient than other state-of-the-art algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large data bases, VLDB, vol 1215, pp 487–499
Ahmed CF, Tanbeer SK, Jeong BS, Choi HJ (2012) Interactive mining of high utility patterns over data streams. Expert Syst Appl 39(15):11,979–11,991
Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708–1721
Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: Third IEEE international conference on data mining, pp 19–26
Dawar S, Goyal V (2014) Up-hist tree: an efficient data structure for mining high utility patterns from transaction databases. In: Proceedings of the 19th international database engineering and applications symposium, IDEAS ’15, pp 56–61. ACM
Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu CW, Tseng VS (2014) Spmf: a java open-source pattern mining library. J Mach Learn Res 15(1):3389–3393
Fournier-Viger P, Wu CW, Zida S, Tseng VS (2014) FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Foundations of intelligent systems, pp 83–92. Springer
Krishnamoorthy S (2015) Pruning strategies for mining high utility itemsets. Expert Syst Appl 42(5):2371–2381
Li HF, Huang HY, Chen YC, Liu YJ, Lee SY (2008) Fast and memory efficient mining of high utility itemsets in data streams. In: 2008 eighth IEEE international conference on data mining, pp 881–886
Lin JCW, Gan W, Hong TP, Pan JS (2014) Incrementally updating high-utility itemsets with transaction insertion. In: Advanced data mining and applications, pp 44–56. Springer
Liu J, Wang K, Fung BCM (2012) Direct discovery of high utility itemsets without candidate generation. In: 2012 IEEE 12th international conference on data mining, pp 984–989
Liu J, Wang K, Fung BCM (2016) Mining high utility patterns in one phase without generating candidates. IEEE Trans Knowl Data Eng 28(5):1245–1257
Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM international conference on information and knowledge management, CIKM ’12, pp 55–64. ACM
Liu Y, Liao WK, Choudhary A (2005) A fast high utility itemsets mining algorithm. In: Proceedings of the 1st international workshop on Utility-based data mining, pp 90–99. ACM
Pisharath J, Liu Y, Ozisikyilmaz B, Narayanan R, Liao W, Choudhary A, Memik G (2013) Nu-minebench version 2.0 dataset and technical report
Ryang H, Yun U (2016) High utility pattern mining over data streams with sliding window technique. Expert Syst Appl 57:214–231
Sahoo J, Das AK, Goswami A (2015) An efficient approach for mining association rules from high utility itemsets. Expert Syst Appl 42(13):5754–5778
Shie BE, Hsiao HF, Tseng VS, Yu PS (2011) Mining high utility mobile sequential patterns in mobile commerce environments. In: International conference on database systems for advanced applications, pp 224–238. Springer
Tseng VS, Shie BE, Wu CW, Yu PS (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772–1786
Tseng VS, Wu CW, Fournier-Viger P, Yu PS (2015) Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans Knowl Data Eng 27(3):726–739
Tseng VS, Wu CW, Fournier-Viger P, Yu PS (2016) Efficient algorithms for mining top-k high utility itemsets. IEEE Trans Knowl Data Eng 28(1):54–67
Tseng VS, Wu CW, Shie BE, Yu PS (2010) Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’10, pp 253–262. ACM
Wu CW, Shie BE, Tseng VS, Yu PS (2012) Mining top-k high utility itemsets. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 78–86. ACM
Yun U, Ryang H (2015) Incremental high utility pattern mining with static and dynamic databases. Appl Intell 42(2):323–352
Yun U, Ryang H, Ryu KH (2014) High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst Appl 41(8):3861–3878
Zida S, Fournier-Viger P, Lin JCW, Wu CW, Tseng VS (2015) EFIM: a highly efficient algorithm for high-utility itemset mining. In: Advances in artificial intelligence and soft computing, pp 530–546. Springer
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jaysawal, B.P., Huang, JW. DMHUPS: Discovering Multiple High Utility Patterns Simultaneously. Knowl Inf Syst 59, 337–359 (2019). https://doi.org/10.1007/s10115-018-1207-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-018-1207-9