HAUIM (High Average-Utility Itemset Mining) is a variation of HUIM (High-Utility Itemset Mining) that provides a reliable measure to reveal utility patterns in light of the length of the mined pattern. Several works have been studied to improve mining efficiency by designing multiple pruning strategies and efficient frameworks, but fewer studies have centered on the sophisticated database maintenance algorithm. Existing works still have to rescan the databases multiple times when it is necessary. We first use the pre-large principle in this paper to efficiently update the newly discovered HAUIs. For further updates and maintenance on the basis of the two thresholds, the Pre-large Average Utility Itemset (PAUI) can be maintained to increase the mining performance. Experiments will then be performed to compare the batch model, the Fast-Updated (FUP)-based model, and the Apriori-like HAUIM (APHAUIM) model designed in respect of the number of maintenance patterns, scalability, runtime, and memory usage.
AgrawalR., SrikantR., Fast algorithms for mining association rules in large databases, The International Conference on Very Large Data Bases, 1994, pp. 487–499.
2.
AhmedC.F., TanbeerS.K., JeongB.S., LeeY.K., Efficient tree structures for high utility pattern mining in incremental databases, IEEE Transactions on Knowledge and Data Engineering21 (2009), 1708–1721.
3.
ErwinA., GopalanR.P., AchuthanN.R., Efficient mining of high utility itemsets from large datasets, The Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, 2008, pp. 554–561.
4.
CheungD.W., WongC.Y., HanJ., NgV.T., Maintenance of discovered association rules in large databases: an incremental updating techniques, The International Conference on Data Engineering, 1996, pp. 106–114.
5.
ChenM.S., ParkJ.S., YuP.S., Efficient data mining for path traversal patterns, IEEE Transactions of Knowledge and Data Engineering10 (1998), 209–221.
6.
ChenC.M., XiangB., LiuY., WangK.H., A secure authentication protocol for internet of vehicles, IEEE Access7 (2019), 12047–12057.
7.
DengZ.H., LvS.L., Fast mining frequent itemsets using nodesets, Expert Systems with Applications41 (2014), 4505–4512.
8.
Fournier-VigerP., LinJ.C.W., GomarizA., GuenicheT., SoltaniA., DengZ., LamH.T., The SPMF open-source data mining library version 2, Joint European Conference on Machine Learning and Knowledge Discovery in Databases, 2016, pp. 36–40.
9.
GanW., LinJ.C.W., Fournier-VigerP., ChaoH.C., YuP.S., A survey of parallel sequential pattern mining, ACM Transactions on Knowledge Discovery from Data3 (2019), Article 25.
10.
GanW., LinJ.C.W., Fournier-VigerP., ChaoH.C., TsengV.S., YuP.S., A survey of utility-oriented pattern mining, IEEE Transactions on Knowledge and Data Engineering, 2019.
11.
HanJ., PeiJ., YinY., MaoR., Mining frequent patterns without candidate generation: a frequent-pattern tree approach, Data Mining and Knowledge Discovery8 (2004), 53–87.
12.
HongT.P., LinC.W., WuY.L., Incrementally fast updated frequent pattern trees, Expert Systems with Applications34 (2008), 2424–2435.
13.
HongT.P., WangC.Y., TaoY.H., A new incremental data mining algorithm using pre-large itemsets, Intelligent Data Analysis5 (2001), 111–129.
14.
HongT.P., LeeC.H., WangS.L., An incremental mining algorithm for high average-utility itemsets, The International Symposium on Pervasive Systems, Algorithms, and Networks, 2009, pp. 421–425.
15.
HongT.P., LeeC.H., WangS.L., Effective utility mining with the measure of average utility, Expert Systems with Applications38 (2011), 8259–8265.
16.
LiuY., LiaoW.K., ChoudharyA., A fast high utility itemsets mining algorithm, The International Workshop on Utility-Based Data Mining, 2005, pp. 90–99.
17.
LiuY., LiaoW.K., ChoudharyA., A two-phase algorithm for fast discovery of high utility itemsets, The Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, 2005, pp. 689–695.
18.
LinC.W., HongT.P., LinW.Y., LanG. C, Efficient updating of sequential patterns with transaction insertion, Intelligent Data Analysis18 (2014), 1013–1026.
19.
LinC.W., HongT.P., LuW.H., The Pre-FUFP algorithm for incremental mining, Expert Systems with Applications36 (2009), 9498–9505.
20.
LinC.W., LanG.C., HongT.P., An incremental mining algorithm for high utility itemsets, Expert Systems with Applications39 (2009), 7173–7180.
21.
LinC.W., HongT.P., LuW.H., Efficiently mining high average utility itemsets with a tree structure, The Asian Conference on Intelligent Information and Database Systems, 2010, pp. 131–139.
22.
LinC.W., HongT.P., LuW.H., An effective tree structure for mining high utility itemsets, Expert Systems with Applications38 (2011), 7419–7424.
23.
LiuJ., WangK., FungB.C.M., Direct discovery of high utility itemsets without candidate generation, IEEE International Conference on Data Mining, 2012, pp. 984–989.
24.
LiuM., QuJ., Mining high utility itemsets without candidate generation, ACM International Conference on Information and Knowledge Management, 2012, pp. 55–64.
25.
LanG.C., HongT.P., TsengV.S., Efficient mining high average-utility itemsets with an improved upper-bound strategy, International Journal of Information Technology & Decision Making11 (2012), 1009–1030.
26.
LuT., VoB., NguyenH.T., HongT.P., A new method for mining high average utility itemsets, Computer Information Systems and Industrial Management, 2014, pp. 33–42.
27.
LiuJ., WangK., FungB.C.M., Mining high utility patterns in one phase without generating candidates, IEEE Transactions on Knowledge and Data Engineering28 (2016), 1245–1257.
28.
LinC.W., LiT., Fournier-VigerP., HongT.P., ZhanJ., VoznakM., An efficient algorithm to mine high average-utility itemsets, Advanced Engineering Informatics30 (2016), 233–243.
29.
LinJ.C.W., RenS., Fournier-VigerP., HongT.P., EHAUPM: efficient high average-utility pattern mining with tighter upper-bound models, IEEE Access5 (2017), 12927–12940.
30.
LinJ.C.W., RenS., Fournier-VigerP., PanJ.S., HongT.P., Efficiently updating the discovered high average-utility itemsets with transaction insertion, Engineering Applications of Artificial Intelligence72 (2018), 136–149.
31.
LiC., YanB., TangM., YiJ., ZhangX., Data driven hybrid fuzzy model for short-term traffic flow prediction, Journal of Intelligent & Fuzzy Systems35 (2018), 6525–6536.
32.
LingZ., ZengruiT., MetawaN., Data mining-based competency model of innovation and entrepreneurship, Journal of Intelligent & Fuzzy Systems37 (2019), 35–43.
33.
TsengV.S., ShieB.E., WuC.W., YuP.S., Efficient algorithms for mining high utility itemsets from transactional databases, IEEE Transactions on Knowledge and Data Engineering25 (2013), 1772–1786.
34.
WuJ.M.T., LinJ.C.W., TamrakarA., High-utility itemset mining with effective pruning strategies, ACM Transactions on Knowledge Discovery from Data13 (2019), Article 58.
35.
WuT.Y., ChenC.M., WangK.H., MengC., WangE.K., A provably secure certificateless public key encryption with keyword search, Journal of the Chinese Institute of Engineers42 (2019), 20–28.
36.
YaoH., HamiltonH.J., ButzC.J., A foundational approach to mining itemset utilities from databases, SIAM International Conference on Data Mining, 2004, pp. 215–221.
37.
YenS.J., LeeY.S., Mining high utility quantitative association rules, The International Conference on Data Warehousing and Knowledge Discovery, 2007, pp. 283–292.
38.
ZidaS., Fournier-VigerP., LinJ.C.W., WuC.W., TsengV.S., “EFIM: a fast and memory efficient algorithm for high-utility itemset mining,”, Knowledge and Information Systems51 (2017), 595–625.
39.
PanJ.S., KongL., SungT.W., TsaiP.W., SnãšelV., α-Fraction first strategy for hierarchical model in wireless sensor networks, Journal of Internet Technology19 (2018), 1717–1726.
40.
MengZ,
PanJ.S. and TsengK.K., PaDE: An enhanced differential evolution algorithm with novel control parameter adaptation schemes for numerical optimization, Knowledge-Based Systems168 (2019), 80–99.
41.
MengZ and
PanJ.S.,
HARD-DE:hierarchical aRchive based mutation strategy with depth information of evolution for the enhancement of differential evolution on numerical optimization, IEEE Access7 (2019), 12832–12854.
42.
NiL., TianF., NiQ., YanY., ZhangJ., An anonymous entropy-based location privacy protection scheme in mobile social networks, EURASIP Journal on Wireless Communications and Networking1 (2019), Article 93.
43.
WangX., JiS.J., LiangY.Q., LeungH.F., ChiuD.K.W., An unsupervised strategy for defending against multifarious reputation attacks, Applied Intelligence (2019), 1–22.
44.
ZhaoZ., L.C., ZhangX., ChiclanaF., HerreraE., An incremental methodto detect communities in dynamic evolving social networks, Applied Intelligence, Knowledge-Based Systems163 (2019), 404–415.
45.
ChenC.M., HuangY., WangK.H,
KumariS. and
WuM.E., A secure authenticated and key exchange scheme for fog computing, Enterprise Information Systems0 (2020), 1–16.
