Abstract
Genetic Algorithms (GAs) are an excellent approach for mining high-utility itemsets (HUIs) as they can discover most of the HUIs in a fraction of the time spent by exact algorithms. A key feature of GAs is crossover operators, which allow individuals in a population to communicate and exchange information with each other. However, the usefulness of crossover operator in the overall progress of GAs for high-utility itemset mining (HUIM) has not been investigated. In this paper, the headless chicken test is used to analyze four GAs for HUIM. In that test, crossover operators in the original GAs for HUIM are first replaced with randomized crossover operators. Then, the performance of original GAs with normal crossover are compared with GAs with random crossover. This allows evaluating the overall usefulness of crossover operators in the progress that GAs make during the search and evolution process. Through this test, we found that one GA for HUIM performed poorly, which indicates the absence of well-defined building blocks and that crossover in that GA was indeed working as a macromutation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Fournier-Viger, P., Chun-Wei Lin, J., Truong-Chi, T., Nkambou, R.: A survey of high utility itemset mining. In: Fournier-Viger, P., Lin, J.C.-W., Nkambou, R., Vo, B., Tseng, V.S. (eds.) High-Utility Pattern Mining. SBD, vol. 51, pp. 1–45. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-04921-8_1
Fournier-Viger, P., et al.: The SPMF open-source data mining library version 2. In: Berendt, B., et al. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9853, pp. 36–40. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46131-1_8
Grobler, J., Engelbrecht, A.P.: Headless chicken particle swarm optimization algorithms. In: Tan, Y., Shi, Y., Niu, B. (eds.) Advances in Swarm Intelligence. ICSI 2016, vol. 9712, pp. 350–357. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-41000-5_35
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Jones, T.: Crossover, macromutation, and population-based search. In: 6th International Conference on Genetic Algorithms, pp. 73–80. Morgan Kaufmann (1995)
Kannimuthu, S., Premalatha, K.: Discovery of high utility itemsets using genetic algorithm with ranked mutation. Appl. Artif. Intell 28(4), 337–359 (2014)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: International Conference on Neural Networks, pp. 1942–1948. IEEE (1995)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Lin, J.C., Yang, L., Fournier-Viger, P., Hong, T., Voznák, M.: A binary PSO approach to mine high-utility itemsets. Soft Comput. 21(17), 5103–5121 (2017)
Lin, J.C., et al.: Mining high-utility itemsets based on particle swarm optimization. Eng. Appl. Artif. Intell. 55, 320–330 (2016)
Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 689–695. Springer, Heidelberg (2005). https://doi.org/10.1007/11430919_79
Nawaz, M.S., Lali, M.I., Pasha, M.A.: Formal verification of crossover operator in genetic algorithms using prototype verification system (PVS). In: 9th International Conference on Emerging Technologies, pp. 1–6. IEEE (2013)
Nawaz, M.S., Sun, M.: A formal design model for genetic algorithms operators and its encoding in PVS. In: 2nd International Conference on Big Data and Internet of Things, pp. 186–190. ACM (2018)
Song, W., Huang, C.: Discovering high utility itemsets based on the artificial bee colony algorithm. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10939, pp. 3–14. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-93040-4_1
Song, W., Huang, C.: Mining high utility itemsets using bio-inspired algorithms: a diverse optimal value framework. IEEE Access 6, 19568–19582 (2018)
Song, W., Huang, C.: Mining high average-utility itemsets based on particle swarm optimization. Data Sci. Pattern Recogn 4(2), 19–32 (2020)
Truong, T., Tran, A., Duong, H., Le, B., Fournier-Viger, P.: EHUSM: mining high utility sequences with a pessimistic utility model. Data Sci. Pattern Recogn. 4(2), 65–83 (2020)
Wu, J.M.T., Zhan, J., Lin, J.C.W.: An ACO-based approach to mine high-utility itemsets. Knowl. Based Syst. 116, 102–113 (2017)
Yao, H., Hamilton, H.J.: Mining itemset utilities from transaction databases. Data Knowl. Eng. 59(3), 603–626 (2006)
Yun, U., Kim, D., Yoon, E., Fujita, H.: Damped window based high average utility pattern mining over data streams. Knowl. Based Syst. 144, 188–205 (2018)
Zhang, Q., Fang, W., Sun, J., Wang, Q.: Improved genetic algorithm for high-utility itemset mining. IEEE Access 7, 176799–176813 (2019)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Nawaz, M.S., Fournier-Viger, P., Song, W., Lin, J.CW., Noack, B. (2021). Investigating Crossover Operators in Genetic Algorithms for High-Utility Itemset Mining. In: Nguyen, N.T., Chittayasothorn, S., Niyato, D., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2021. Lecture Notes in Computer Science(), vol 12672. Springer, Cham. https://doi.org/10.1007/978-3-030-73280-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-73280-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-73279-0
Online ISBN: 978-3-030-73280-6
eBook Packages: Computer ScienceComputer Science (R0)