A Survey of Key Technologies for High Utility Patterns Mining

Recently, high utility pattern mining (HUPM) is one of the most important research issues in data mining. Because it can consider the non-binary frequency values of items in a transaction and the different profit values of each item. It has been widely used. First of all, this paper briefly describes the related concepts, formulas and examples of application for HUPM. Secondly, the key technologies for HUMP are introduced in detail, and they are divided into main methods including Apriori-based, tree-based, projection-based, list-based, data format-based, and index-based and so on. The paper further compares data sets, uses, advantages and disadvantages of algorithms, laid the foundation for the next research direction. Then, this article outlines the high utility derivative patterns, including high average utility pattern, high utility sequential pattern, and high utility compact pattern and so on. Because static data is difficult to meet the actual needs, this paper summarizes the efficient use of HUPMs’ methods over data streams, mainly based on incremental methods, based on the sliding window model methods, based on the time decay model methods and based on the landmark model methods and so on.

[1]  Aijun An,et al.  Mining top-k high utility patterns over data streams , 2014, Inf. Sci..

[2]  Philip S. Yu,et al.  HUOPM: High-Utility Occupancy Pattern Mining , 2018, IEEE Transactions on Cybernetics.

[3]  Philip S. Yu,et al.  A Survey of Utility-Oriented Pattern Mining , 2018, IEEE Transactions on Knowledge and Data Engineering.

[4]  Unil Yun,et al.  Mining high utility itemsets based on the time decaying model , 2016, Intell. Data Anal..

[5]  Raj P. Gopalan,et al.  Efficient Mining of High Utility Itemsets from Large Datasets , 2008, PAKDD.

[6]  Mohammed J. Zaki.  Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..

[7]  Wei Song,et al.  A high utility itemset mining algorithm based on subsume index , 2015, Knowledge and Information Systems.

[8]  Philippe Fournier-Viger,et al.  More Efficient Algorithms for Mining High-Utility Itemsets with Multiple Minimum Utility Thresholds , 2016, DEXA.

[9]  Srikumar Krishnamoorthy,et al.  Efficient mining of high utility itemsets with multiple minimum utility thresholds , 2018, Eng. Appl. Artif. Intell..

[10]  Mengchi Liu,et al.  Mining high utility itemsets without candidate generation , 2012, CIKM.

[11]  Philippe Fournier-Viger,et al.  FHN: An efficient algorithm for mining high-utility itemsets with negative unit profits , 2016, Knowl. Based Syst..

[12]  Heungmo Ryang,et al.  High utility pattern mining over data streams with sliding window technique , 2016, Expert Syst. Appl..

[13]  Jen-Wei Huang,et al.  DMHUPS: Discovering Multiple High Utility Patterns Simultaneously , 2018, Knowledge and Information Systems.

[14]  Jerry Chun-Wei Lin,et al.  MEMU: More Efficient Algorithm to Mine High Average-Utility Patterns With Multiple Minimum Average-Utility Thresholds , 2018, IEEE Access.

[15]  Philippe Fournier-Viger,et al.  Efficient Vertical Mining of High Average-Utility Itemsets Based on Novel Upper-Bounds , 2019, IEEE Transactions on Knowledge and Data Engineering.

[16]  Young-Koo Lee,et al.  Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases , 2009, IEEE Transactions on Knowledge and Data Engineering.

[17]  Vincent S. Tseng,et al.  Mining High Utility Sequential Patterns from Evolving Data Streams , 2015 .

[18]  Vincent S. Tseng,et al.  FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning , 2014, ISMIS.

[19]  Scott Buffett,et al.  Candidate List Maintenance in High Utility Sequential Pattern Mining , 2018, 2018 IEEE International Conference on Big Data (Big Data).

[20]  Kuldeep Singh,et al.  CHN: an efficient algorithm for mining closed high utility itemsets with negative utility , 2018 .

[21]  Tzung-Pei Hong,et al.  Incrementally mining high utility patterns based on pre-large concept , 2014, Applied Intelligence.

[22]  Byeong-Soo Jeong,et al.  A Novel Approach for Mining High‐Utility Sequential Patterns in Sequence Databases , 2010 .

[23]  Tzung-Pei Hong,et al.  Applying the maximum utility measure in high utility sequential pattern mining , 2014, Expert Syst. Appl..

[24]  Tzung-Pei Hong,et al.  An Incremental Mining Algorithm for High Average-Utility Itemsets , 2009, 2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks.

