KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

High Utility Itemset Mining over Uncertain Datasets Based on a Quantum Genetic Algorithm

  • Received : 2017.08.27
  • Accepted : 2018.03.19
  • Published : 2018.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

The discovered high potential utility itemsets (HPUIs) have significant influence on a variety of areas, such as retail marketing, web click analysis, and biological gene analysis. Thus, in this paper, we propose an algorithm called HPUIM-QGA (Mining high potential utility itemsets based on a quantum genetic algorithm) to mine HPUIs over uncertain datasets based on a quantum genetic algorithm (QGA). The proposed algorithm not only can handle the problem of the non-downward closure property by developing an upper bound of the potential utility (UBPU) (which prunes the unpromising itemsets in the early stage) but can also handle the problem of combinatorial explosion by introducing a QGA, which finds optimal solutions quickly and needs to set only very few parameters. Furthermore, a pruning strategy has been designed to avoid the meaningless and redundant itemsets that are generated in the evolution process of the QGA. As proof of the HPUIM-QGA, a substantial number of experiments are performed on the runtime, memory usage, analysis of the discovered itemsets and the convergence on real-life and synthetic datasets. The results show that our proposed algorithm is reasonable and acceptable for mining meaningful HPUIs from uncertain datasets.

Keywords

References

  1. R. Agrawal, T. Imielinski, A. Swami, "Database mining: a performance perspective," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 6, pp. 914-925, December, 1993. https://doi.org/10.1109/69.250074
  2. R. Agrawal, T. Imielinski, A. Swami, "Mining association rules between sets of items in large dataset," in Proc. of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207-216, May 25-28, 1993.
  3. R. Agrawal, R. Srikant, "Fast algorithms for mining association rules," in Proc. of the 20th international conference on very large datasets, pp. 487-499, September 12-15, 1994.
  4. J. Han, J. Pei, Y. Yin, R. Mao, "Mining frequent patterns without candidate generation: a frequent-pattern tree approach," Data Mining and Knowledge Discovery, vol. 8, no. 1, pp. 53-87, February, 2004. https://doi.org/10.1023/B:DAMI.0000005258.31418.83
  5. H. Yao, H.J. Hamilton, C.J. Butz, "A foundational approach to mining itemset utilities from datasets," in Proc. of the 2004 SIAM International Conference on Data Mining, pp. 482-486, April 22-24, 2004.
  6. Z. Morteza, A. Aijun, "Mining top-k high utility patterns over data streams," Information Science, vol. 285, no. 1, pp. 138-161, January, 2014. https://doi.org/10.1016/j.ins.2014.01.045
  7. R. Chan, Q. Yang, Y.D. Shen, "Mining high utility itemsets," in Proc. of IEEE International Conference on Data Mining, pp.19-26, November, 2003.
  8. Y. Liu, W.K. Liao, A. Choudhary, "A two-phase algorithm for fast discovery of high utility itemsets," in Proc. of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining, pp. 689-695, May 18-20, 2005.
  9. C.W. Lin, T.P. Hong, W.H. Lu, "An effective tree structure for mining high utility itemsets," Expert Systems with Application, vol. 38, no. 6, pp. 7419-7424, June, 2011. https://doi.org/10.1016/j.eswa.2010.12.082
  10. G. Shiming, G. Hong. "HUITWU: An Efficient Algorithm for High-Utility Itemset Mining in Transaction Databases," Joural of Computer Science and Technology, vol. 31, no. 4, pp. 776-786, July, 2016. https://doi.org/10.1007/s11390-016-1662-2
  11. S. Kannimuthu, K. Premalatha, "Discovery of high utility itemsets using genetic algorithm with ranked mutation," Applied Artificial Intelligence, vol. 28, no. 4, pp. 337-359, April, 2014. https://doi.org/10.1080/08839514.2014.891839
  12. C. L. Lin, Y. Lu, F.V. Philippe, T.P. Hong, V. Miroslav, "A binary PSO approach to mine high-utility itemsets," Soft Comput, vol. 21, no. 17, pp. 5103-5121, March, 2016.
  13. J.C. Lin, W. Gan, F.V. Philippe, T.P. Hong, V.S. Tseng, "Efficient algorithms for mining high-utility itemsets in uncertain datasets," Knowledge-Based Systems, vol. 96, no. C, pp. 171-187, March, 2016. https://doi.org/10.1016/j.knosys.2015.12.019
  14. Y.Q. Lan, Y. Wang, Y. Wang, S.W. Yi, D. Yu, "Mining high utility itemsets over uncertain datasets," in Proc. of International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, pp. 235-238, September 17-19, 2015.
  15. H. Huan, C. Liang, W. Feng-ge, W. Hua-li, W. Yaqi. "An Improved Dynamic Quantum Genetic Algorithm," Journal of Military Communications Technology, vol. 38, no. 2, pp. 17-21, February, 2017.
  16. H. Liuyu, G. Shuping, W. Junning, X. Xiaona. "Hybrid frog leaping algorithm based on differential evolution," Systems Engineering and Electronics, vol. 39, no. 10, pp. 2382-2391, October, 2017.
  17. L. Dongsheng, G. Yang, Y. Aixia. "Jamming Resource Allocation via Improved Discrete Cuckoo Search Algorithm," Journal of Electronics & Information Technology, vol. 38, no. 4, pp. 899-905, April, 2016.
  18. C. Hao, Z. Jie, Y. Qingping, D. Yaya, X. Lixue, J. Minjie. "Multi-population artificial bee colony algorithm based on hybrid search," Journal of Computer Applications, vol. 37, no. 10, pp. 2773-2779, October, 2017.
  19. C.K. Chui, B. Kao, E. Hung. "Mining frequent itemsets from uncertain data," in Proc. of the Pacific-Asia conference advances in knowledge discovery and data mining, pp. 47-58, May 22-25, 2007.
  20. J. Tang, A. Liu, M. Zhao, T. Wang. "An Aggregate Signature based Trust Routing for Data Gathering in Sensor Networks," Security and Communication Networks, vol. 2018, January, 2018.
  21. Y. Liu, A. Liu, S. Guo, Z. Li, Y.J. Choi. "Contest-aware collect data with energy efficient in Cyber-physical cloud systems," Future Generation Computer Systems, available online, June, 2017.