Skip to main content
Springer Nature Link
Log in

An overview of high utility itemsets mining methods based on intelligent optimization algorithms

  • Regular paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Mining high utility itemsets from massive data is one of the most active research directions in data mining at present. Intelligent optimization algorithms have been applied to the high utility itemsets mining because of their flexibility and intelligence, and have achieved good results. In this paper, high utility itemsets mining strategies based on swarm intelligence optimization algorithms are mainly analyzed and summarized comprehensively, and the strategies based on the evolutionary algorithms and other intelligence optimization algorithms are introduced in detail. The method based on swarm intelligence optimization algorithm is summarized and compared from the aspects of update strategy, pruning strategy, comparison algorithms, dataset, parameter settings, advantages, disadvantages, etc. The methods based on particle swarm optimization are classified in terms of particle update, which are traditional update strategies, sigmoid function-based strategies, greed-based strategies, roulette mechanism-based strategies, and set-based strategies. The experimental comparative analysis of the algorithms is carried out in terms of the operational efficiency of the algorithms and the number of high utility itemsets mined by the algorithms under the conditions of the same dataset. The experimental analysis shows that the strategy based on the swarm intelligence optimization algorithm is optimal, especially the high utility itemsets mining algorithm based on the bionic algorithm, which has a shorter running time and less number of high utility itemsets lost, and the least efficient strategy based on the genetic algorithm, which will lose a large number of itemsets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig.14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20

Similar content being viewed by others