[25]  Le Wang,et al.  A New Algorithm of Mining High Utility Sequential Pattern in Streaming Data , 2019, Int. J. Comput. Intell. Syst..

[26]  Unil Yun,et al.  Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases , 2020, Future Gener. Comput. Syst..

[27]  Philippe Fournier-Viger,et al.  An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies , 2016, Knowl. Based Syst..

[28]  Philippe Fournier-Viger,et al.  FOSHU: faster on-shelf high utility itemset mining -- with or without negative unit profit , 2015, SAC.

[29]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[30]  Shekhar Patel,et al.  A Survey on Discovering High Utility Itemset Mining from Transactional Database , 2015 .

[31]  Arbee L. P. Chen,et al.  Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window , 2005, SDM.

[32]  Pinar Senkul,et al.  CRoM and HuspExt: Improving Efficiency of High Utility Sequential Pattern Extraction , 2015, IEEE Transactions on Knowledge and Data Engineering.

[33]  Tzung-Pei Hong,et al.  An Incremental High-Utility Mining Algorithm with Transaction Insertion , 2015, TheScientificWorldJournal.

[34]  Vincent S. Tseng,et al.  Mining closed+ high utility itemsets without candidate generation , 2015, 2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI).

[35]  Heri Ramampiaro,et al.  Towards efficiently mining closed high utility itemsets from incremental databases , 2019, Knowl. Based Syst..

[36]  Unil Yun,et al.  Efficient algorithm for mining high average-utility itemsets in incremental transaction databases , 2017, Applied Intelligence.

[37]  Tzung-Pei Hong,et al.  An effective tree structure for mining high utility itemsets , 2011, Expert Syst. Appl..

[38]  Hamido Fujita,et al.  Damped window based high average utility pattern mining over data streams , 2017, Knowl. Based Syst..

[39]  Philippe Fournier-Viger,et al.  Efficiently updating the discovered high average-utility itemsets with transaction insertion , 2018, Eng. Appl. Artif. Intell..

[40]  Aijun An,et al.  Memory-adaptive high utility sequential pattern mining over data streams , 2017, Machine Learning.

[41]  Tzung-Pei Hong,et al.  High Utility Partial Periodic Pattern Mining , 2017, MISNC '17.

[42]  Heungmo Ryang,et al.  Top-k high utility pattern mining with effective threshold raising strategies , 2015, Knowl. Based Syst..

[43]  Tzung-Pei Hong,et al.  Efficiently mining uncertain high-utility itemsets , 2017, Soft Comput..

[44]  Unil Yun,et al.  Efficient mining of high utility pattern with considering of rarity and length , 2015, Applied Intelligence.

[45]  Srikumar Krishnamoorthy,et al.  Pruning strategies for mining high utility itemsets , 2015, Expert Syst. Appl..

[46]  Tzung-Pei Hong,et al.  An incremental mining algorithm for high utility itemsets , 2012, Expert Syst. Appl..

[47]  Yun Sing Koh,et al.  Mining local and peak high utility itemsets , 2019, Inf. Sci..

[48]  Philip S. Yu,et al.  Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases , 2013, IEEE Transactions on Knowledge and Data Engineering.

[49]  Unil Yun,et al.  Efficient approach for incremental high utility pattern mining with indexed list structure , 2019, Future Gener. Comput. Syst..

[50]  Ho-Jin Choi,et al.  Interactive mining of high utility patterns over data streams , 2012, Expert Syst. Appl..

[51]  Hoai Bac Le,et al.  A pure array structure and parallel strategy for high-utility sequential pattern mining , 2018, Expert Syst. Appl..

[52]  Vikram Goyal,et al.  Mining top-k high-utility itemsets from a data stream under sliding window model , 2017, Applied Intelligence.

[53]  Lin Feng,et al.  UT-Tree: Efficient mining of high utility itemsets from data streams , 2013, Intell. Data Anal..

[54]  Unil Yun,et al.  Efficient incremental high utility pattern mining based on pre-large concept , 2018, Eng. Appl. Artif. Intell..

[55]  Vincent S. Tseng,et al.  EFIM: A Highly Efficient Algorithm for High-Utility Itemset Mining , 2015, MICAI.

[56]  Ashok Kumar Das,et al.  An efficient fast algorithm for discovering closed+ high utility itemsets , 2016, Applied Intelligence.

[57]  Heungmo Ryang,et al.  Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques , 2017, Knowledge and Information Systems.

