Journal of Shandong University(Engineering Science) ›› 2022, Vol. 52 ›› Issue (2): 107-117.doi: 10.6040/j.issn.1672-3961.0.2021.290

Previous Articles    

Incremental high utility pattern mining algorithm based on index list

ZHANG Ni, HAN Meng*, WANG Le, LI Xiaojuan, CHENG Haodong   

  1. School of Computer Science and Engineering, North Minzu University, Yinchuan 750021, Ningxia, China
  • Published:2022-04-20

CLC Number: 

  • TP301.6
[1] LIAO J, WU S, LIU A. High utility itemsets mining based on divide-and-conquer strategy[J]. Wireless Personal Communications, 2021, 116(3): 1639-1657.
[2] LIN C W, HONG T P, LAN G C, et al. Efficient updating of discovered highutility itemsets for transaction deletion in dynamic databases[J]. Advanced Engineering Informatics, 2015, 29(1): 16-27.
[3] FOURNIER-VIGER P, WU C W, ZIDA S, et al. FHM: faster highutility itemset mining using estimated utility co-occurrence pruning[C] // Processdings of21st International Symposium on Methodologies for Intelligent Systems. Roskilde, Denmark:Lecture, 2014:83-92.
[4] DUONG Q H, FOURNIER-VIGER P, RAMAMPIARO H, et al. Efficient high utility itemset mining using buffered utility-lists[J]. Applied Intelligence, 2018, 48(7): 1859-1877.
[5] YUN U, RYANG H, LEE G, et al. An efficient algorithm for mining high utility patterns from incremental databases with one database scan[J]. Knowledge-Based Systems, 2018, 124(15): 188-206.
[6] LIU J, JU X, ZHANG X, et al. Incremental mining of high utility patterns in one phase by absence and legacy-based pruning[J]. IEEE Access, 2019: 74168-74180.
[7] LIU J, KE W, FUNG B. Mining high utility patterns in one phase without generating candidates[J]. IEEE Transactions on Knowledge & Data Engineering, 2016, 28(5): 1245-1257.
[8] KRISHNAMOORTHY S. Pruning strategies for mining high utility itemsets[J]. Expert Systems with Applications, 2015, 42(5): 2371-2381.
[9] WU M T, LIN C W, TAMRAKAR A. High utility itemset mining with effective pruning strategies[J]. ACM Transactions on Knowledge Discovery from Data, 2019, 13(6): 1-22.
[10] PENG A Y, YUN S K, RIDDLE P. MHUIMiner: afast high utility itemset mining algorithm for sparse datasets[C] //Processdings of the Pacific-asia Conference on Knowledge Discovery & Data Mining.Jeju, Korea: Springer, 2017: 196-207.
[11] ZIDA S, FOURNIER-VIGER P, LIN C W, et al. EFIM: a fast and memory efficient algorithm for highutility itemset mining[J]. Knowledge & Information Systems, 2017, 51(2): 1-31.
[12] LIN C W, PIROUZ M, DJENOURI Y, et al. Incrementally updating the high average-utility patterns with pre-large concept[J]. Applied Intelligence, 2020, 50(12): 3788-3807.
[13] AHMED C F, TANBEER S K, JEONG B S, et al.Efficient tree structures for high utility pattern mining in incremental databases[J]. IEEE Transactions on Knowledge and Data Engineering, 2009, 21(12): 1708-1721.
[14] LIU M, QU J. Mining high utility itemsets without candidate generation[C] //Processdings of the ACM International Conference on Information and Knowledge Management. Hawaii, USA: ACM, 2012: 55-64.
[15] RYANG H, YUN U. Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques[J]. Knowledge and Information Systems, 2016, 51(2): 627-659.
[16] LEE J, YUN U, LEE G, et al. Efficient incremental high utility pattern mining based on pre-large concept[J]. Engineering Applications of Artificial Intelligence: the International Journal of Intelligent Real-Time Automation, 2018, 72: 111-123.
[17] HONG T P, WANG C Y, TAO Y H, et al. A new incremental data mining algorithm using pre-large itemsets[J]. Intelligent Data Analysis, 2001, 5(2): 111-129.
[18] LIN C W, HONG T P, LAN G C, et al. Incrementally mining high utility patterns based on pre-large concept[J]. Applied Intelligence, 2014, 40(2): 343-357.
[19] LIN C W, GAN W, HONG T P, et al. An incremental high-utility mining algorithm with transaction insertion[J]. The Scientific World Journal, 2015:161564.
[20] UY A, HN A, GL A, et al. Efficient approach for incremental high utility pattern mining with indexed list structure[J]. Future Generation Computer Systems, 2019, 95: 221-239.
[21] 张春砚,韩萌,孙蕊,等.基于紧凑效用列表的增量高效用模式挖掘方法[J]. 山东大学学报(工学版), 2021, 51(2): 122-128. ZHANG Chunyan, HAN Meng, SUN Rui, et al. Incremental high utility pattern mining method based on compact utility list[J]. Journal of Shandong University(Engineering Science), 2021, 51(2): 122-128.
[22] DAWAR S. A hybrid framework for mining high-utility itemsets in a sparse transaction database[J]. Applied Intelligence, 2017, 47(3): 809-827.
[23] KRISHNAMOORTHY S. HMiner: efficiently mining high utility itemsets[J]. Expert Systems with Applications, 2017, 90: 168-183.
[24] FOURNIER-VIGER P, GOMARIZ A, GUENICHE T, et al. SPMF: a java open-source pattern mining library[J]. Journal of Machine Learning Research, 2014, 15(1):3389-3393.
[1] Jucheng YANG,Shujie HAN,Lei MAO,Xiangzi DAI,Yarui CHEN. Review of capsule network [J]. Journal of Shandong University(Engineering Science), 2019, 49(6): 1-10.
[2] Bo FANG,Hongmei CHEN. A novel double strategies evolutionary fruit fly optimization algorithm [J]. Journal of Shandong University(Engineering Science), 2019, 49(3): 22-31.
[3] WU Hongyan, JI Junzhong. Flower pollination algorithm-based functional module detection in protein-protein interaction networks [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2018, 48(1): 21-30.
[4] ZHOU Zhijie, ZHAO Fujun, HU Changhua, WANG Li, FENG Zhichao, LIU Taoyuan. Failure prognosis method based on evidential reasoning for aerospace relay [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2017, 47(5): 22-29.
[5] REN Yongfeng, DONG Xueyu. An image saliency object detection algorithm based on adaptive manifold similarity [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2017, 47(3): 56-62.
[6] ZHAI Jiyou, ZHOU Jingbo, REN Yongfeng, WANG Zhijian. A visual saliency detection based on background and foreground interaction [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2017, 47(2): 80-85.
[7] WU Huimin, WU Jingli. An improved cycle basis algorithm for haplotyping a diploid individual [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2016, 46(4): 9-14.
[8] WANG Lihong, LI Qiang. A selective ensemble method for traveling salesman problems [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2016, 46(1): 42-48.
[9] REN Yongfeng, ZHOU Jingbo. An image saliency object detection algorithm based on information diffusion [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2015, 45(6): 1-6.
[10] WEN Zhi-qiang, ZHU Wen-qiu, HU Yong-xiang. A classification method of halftone image [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2013, 43(4): 7-12.
[11] XU Shan-shan, LIU Ying-an*, XU Sheng. The enhancement algorithm of the boundary information in stereo matching [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2012, 42(6): 43-49.
[12] CHEN Ming-zhi1, 2, CHEN Jian3, XU Chun-yao3, YU Lun3, LIN Bo-gang1, 2. A new clustering algorithm for user access patterns based on network virtual environments [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2011, 41(6): 43-49.
[13] WU Tian-zhu . The blind color image watermarking algorithm based on the RBF neural networks [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2008, 38(2): 51-55 .
[14] ZHANG Jin-song,LI Qi-qiang,WANG Zhao-xia . Hybrid particle swarm optimization algorithm based on the chaos search [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2007, 37(1): 47-50 .
[15] JIA Yin-liang,ZHANG Huan-chun,JING Ya-zhi,LIU Jing . A sixstep algorithm for line drawing [J]. JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE), 2007, 37(1): 61-64 .
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!