References

  1. Nouioua M, Fournier-Viger P, Wu CW (2021) FHUQI-miner: fast high utility quantitative itemset mining. Appl Intell 51(10):6785–6809

    Article  Google Scholar 

  2. Ahmed U, Srivastava G, Lin JCW (2021) A federated learning approach to frequent itemset mining in cyber-physical systems. J Netw Syst Manage 29(4):1–17

    Article  Google Scholar 

  3. Hidouri A, Jabbour S, Raddaoui B (2021) Mining closed high utility itemsets based on propositional satisfiability. Data Knowl Eng 136:101927

    Article  Google Scholar 

  4. Nouioua M, Fournier-Viger P, Gan W (2022) TKQ: top-K quantitative high utility itemset mining[C]. International conference on advanced data mining and applications. Springer, Cham, pp 16–28

    Chapter  Google Scholar 

  5. Sohrabi MK (2020) An efficient projection-based method for high utility itemset mining using a novel pruning approach on the utility matrix. Knowl Inf Syst 62(11):4141–4167

    Article  Google Scholar 

  6. Zida S, Fournier-Viger P, Lin JCW (2017) EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595–625

    Article  Google Scholar 

  7. Fournier-Viger P, Wu CW, Zida S (2014) FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning[C]. International symposium on methodologies for intelligent systems. Springer, Cham, pp 83–92

    Google Scholar 

  8. Liu M., and Qu J. (2012) Mining high utility itemsets without candidate generation[C]. In: Proceedings of the 21st ACM international conference on Information and knowledge management. pp 55–64

  9. Krishnamoorthy S (2015) Pruning strategies for mining high utility itemsets. Expert Syst Appl 42(5):2371–2381

    Article  Google Scholar 

  10. Dawar S, Goyal V, Bera D (2017) A hybrid framework for mining high-utility itemsets in a sparse transaction database. Appl Intell 47(3):809–827

    Article  Google Scholar 

  11. Liu Y, Liao W, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets[C]. Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, Heidelberg, pp 689–695

    Chapter  Google Scholar 

  12. Tseng VS, Wu CW, Fournier-Viger P (2015) Efficient algorithms for mining top-k high utility itemsets. IEEE Trans Knowl Data Eng 28(1):54–67

    Article  Google Scholar 

  13. Nawaz MS, Fournier-Viger P, Yun U (2021) Mining high utility itemsets with hill climbing and simulated annealing[J]. ACM Trans Manag Inf Syst 13(1):1–22

    Article  Google Scholar 

  14. Ventura S, Luna JM (2016) Pattern mining with evolutionary algorithms. Springer, Berlin

    Book  MATH  Google Scholar 

  15. Luna JM, Pechenizkiy M, Del Jesus MJ (2017) Mining context-aware association rules using grammar-based genetic programming[J]. IEEE Trans Cybern 48(11):3030–3044

    Article  Google Scholar 

  16. Yu X, Gen M (2010) Introduction to evolutionary algorithms. Springer Science & Business Media, London

    Book  MATH  Google Scholar 

  17. Kannimuthu S, Premalatha K (2014) Discovery of high utility itemsets using genetic algorithm with ranked mutation. Appl Artif Intell 28(4):337–359

    Article  Google Scholar 

  18. Lin JCW, Yang L, Fournier-Viger P (2017) A binary PSO approach to mine high-utility itemsets. Soft Comput 21(17):5103–5121

    Article  Google Scholar 

  19. Lin JCW, Yang L, Fournier-Viger P (2015) A swarm-based approach to mine high-utility itemsets. International conference on multidisciplinary social networks research. Springer, Berlin, Heidelberg, pp 572–581

    Chapter  Google Scholar 

  20. Lin JCW, Yang L, Fournier-Viger P (2016) Mining high-utility itemsets based on particle swarm optimization. Eng Appl Artif Intell 55:320–330

    Article  Google Scholar 

  21. Song W, Huang C (2018) Discovering high utility itemsets based on the artificial bee colony algorithm. Pacific-Asia conference on knowledge discovery and data mining. Springer, Cham, pp 3–14

    Chapter  Google Scholar 

  22. Song W, Li J, Huang C (2021) Artificial Fish Swarm Algorithm for Mining High Utility Itemsets. International conference on swarm intelligence. Springer, Cham, pp 407–419

    Google Scholar 

  23. Song W, Huang C (2020) Mining high average -utility itemsets based on particle swarm optimization. Data Sci Pattern Recogn 4(2):19–32

    Google Scholar 

  24. Lin JCW, Djenouri Y, Srivastava G (2021) A predictive GA-based model for closed high-utility itemset mining. Appl Soft Comput 108:107422

    Article  Google Scholar 

  25. Song W, Zheng C, and Huang C (2021) Heuristically mining the top-k high-utility itemsets with cross-entropy optimization. Appl Intell 1–16

  26. Logeswaran K, Andal RKS, and Ezhilmathi ST. 2021 A Survey on metaheuristic nature inspired computations used for mining of association rule frequent itemset and high utility itemset. In: IOP Conference Series Materials Science and Engineering. IOP Publishing, UK 1055 1 012103

  27. Djenouri Y, Fournier-Viger P, Belhadi A (2019) Metaheuristics for frequent and high-utility itemset mining[M]. High-Utility Pattern Mining. Springer, Cham, pp 261–278

    Chapter  Google Scholar 

  28. Chun-Yan Z, Meng H, Rui S (2021) Survey of key technologies for high utility patterns mining. Appl Res Comput 38(02):330–340

    Google Scholar 

  29. Mu-Hang Li, Meng H, Zhi-Qiang C (2022) Survey of algorithms oriented to complex high utility pattern mining[J]. J Guangxi Normal Univ 40(3):1–19

    Google Scholar 

  30. Kennedy J, and Eberhart R 1995 Particle swarm optimization[C]. In: Proceedings of ICNN'95-international conference on neural networks. (IEEE), 4: 1942–1948

  31. Eberhart R, and Kennedy J. 1995 A new optimizer using particle swarm theory[C]. In: MHS'95. Proceedings of the sixth international symposium on micro machine and human science. (IEEE), pp 39–43

  32. Pears R, Koh YS (2011) Weighted association rule mining using particle swarm optimization[C]. Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin, Heidelberg, pp 327–338

    Google Scholar 

  33. Sivamathi C, Vijayarani S. 2017 Mining high utility itemsets using shuffled complex evolution of particle swarm optimization (SCE-PSO) optimization algorithm[C]. In: 2017 International Conference on Inventive Computing and Informatics (ICICI). IEEE, pp 640–644

  34. Kennedy J, and Eberhart RA (1997) Discrete binary version of particle swarm algorithm. In: Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics, pp. 4104–4108

  35. Gunawan R, Winarko E, Pulungan R (2020) A BPSO-based method for high-utility itemset mining without minimum utility threshold. Knowl-Based Syst 190:105164

    Article  Google Scholar 

  36. Xiao-Le J, Xia-Bi L, Xiao M (2018) High-utility itemsets mining algorithm based on double binary particle swarm optimization. Comput Eng 44(12):202–207

    Google Scholar 

  37. Song W, Huang C (2018) Mining high utility itemsets using bio-inspired algorithms: a diverse optimal value framework. IEEE Access 6:19568–19582

    Article  Google Scholar 

  38. Tseng V. S., Wu. C. W., and Shie B. E 2010 UP-Growth: an efficient algorithm for high utility itemset mining[C]. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 253–262

  39. ChangWu W, Song-lin Y, Wen-Yuan L (2020) High utility itemset mining algorithm based on improved particle swarm optimization. J Chin Comput Syst 41(05):1084–1090

    Google Scholar 

  40. Chen WN, Zhang J, Chung HSH (2009) A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans Evol Comput 14(2):278–300

    Article  Google Scholar 

  41. Song W, Li J (2020) Discovering high utility itemsets using set-based particle swarm optimization. International conference on advanced data mining and applications. Springer, Cham, pp 38–53

    Chapter  Google Scholar 

  42. Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28–39

    Article  Google Scholar 

  43. Wu JMT, Zhan J, and Lin JCW 2016 Mining of high-utility itemsets by ACO algorithm[C].In: Proceedings of the 3rd Multidisciplinary International Social Networks Conference on Social Informatics 2016, Data Science 2016: 1–7

  44. Wu JMT, Zhan J, Lin JCW (2017) An ACO-based approach to mine high-utility itemsets. Knowl-Based Syst 116:102–113

    Article  Google Scholar 

  45. Seidlova R, Poživil J, Seidl J (2019) Marketing and business intelligence with help of ant colony algorithm. J Strateg Mark 27(5):451–463

    Article  Google Scholar 

  46. Arunkumar MS, Suresh P, Gunavathi C (2018) High utility infrequent itemset mining using a customized ant colony algorithm. Int J Parallel Program 48(5):833–849

    Article  Google Scholar 

  47. Pramanik S, Goswami A (2021) Discovery of closed high utility itemsets using a fast nature-inspired ant colony algorithm. Appl Intell 52(8):8839–8855

    Article  Google Scholar 

  48. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39(3):459–471

    Article  MathSciNet  MATH  Google Scholar 

  49. Emary E, Zawbaa HM, Hassanien AE (2016) Binary grey wolf optimization approaches for feature selection. Neurocomputing 172:371–381

    Article  Google Scholar 

  50. Pazhaniraja N, Sountharrajan S, Kumar BS (2020) High utility itemset mining: a Boolean operators-based modified grey wolf optimization algorithm. Soft Comput 24(21):16691–16704

    Article  Google Scholar 

  51. Ghosh S, Biswas S, and Sarkar D 2010 Mining frequent itemsets using genetic algorithm. arXiv preprint arXiv:1011.0328, 2010.

  52. Lin JCW, Gan W, Fournier-Viger P (2016) High utility-itemset mining and privacy-preserving utility mining. Perspect Sci 7:74–80

    Article  Google Scholar 

  53. Zhang Q, Fang W, Sun J (2019) Improved genetic algorithm for high-utility itemset mining. IEEE Access 7:176799–176813

    Article  Google Scholar 

  54. Seifikar M, Farzi S, Barati M (2020) C-blondel: an efficient louvain-based dynamic community detection algorithm. IEEE Trans Comput Social Syst 7(2):308–313

    Article  Google Scholar 

  55. Pazhaniraja N, Sountharrajan S (2021) High utility itemset mining using dolphin echolocation optimization. J Ambient Intell Humaniz Comput 12(8):8413–8426

    Article  Google Scholar 

  56. Krishna GJ, Ravi V (2020) Mining top high utility association rules using binary differential evolution. Eng Appl Artif Intell 96:103935

    Article  Google Scholar 

  57. Krishna GJ, Ravi V (2021) High utility itemset mining using binary differential evolution: an application to customer segmentation. Expert Syst Appl 181:115122

    Article  Google Scholar 

  58. Cai X, Li Y, Fan Z (2014) An external archive guided multiobjective evolutionary algorithm based on decomposition for combinatorial optimization. IEEE Trans Evol Comput 19(4):508–523

    Google Scholar 

  59. Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731

    Article  Google Scholar 

  60. Deb K, Pratap A, Agarwal S (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  61. Zitzler E, Laumanns M, and Thiele L 2001 SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report, 103

  62. Zhang L, Fu G, Cheng F (2018) A multi-objective evolutionary approach for mining frequent and high utility itemsets. Appl Soft Comput 62:974–986

    Article  Google Scholar 

  63. Ahmed U, Lin JCW, Srivastava G (2020) An evolutionary model to mine high expected utility patterns from uncertain databases[J]. IEEE Trans Emerg Topics Comput Intell 5(1):19–28

    Article  Google Scholar 

  64. Fang W, Zhang Q, Sun J, et al. 2020 Mining high quality patterns using multi-objective evolutionary algorithm. IEEE Trans Knowl Data Eng

  65. Cao H, Yang S, and Wang Q 2019 A closed itemset property based multi-objective evolutionary approach for mining frequent and high utility itemsets[C]. In: 2019 IEEE congress on evolutionary computation (CEC). IEEE, pp 3356–3363

Download references

Funding

National Natural Science Foundation of China, 62062004, Natural Science Foundation of Ningxia, 2022AAC03279.

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, North Minzu University, Yinchuan, 750021, China

    Meng Han, Zhihui Gao, Ang Li, Shujuan Liu & Dongliang Mu

Authors
  1. Meng Han
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zhihui Gao
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Ang Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Shujuan Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Dongliang Mu
    View author publications

    You can also search for this author inPubMed Google Scholar

Contributions

M Han and Z Gao wrote the main manuscript text. A Li, S Liu and D Mu helped revise the manuscript format and collect data. All authors reviewed the manuscript."

Corresponding author

Correspondence to Meng Han.

Ethics declarations

Conflict of interests

The authors declare no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was supported by the National Natural Science Foundation of China (62062004) and the Natural Science Foundation of Ningxia (2020AAC03216, 2022AAC03279).

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Han, M., Gao, Z., Li, A. et al. An overview of high utility itemsets mining methods based on intelligent optimization algorithms. Knowl Inf Syst 64, 2945–2984 (2022). https://doi.org/10.1007/s10115-022-01741-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-022-01741-1

Keywords