A BPSO-based method for high-utility itemset mining without minimum utility threshold

Abstract High-utility itemset mining is used to obtain high utility itemsets by taking into account both the quantity as well as the utility of each item, which have not been considered in frequent itemset mining. Many algorithms compute high utility itemsets by setting a minimum utility threshold in advance. However, determining the minimum utility threshold is not easy. Too high or too low a threshold may result in incorrect high utility itemsets. In this paper, we propose a method based on binary particle swarm optimization to optimize the search for high utility itemsets without setting the minimum utility threshold beforehand. Instead, the application of the minimum utility threshold is performed as a post-processing step. Experiments on five datasets indicate that the proposed method is better than existing methods in finding high utility itemsets, and the time to obtain those itemsets is faster than that with setting the minimum utility threshold first.

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

[2]  Justin Zhijun Zhan,et al.  An ACO-based approach to mine high-utility itemsets , 2017, Knowl. Based Syst..

[3]  Lu Yang,et al.  A binary PSO approach to mine high-utility itemsets , 2017, Soft Comput..

[4]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[5]  Raj P. Gopalan,et al.  CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach , 2007, 7th IEEE International Conference on Computer and Information Technology (CIT 2007).

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

[7]  Miroslav Voznak,et al.  An Evolutionary Algorithm to Mine High-Utility Itemsets , 2015 .

[8]  Vincent S. Tseng,et al.  EFIM: a fast and memory efficient algorithm for high-utility itemset mining , 2016, Knowledge and Information Systems.

[9]  Benjamin C. M. Fung,et al.  Mining High Utility Patterns in One Phase without Generating Candidates , 2016, IEEE Transactions on Knowledge and Data Engineering.

[10]  R. J. Kuo,et al.  Association rule mining through the ant colony system for National Health Insurance Research Database in Taiwan , 2007, Comput. Math. Appl..

[11]  Howard J. Hamilton,et al.  Mining itemset utilities from transaction databases , 2006, Data Knowl. Eng..

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

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

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

[15]  Wanwan Wang,et al.  An empirical evaluation of high utility itemset mining algorithms , 2018, Expert Syst. Appl..

[16]  Lu Yang,et al.  Mining high-utility itemsets based on particle swarm optimization , 2016, Eng. Appl. Artif. Intell..

[17]  Hamido Fujita,et al.  An efficient method for mining high utility closed itemsets , 2019, Inf. Sci..

[18]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[20]  R. J. Kuo,et al.  Application of particle swarm optimization to association rule mining , 2011, Appl. Soft Comput..

[21]  Kandhasamy Premalatha,et al.  Discovery of High Utility Itemsets Using Genetic Algorithm with Ranked Mutation , 2014, Appl. Artif. Intell..

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

[23]  Philip S. Yu,et al.  Efficient Algorithms for Mining Top-K High Utility Itemsets , 2016, IEEE Transactions on Knowledge and Data Engineering.

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

[25]  Chengqi Zhang,et al.  Genetic algorithm-based strategy for identifying association rules without specifying actual minimum support , 2009, Expert Syst. Appl..

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

[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]  Srikumar Krishnamoorthy,et al.  A comparative study of top-k high utility itemset mining methods , 2018, Studies in Big Data.

[29]  Veenu Mangat,et al.  Swarm Intelligence Based Technique for Rule Mining in the Medical Domain , 2010 .

[30]  Hamido Fujita,et al.  Efficient algorithms to identify periodic patterns in multiple sequences , 2019, Inf. Sci..

[31]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[32]  Wei Song,et al.  Mining High Utility Itemsets Using Bio-Inspired Algorithms: A Diverse Optimal Value Framework , 2018, IEEE Access.

[33]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

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

[35]  Cory J. Butz,et al.  A Foundational Approach to Mining Itemset Utilities from Databases , 2004, SDM.

[36]  Antonio Gomariz,et al.  The SPMF Open-Source Data Mining Library Version 2 , 2016, ECML/PKDD.