[58]  Heri Ramampiaro,et al.  Efficient high utility itemset mining using buffered utility-lists , 2017, Applied Intelligence.

[59]  Lei Zhang,et al.  An indexed set representation based multi-objective evolutionary approach for mining diversified top-k high utility patterns , 2019, Eng. Appl. Artif. Intell..

[60]  Ying Liu,et al.  A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets , 2005, PAKDD.

[61]  Tzung-Pei Hong,et al.  Mining High-Utility Itemsets with Multiple Minimum Utility Thresholds , 2015, C3S2E.

[62]  Tzung-Pei Hong,et al.  Efficient updating of discovered high-utility itemsets for transaction deletion in dynamic databases , 2015, Adv. Eng. Informatics.

[63]  Jerry Chun-Wei Lin,et al.  A Survey of High Utility Itemset Mining , 2019, Studies in Big Data.

[64]  Tzung-Pei Hong,et al.  Efficient algorithms for mining high-utility itemsets in uncertain databases , 2016, Knowl. Based Syst..

[65]  Kuldeep Singh,et al.  EHNL: An efficient algorithm for mining high utility itemsets with negative utility value and length constraints , 2019, Inf. Sci..

[66]  Longbing Cao,et al.  USpan: an efficient algorithm for mining high utility sequential patterns , 2012, KDD.

[67]  Tzung-Pei Hong,et al.  An efficient algorithm to mine high average-utility itemsets , 2016, Adv. Eng. Informatics.

[68]  Vincent S. Tseng,et al.  An efficient algorithm for mining temporal high utility itemsets from data streams , 2008, J. Syst. Softw..

[69]  Bingru Yang,et al.  Index-BitTableFI: An improved algorithm for mining frequent itemsets , 2008, Knowl. Based Syst..

[70]  Philip S. Yu,et al.  Efficient Mining of a Concise and Lossless Representation of High Utility Itemsets , 2011, 2011 IEEE 11th International Conference on Data Mining.

[71]  Jimmy Ming-Tai Wu,et al.  TUB-HAUPM: Tighter Upper Bound for Mining High Average-Utility Patterns , 2018, IEEE Access.

[72]  Vincent S. Tseng,et al.  Mining High-Utility Itemsets with Both Positive and Negative Unit Profits from Uncertain Databases , 2017, PAKDD.

[73]  Vincent S. Tseng,et al.  Mining high-utility itemsets in dynamic profit databases , 2019, Knowl. Based Syst..

[74]  Meera Dhabu,et al.  Selective Database Projections Based Approach for Mining High-Utility Itemsets , 2018, IEEE Access.

[75]  Tzung-Pei Hong,et al.  Incrementally updating the discovered sequential patterns based on pre-large concept , 2015, Intell. Data Anal..

[76]  Qiming Chen,et al.  PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth , 2001, Proceedings 17th International Conference on Data Engineering.

[77]  Kuldeep Singh,et al.  Mining of high‐utility itemsets with negative utility , 2018, Expert Syst. J. Knowl. Eng..

[78]  Tzung-Pei Hong,et al.  Efficient algorithms for mining up-to-date high-utility patterns , 2015, Adv. Eng. Informatics.

[79]  Nan Jiang,et al.  Research issues in data stream association rule mining , 2006, SGMD.

[80]  Hamido Fujita,et al.  An efficient algorithm for mining high utility patterns from incremental databases with one database scan , 2017, Knowl. Based Syst..

[81]  Wilfred Ng,et al.  A survey on algorithms for mining frequent itemsets over data streams , 2008, Knowledge and Information Systems.

[82]  Tzung-Pei Hong,et al.  A fast maintenance algorithm of the discovered high-utility itemsets with transaction deletion , 2016, Intell. Data Anal..

[83]  Philip S. Yu,et al.  Efficient algorithms for mining maximal high utility itemsets from data streams with different models , 2012, Expert Syst. Appl..

[84]  Jerry Chun-Wei Lin,et al.  EHAUPM: Efficient High Average-Utility Pattern Mining With Tighter Upper Bounds , 2017, IEEE Access.

[85]  Philip S. Yu,et al.  UP-Growth: an efficient algorithm for high utility itemset mining , 2010, KDD.

[86]  Tzung-Pei Hong,et al.  A two-phase approach to mine short-period high-utility itemsets in transactional databases , 2017, Adv. Eng. Informatics.

[87]  Philippe Fournier-Viger,et al.  CLS-Miner: efficient and effective closed high-utility itemset mining , 2019, Frontiers of Computer Science.