Abstract
The critical issue identified in recent times is the high utility itemset mining (HUIM). It may be used for showing products that are profitably utilizing considering the factors of profit and quality as opposed to the frequent itemset (FIM) or the association rule (ARM) mining. There are numerous high utility itemset mining (HUIs) algorithms, mostly designed for handling the exponential search space to discover the HUIs at the time the number of the distinct items and the database that was very large. For this purpose, a meta-heuristic algorithm is designed for HUIs mining, working based on the genetic algorithm (GA) and the Dolphin echolocation optimization (DEO). The intended purpose of this evolutionary computation (EC) techniques on the DEO, here only fewer parameters are required to be compared to the approaches that are based on the GA. As the traditional DEO mechanism had been found for handling this continuous problem, an efficient algorithm based on the DEO called the high-utility itemset mining-DEO (HUIM-DEO) was proposed. To prove that the algorithm proposed was able to outperform the other heuristic algorithms to mine the HUIs for the time taken for execution, the number of HUIs discovered, and their convergence.
Similar content being viewed by others
References
Chiclana F, Kumar R, Mittal M, Khari M, Chatterjee JM, Baik SW (2018) ARM–AMO: an efficient association rule mining algorithm based on animal migration optimization. Knowl Based Syst 154:68–80. https://doi.org/10.1016/j.knosys.2018.04.038
Deepa R, Vaishnavi S (2018) A survey on data mining methods and its applications. Int J Adv Eng Res Dev 5(1):463–467
Djenouri Y, Comuzzi M (2017) Combining Apriori heuristic and bio-inspired algorithms for solving the frequent itemsets mining problem. Inf Sci 420:1–15. https://doi.org/10.1016/j.ins.2017.08.043
Hussain RI, Srivatsa SK (2014) A study of different association rule mining techniques. Int J Comput Appl 108(16):10–15
Kannimuthu S, Premalatha K (2014) Discovery of high utility itemsets using genetic algorithm with ranked mutation. J Appl Artif Intell 28(4):337–359. https://doi.org/10.1080/08839514.2014.891839
Kaveh A, Farhoudi N (2016) Dolphin echolocation optimization: continuous search space. Adv Comput Des 1(2):175–194. https://doi.org/10.12989/acd.2016.1.2.175
Lin JCW, Yang L, Fournier-Viger P, Wu MT, Hong TP, Wang LSL (2015) A swarm-based approach to mine high-utility itemsets. In: MISNC international conference on multidisciplinary social networks research, pp 572–581. https://doi.org/10.1007/978-3-662-48319-0_48
Lin JCW, Yang L, Fournier-Viger P, Hong TP, Voznak M (2017) A binary PSO approach to mine high-utility itemsets. Soft Comput 21(17):5103–5121. https://doi.org/10.1007/s00500-016-2106-1
Lin JCW, Ren S, Fournier-Viger P, Pan JS, Hong TP (2018) Efficiently updating the discovered high average-utility itemsets with transaction insertion. Eng Appl Artif Intell 72:136–149. https://doi.org/10.1016/j.engappai.2018.03.021
Mlakar U, Zorman M, Fister I Jr, Fister I (2017) Modified binary cuckoo search for association rule mining. J Intell Fuzzy Syst 32(6):4319–4330. https://doi.org/10.3233/JIFS-16963
Pan G, Li K, Ouyang A, Li K (2016) Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP. J Soft Comput 20(2):555–566. https://doi.org/10.1007/s00500-014-1522-3
Prithiviraj P, Porkodi R (2015) A comparative analysis of association rule mining algorithms in data mining: a study. Open J Comput Sci Eng Surv 3(1):98–119
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. https://doi.org/10.1016/j.eswa.2015.02.051
Sathyavani D, Sharmila D (2020) An improved memory adaptive up-growth to mine high utility itemsets from large transaction databases. J Ambient Intell Humaniz Comput. https://doi.org/10.1007/s12652-020-01706-8
Song W, Huang C (2018a) Mining high utility itemsets using bio-inspired algorithms: a diverse optimal value framework. IEEE Access 6:19568–19582. https://doi.org/10.1109/ACCESS.2018.2819162
Song W, Huang C (2018b) Discovering high utility itemsets based on the artificial bee colony algorithm. In: PAKDD Pacific–Asia conference on knowledge discovery and data mining, pp 3–14. https://doi.org/10.1007/978-3-319-93040-4_1
Soto R, Crawford B, Carrasco C, Almonacid B, Reyes V, Araya I, Misra S, Olguín E (2016) Solving manufacturing cell design problems by using a dolphin echolocation algorithm. In: ICCSA international conference on computational science and its applications, pp 77–86. https://doi.org/10.1007/978-3-319-42092-9_7
Wu JMT, Zhan J, Lin JCW (2016) Mining of high-utility itemsets by ACO algorithm. In: MISNC, SI, DS Proceedings of the the 3rd multidisciplinary international social networks conference on social informatics data science, pp 1–7. https://doi.org/10.1145/2955129.2955179
Wu JMT, Zhan J, Lin JC-W (2017) An ACO-based approach to mine high-utility itemsets. Knowl Based Syst 116:102–113. https://doi.org/10.1016/j.knosys.2016.10.027
Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Fourth SIAM international conference on data mining Lake Buena Vista, USA, pp 482–486. https://doi.org/10.1137/1.9781611972740.51
Zhang L, Fu G, Cheng F, Qiu J, Su Y (2018) A multi-objective evolutionary approach for mining frequent and high utility itemsets. Appl Soft Comput 62:974–986. https://doi.org/10.1016/j.asoc.2017.09.033
Zhang Q, Fang W, Sun J, Wang Q (2019) Improved genetic algorithm for high-utility item set mining. IEEEAccess 7:176799–176813. https://doi.org/10.1109/ACCESS.2019.2958150
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Pazhaniraja, N., Sountharrajan, S. High utility itemset mining using dolphin echolocation optimization. J Ambient Intell Human Comput 12, 8413–8426 (2021). https://doi.org/10.1007/s12652-020-02571-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12652-020-02571-1