{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T01:12:39Z","timestamp":1770167559306,"version":"3.49.0"},"reference-count":45,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T00:00:00Z","timestamp":1583884800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2020,5,29]]},"abstract":"<jats:p>\u00a0HAUIM (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.<\/jats:p>","DOI":"10.3233\/jifs-179670","type":"journal-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T13:03:52Z","timestamp":1584104632000},"page":"5831-5840","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":13,"title":["Updating high average-utility itemsets with pre-large concept"],"prefix":"10.1177","volume":"38","author":[{"given":"Jimmy Ming-Tai","family":"Wu","sequence":"first","affiliation":[{"name":"College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China"}]},{"given":"Qian","family":"Teng","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao, China"}]},{"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Electrical Engineering and Mathematical Sciences, Western Norway University of Applied Sciences, Bergen, Norway"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Sejong University, Seoul, Korea"}]},{"given":"Hsing-Chung","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, Asia University, Taichung, Taiwan"}]}],"member":"179","published-online":{"date-parts":[[2020,3,11]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"487","volume-title":"The International Conference on Very Large Data Bases","author":"Agrawal R.","year":"1994","unstructured":"AgrawalR., SrikantR., Fast algorithms for mining association rules in large databases, The International Conference on Very Large Data Bases, 1994, pp. 487\u2013499."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-68125-0_50","volume-title":"The Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining","author":"Erwin A.","year":"2008","unstructured":"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\u2013561."},{"key":"e_1_3_2_5_2","first-page":"106","volume-title":"The International Conference on Data Engineering","author":"Cheung D.W.","year":"1996","unstructured":"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\u2013114."},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/69.683753","article-title":"Efficient data mining for path traversal patterns","volume":"10","author":"Chen M.S.","year":"1998","unstructured":"ChenM.S., ParkJ.S., YuP.S., Efficient data mining for path traversal patterns, IEEE Transactions of Knowledge and Data Engineering10 (1998), 209\u2013221.","journal-title":"IEEE Transactions of Knowledge and Data Engineering"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2891105"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","article-title":"Fast mining frequent itemsets using nodesets","volume":"41","author":"Deng Z.H.","year":"2014","unstructured":"DengZ.H., LvS.L., Fast mining frequent itemsets using nodesets, Expert Systems with Applications41 (2014), 4505\u20134512.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"e_1_3_2_10_2","article-title":"A survey of parallel sequential pattern mining","volume":"3","author":"Gan W.","year":"2019","unstructured":"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.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"e_1_3_2_11_2","article-title":"A survey of utility-oriented pattern mining","author":"Gan W.","year":"2019","unstructured":"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.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.04.009"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2001-5203"},{"key":"e_1_3_2_15_2","first-page":"421","volume-title":"The International Symposium on Pervasive Systems, Algorithms, and Networks","author":"Hong T.P.","year":"2009","unstructured":"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\u2013425."},{"key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","article-title":"Effective utility mining with the measure of average utility","volume":"38","author":"Hong T.P.","year":"2011","unstructured":"HongT.P., LeeC.H., WangS.L., Effective utility mining with the measure of average utility, Expert Systems with Applications38 (2011), 8259\u20138265.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1089827.1089839","article-title":"A fast high utility itemsets mining algorithm","author":"Liu Y.","year":"2005","unstructured":"LiuY., LiaoW.K., ChoudharyA., A fast high utility itemsets mining algorithm, The International Workshop on Utility-Based Data Mining, 2005, pp. 90\u201399.","journal-title":"The International Workshop on Utility-Based Data Mining"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"The Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining","author":"Liu Y.","year":"2005","unstructured":"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\u2013695."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-140682"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.03.014"},{"key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"7173","DOI":"10.1016\/j.eswa.2012.01.072","article-title":"An incremental mining algorithm for high utility itemsets","volume":"39","author":"Lin C.W.","year":"2009","unstructured":"LinC.W., LanG.C., HongT.P., An incremental mining algorithm for high utility itemsets, Expert Systems with Applications39 (2009), 7173\u20137180.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-642-12145-6_14","volume-title":"The Asian Conference on Intelligent Information and Database Systems","author":"Lin C.W.","year":"2010","unstructured":"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\u2013139."},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"7419","DOI":"10.1016\/j.eswa.2010.12.082","article-title":"An effective tree structure for mining high utility itemsets","volume":"38","author":"Lin C.W.","year":"2011","unstructured":"LinC.W., HongT.P., LuW.H., An effective tree structure for mining high utility itemsets, Expert Systems with Applications38 (2011), 7419\u20137424.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_24_2","first-page":"984","volume-title":"IEEE International Conference on Data Mining","author":"Liu J.","year":"2012","unstructured":"LiuJ., WangK., FungB.C.M., Direct discovery of high utility itemsets without candidate generation, IEEE International Conference on Data Mining, 2012, pp. 984\u2013989."},{"key":"e_1_3_2_25_2","first-page":"55","volume-title":"ACM International Conference on Information and Knowledge Management","author":"Liu M.","year":"2012","unstructured":"LiuM., QuJ., Mining high utility itemsets without candidate generation, ACM International Conference on Information and Knowledge Management, 2012, pp. 55\u201364."},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1142\/S0219622012500307","article-title":"Efficient mining high average-utility itemsets with an improved upper-bound strategy","volume":"11","author":"Lan G.C.","year":"2012","unstructured":"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\u20131030.","journal-title":"International Journal of Information Technology & Decision Making"},{"key":"e_1_3_2_27_2","first-page":"33","article-title":"A new method for mining high average utility itemsets","author":"Lu T.","year":"2014","unstructured":"LuT., VoB., NguyenH.T., HongT.P., A new method for mining high average utility itemsets, Computer Information Systems and Industrial Management, 2014, pp. 33\u201342.","journal-title":"Computer Information Systems and Industrial Management"},{"key":"e_1_3_2_28_2","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1109\/TKDE.2015.2510012","article-title":"Mining high utility patterns in one phase without generating candidates","volume":"28","author":"Liu J.","year":"2016","unstructured":"LiuJ., WangK., FungB.C.M., Mining high utility patterns in one phase without generating candidates, IEEE Transactions on Knowledge and Data Engineering28 (2016), 1245\u20131257.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2016.04.002"},{"key":"e_1_3_2_30_2","doi-asserted-by":"crossref","first-page":"12927","DOI":"10.1109\/ACCESS.2017.2717438","article-title":"EHAUPM: efficient high average-utility pattern mining with tighter upper-bound models","volume":"5","author":"Lin J.C.W.","year":"2017","unstructured":"LinJ.C.W., RenS., Fournier-VigerP., HongT.P., EHAUPM: efficient high average-utility pattern mining with tighter upper-bound models, IEEE Access5 (2017), 12927\u201312940.","journal-title":"IEEE Access"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.03.021"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-18883"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-179061"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"e_1_3_2_35_2","article-title":"High-utility itemset mining with effective pruning strategies","volume":"13","author":"Wu J.M.T.","year":"2019","unstructured":"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.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1080\/02533839.2018.1537807"},{"key":"e_1_3_2_37_2","first-page":"215","volume-title":"SIAM International Conference on Data Mining","author":"Yao H.","year":"2004","unstructured":"YaoH., HamiltonH.J., ButzC.J., A foundational approach to mining itemset utilities from databases, SIAM International Conference on Data Mining, 2004, pp. 215\u2013221."},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-540-74553-2_26","volume-title":"The International Conference on Data Warehousing and Knowledge Discovery","author":"Yen S.J.","year":"2007","unstructured":"YenS.J., LeeY.S., Mining high utility quantitative association rules, The International Conference on Data Warehousing and Knowledge Discovery, 2007, pp. 283\u2013292."},{"key":"e_1_3_2_39_2","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","article-title":"\u201cEFIM: a fast and memory efficient algorithm for high-utility itemset mining,\u201d","volume":"51","author":"Zida S.","year":"2017","unstructured":"ZidaS., Fournier-VigerP., LinJ.C.W., WuC.W., TsengV.S., \u201cEFIM: a fast and memory efficient algorithm for high-utility itemset mining,\u201d, Knowledge and Information Systems51 (2017), 595\u2013625.","journal-title":"Knowledge and Information Systems"},{"key":"e_1_3_2_40_2","first-page":"1717","article-title":"\u03b1-Fraction first strategy for hierarchical model in wireless sensor networks","volume":"19","author":"Pan J.S.","year":"2018","unstructured":"PanJ.S., KongL., SungT.W., TsaiP.W., Sn\u00e3\u0161elV., \u03b1-Fraction first strategy for hierarchical model in wireless sensor networks, Journal of Internet Technology19 (2018), 1717\u20131726.","journal-title":"Journal of Internet Technology"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.01.006"},{"key":"e_1_3_2_42_2","doi-asserted-by":"crossref","first-page":"12832","DOI":"10.1109\/ACCESS.2019.2893292","article-title":"HARD-DE:hierarchical aRchive based mutation strategy with depth information of evolution for the enhancement of differential evolution on numerical optimization","volume":"7","author":"Meng Z","year":"2019","unstructured":"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\u201312854.","journal-title":"IEEE Access"},{"key":"e_1_3_2_43_2","article-title":"An anonymous entropy-based location privacy protection scheme in mobile social networks","volume":"1","author":"Ni L.","year":"2019","unstructured":"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.","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"e_1_3_2_44_2","first-page":"1","article-title":"An unsupervised strategy for defending against multifarious reputation attacks","author":"Wang X.","year":"2019","unstructured":"WangX., JiS.J., LiangY.Q., LeungH.F., ChiuD.K.W., An unsupervised strategy for defending against multifarious reputation attacks, Applied Intelligence (2019), 1\u201322.","journal-title":"Applied Intelligence"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.09.002"},{"key":"e_1_3_2_46_2","first-page":"1","article-title":"A secure authenticated and key exchange scheme for fog computing","volume":"0","author":"Chen C.M.","year":"2020","unstructured":"ChenC.M., HuangY., WangK.H, KumariS. and WuM.E., A secure authenticated and key exchange scheme for fog computing, Enterprise Information Systems0 (2020), 1\u201316.","journal-title":"Enterprise Information Systems"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179670","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-179670","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179670","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T12:29:44Z","timestamp":1770121784000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-179670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,11]]},"references-count":45,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5,29]]}},"alternative-id":["10.3233\/JIFS-179670"],"URL":"https:\/\/doi.org\/10.3233\/jifs-179670","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,11]]}}}