Journal of information and communication convergence engineering

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

High Utility Itemset Mining by Using Binary PSO Algorithm with V-shaped Transfer Function and Nonlinear Acceleration Coefficient Strategy

  • Tao, Bodong (Department of Computer Engineering, Korea Maritime and Ocean University) ;
  • Shin, Ok Keun (Department of Computer Engineering, Korea Maritime and Ocean University) ;
  • Park, Hyu Chan (Department of Computer Engineering, Korea Maritime and Ocean University)
  • Received : 2022.03.01
  • Accepted : 2021.05.12
  • Published : 2022.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

The goal of pattern mining is to identify novel patterns in a database. High utility itemset mining (HUIM) is a research direction for pattern mining. This is different from frequent itemset mining (FIM), which additionally considers the quantity and profit of the commodity. Several algorithms have been used to mine high utility itemsets (HUIs). The original BPSO algorithm lacks local search capabilities in the subsequent stage, resulting in insufficient HUIs to be mined. Compared to the transfer function used in the original PSO algorithm, the V-shaped transfer function more sufficiently reflects the probability between the velocity and position change of the particles. Considering the influence of the acceleration factor on the particle motion mode and trajectory, a nonlinear acceleration strategy was used to enhance the search ability of the particles. Experiments show that the number of mined HUIs is 73% higher than that of the original BPSO algorithm, which indicates better performance of the proposed algorithm.

Keywords

References

  1. J. C. -W. Lin, L. Yang, P. Fournier-Viger, T. -P. Hong, and M. Voznak, "A binary PSO approach to mine high-utility itemsets," Soft Comput, vol. 21, no. 17, pp. 5103-5121, Mar. 2016. DOI: 10.1007/s00500-016-2106-1.
  2. S. Kannimuthu and K. Premalatha, "Discovery of high utility itemsets using genetic algorithm with ranked mutation," Appl Artif Intell, vol. 28, no. 4, pp. 337-359, Apr. 2014. DOI: 10.1080/08839514.2014.891839.
  3. J. Kennedy and R. Eberhart, "Particle swarm optimization," in IEEE Int Conf Neural Netw, Perth: WA, Australia, vol. 4, pp. 1942-1948, 1995. DOI: 10.1109/ICNN.1995.488968.
  4. J. Kennedy and R. C. Eberhart, "A discrete binary version of particle swarm algorithm," in IEEE Int Conf Syst Man Cybern, Orlando: FL, USA, vol. 5, pp. 4104-4108, 1997. DOI: 10.1109/ICSMC.1997.637339.
  5. E. Rashedi, H. Nezamabadi-pour, S. Saryazdi, "BGSA: binary gravitational search algorithm," Natural Computing, vol. 9, no. 3, pp. 727-745, Dec. 2009. DOI: 10.1007/s11047-009-9175-3.
  6. S. Mirjalili and A. Lewis, "S-shaped versus V-shaped transfer functions for binary particle swarm optimization," Swarm and Evolutionary Computation, vol. 9, pp. 1-14, Apr. 2013. DOI: 10.1016/j.swevo.2012.09.002.
  7. Sun Xiang, "The influence of dynamic nonlinear acceleration coefficients on PSO," Computer Engineering & Science, vol. 33, no. 10, pp. 131-134, Oct. 2011. DOI: 10.3969/j.issn.1007-130X.2011.10.023.
  8. R. Chan, Q. Yang, Y. -D. Shen, "Mining high utility itemsets," in IEEE Int Conf Data Mining, Melbourne: FL, USA, pp. 19-26, 2003. DOI: 10.1109/ICDM.2003.1250893.
  9. H. Yao, H. J. Hamilton, and C. J. Butz, "A Foundational Approach to Mining Itemset Utilities from Databases," in Proceedings of the 2004 SIAM International Conference on Data Mining, Lake Buena Vista: FL, USA, pp. 482-486, 2004. DOI: 10.1137/1.9781611972740.51.
  10. A. Ratanweera, S. K. Halgamuge, H. C. Waston, "Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients," IEEE Transactions on evolutionary computation, vol. 8, no. 3, pp. 240-255, Jun. 2004. DOI: 10.1109/TEVC.2004.826071.
  11. F. Xiang, C. Guo-long, and G. Wen-zhong, "Setting and experimental analysis of acceleration factor in particle swarm optimization algorithm," Journal of Jimei University (Natural Science), vol. 11, no. 2, pp. 146-151, 2006. https://doi.org/10.3969/j.issn.1007-7405.2006.02.011
  12. C. Shui-Ii, C. Guo-rong, G. Wen-zhong, and C. Gou-long, "Study on the Nonlinear Strategy of Acceleration Coefficient in Particle Swarm Optimization (PSO) Algorithm," Journal of Yangtze University (Natural Science Edition) Sci & Eng, vol. 4, 2007. DOI: 1016772/j.cnki.1673-1409,2007,04,047.
  13. H. Jiang, C. K. Kwong, W. Y. Park, and K. M. Yu, "A multi-objective PSO approach of mining association rules for affective design based on online customer reviews," Journal of Engineering Design, vol. 29, no. 7, pp. 381-403, May. 2018. DOI: 10.1080/09544828.2018.1475629.
  14. K. Indira and S. Kanmani, "Association rule mining through adaptive parameter control in particle swarm optimization," Comput Stat. Springer-V erlag Berlin, vol. 30, no. 1, pp. 251-277, Mar. 2015. DOI: 10.1007/s00180-014-0533-y.
  15. J. Agrawal, S. Agrawal, A. Singhai, and S. Sharma, "SET-PSO-based approach for mining positive and negative association rules," Knowl Inf Syst, vol. 45, no. 2, pp. 453-471, Nov. 2014. DOI: 10.1007/s10115-014-0795-2.
  16. Z. Zhong-jie, J. Huang, and Y. Wei, "Frequent item sets mining from high-dimensional dataset based on a novel binary particle swarm optimization," Journal of Central South Univ, vol. 23, no. 7, pp. 1700-1708, Jul. 2016. DOI: 10.1007/s11771-016-3224-8.