Extracting non-redundant correlated purchase behaviors by utility measure

Frequent itemset mining dataset repository, http://fimi.ua.ac.be/data/. Agrawal, 1993, Database mining: a performance perspective, IEEE Trans. Knowl. Data Eng., 5, 914, 10.1109/69.250074 Agrawal, 1994, Fast algorithms for mining association rules in large databases, 487 R. Agrawal, R. Srikant, Quest synthetic data generator, http://www.Almaden.ibm.com/cs/quest/syndata.html. Microsoft. Example database foodmart of microsoft analysis services, http://www.Almaden.ibm.com/cs/quest/syndata.html. Ahmed, 2009, Efficient tree structures for high utility pattern mining in incremental databases, IEEE Trans.Knowl. Data Eng., 21, 1708, 10.1109/TKDE.2009.46 Ahmed, 2011, A framework for mining interesting high utility patterns with a strong frequency affinity, Inf. Sci., 181, 4878, 10.1016/j.ins.2011.05.012 Chan, 2003, Mining high utility itemsets, 19 Kulczynski, 1928 Gan, 2017, Extracting non-redundant correlated purchase behaviors by utility measure, 433 Gan, 2017, Data mining in distributed environment: a survey, Interdiscip. Rev. Data Min. Knowl. Discovery, 7, 1 Gan, 2017, Mining of frequent patterns with multiple minimum supports, Eng. Appl. Artif. Intell., 60, 83, 10.1016/j.engappai.2017.01.009 Geng, 2006, Interestingness measures for data mining: a survey, ACM Comput. Surv., 38, 10.1145/1132960.1132963 Han, 2004, Mining frequent patterns without candidate generation: a frequent-pattern tree approach, Data Min. Knowl. Discovery, 8, 53, 10.1023/B:DAMI.0000005258.31418.83 Han, 2001, Prefixspan: mining sequential patterns efficiently by prefix-projected pattern, 215 Hong, 2009, Mining high average-utility itemsets, 2526 Fournier-Viger, 2016, The SPMF open-source data mining library version 2, 36 Fournier-Viger, 2014, FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning, 83 Fournier-Viger, 2017, A survey of itemset mining, Wiley Interdiscip. Rev. Data Min. Knowl. Discovery, 7 Kim, 2004, CCMine: efficient mining of confidence-closed correlated patterns, 569 Kim, 2016, Efficient mining of high utility pattern with considering of rarity and length, Appl. Intell., 45, 152, 10.1007/s10489-015-0750-2 Krishnamoorthy, 2015, Pruning strategies for mining high utility itemsets, Expert Syst. Appl., 42, 2371, 10.1016/j.eswa.2014.11.001 Lan, 2011, Discovery of high utility itemsets from on-shelf time periods of products, Expert Syst. Appl., 38, 5851, 10.1016/j.eswa.2010.11.040 Lan, 2013, An efficient projection-based indexing approach for mining high utility itemsets, Knowl. Inf. Syst., 38, 85, 10.1007/s10115-012-0492-y Lin, 2016, Efficient algorithms for mining high-utility itemsets in uncertain databases, Knowl. Based Syst., 96, 171, 10.1016/j.knosys.2015.12.019 Lin, 2015, Efficient algorithms for mining up-to-date high-utility patterns, Adv. Eng. Inf., 29, 648, 10.1016/j.aei.2015.06.002 Lin, 2015, A fast updated algorithm to maintain the discovered high-utility itemsets for transaction modification, Adv. Eng. Inf., 29, 562, 10.1016/j.aei.2015.05.003 Lin, 2017, FDHUP: fast algorithm for mining discriminative high utility patterns, Knowl. Inf. Syst., 51, 873, 10.1007/s10115-016-0991-3 Lin, 2016, Fast algorithms for mining high-utility itemsets with various discount strategies, Adv. Eng. Inf., 30, 109, 10.1016/j.aei.2016.02.003 Lin, 2016, Efficient mining of high-utility itemsets using multiple minimum utility thresholds, Knowl. Based Syst., 113, 100, 10.1016/j.knosys.2016.09.013 Lin, 2016, FHN: an efficient algorithm for mining high-utility itemsets with negative unit profits, Knowl. Based Syst., 111, 283, 10.1016/j.knosys.2016.08.022 Lin, 2015, Mining high utility itemsets in big data, Adv. Knowl. Discovery Data Min., 649, 10.1007/978-3-319-18032-8_51 Liu, 2012, Mining high utility itemsets without candidate generation, 55 Liu, 2005, A two-phase algorithm for fast discovery of high utility itemsets, 689 Liu, 2012, Direct discovery of high utility itemsets without candidate generation, 984 Mai, 2017, A lattice-based approach for mining high utility association rules, Inf. Sci., 399, 81, 10.1016/j.ins.2017.02.058 Omiecinski, 2003, Alternative interest measures for mining associations in databases, IEEE Trans. Knowl. Data Eng., 15, 57, 10.1109/TKDE.2003.1161582 Ryang, 2016, Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques, Knowl. Inf. Syst., 51, 627, 10.1007/s10115-016-0989-x Tan, 2002, Selecting the right interestingness measure for association patterns, 32 Tseng, 2010, UP-growth: an efficient algorithm for high utility itemset mining, 253 Tseng, 2013, Efficient algorithms for mining high utility itemsets from transactional databases, IEEE Trans. Knowl. Data Eng., 25, 1772, 10.1109/TKDE.2012.59 Tseng, 2016, Efficient algorithms for mining top-k high utility itemsets, IEEE Trans. Knowl. Data Eng., 28, 54, 10.1109/TKDE.2015.2458860 Wu, 2010, Re-examination of interestingness measures in pattern mining: a unified framework, Data Min. Knowl. Discovery, 21, 371, 10.1007/s10618-009-0161-2 Yao, 2004, A foundational approach to mining itemset utilities from databases, 211 Zida, 2015, EFIM: a highly efficient algorithm for high-utility itemset mining, Adv. Artif. Intell. Soft Comput., 530, 10.1007/978-3-319-27060-9_44