{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:32:13Z","timestamp":1767904333995,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61172080"],"award-info":[{"award-number":["61172080"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61771357"],"award-info":[{"award-number":["61771357"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"DOI":"10.1007\/s10489-022-03722-x","type":"journal-article","created":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T08:03:57Z","timestamp":1657094637000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient mining high average-utility itemsets with effective pruning strategies and novel list structure"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4877-5975","authenticated-orcid":false,"given":"Gufeng","family":"Li","sequence":"first","affiliation":[]},{"given":"Tao","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Yinling","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,6]]},"reference":[{"key":"3722_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings 20th International Conference. Very Large Data Bases, VLDB. pp 487\u2013499"},{"issue":"12","key":"3722_CR2","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong B et al (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans on Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans on Knowl Data Eng"},{"key":"3722_CR3","doi-asserted-by":"crossref","unstructured":"Bouasker S, Ben Yahia S (2015) Key correlation mining by simultaneous monotone and anti-monotone constraints checking. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing. pp 851\u2013856","DOI":"10.1145\/2695664.2695802"},{"key":"3722_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ins.2018.04.008","volume":"453","author":"Y Djenouri","year":"2018","unstructured":"Djenouri Y, Belhadi A, Fournier-Viger P et al (2018) Fast and effective cluster-based information retrieval using frequent closed itemsets. Inf Sci 453:154\u2013167","journal-title":"Inf Sci"},{"key":"3722_CR5","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T et al (2014a) Spmf: A java open-source pattern mining library. http:\/\/www.philippe-fournier-viger.com\/spmf\/index.php"},{"key":"3722_CR6","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S et al (2014b) Fhm: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Andreasen T, Christiansen H, Cubero JC, et al (eds) Foundations of Intelligent Systems. Springer International Publishing. pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"1","key":"3722_CR7","first-page":"54","volume":"1","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger P, Lin JCW, Kiran RU et al (2017) A survey of sequential pattern mining. Data Sci Pattern Recognit 1(1):54\u201377","journal-title":"Data Sci Pattern Recognit"},{"key":"3722_CR8","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin J, Nkambou R et al (2019a) High-Utility Pattern Mining: Theory, Algorithms and Applications. Springer International Publishing","DOI":"10.1007\/978-3-030-04921-8"},{"key":"3722_CR9","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2018.12.070","volume":"481","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Zhang Y, Chun-Wei Lin J et al (2019b) Mining local and peak high utility itemsets. Inf Sci 481:344\u2013367","journal-title":"Inf Sci"},{"key":"3722_CR10","doi-asserted-by":"crossref","unstructured":"Gan W, Chun-Wei J, Chao H et al (2018) Coupm: Correlated utility-based pattern mining. In: 2018 IEEE International Conference on Big Data (Big Data). pp 2607\u20132616","DOI":"10.1109\/BigData.2018.8622242"},{"issue":"3","key":"3722_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3314107","volume":"13","author":"W Gan","year":"2019","unstructured":"Gan W, Lin JCW, Fournier-Viger P et al (2019) A survey of parallel sequential pattern mining. ACM Trans Knowl Discov Data 13(3):1\u201334","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"2","key":"3722_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, YJAsr Yin (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Record 29(2):1\u201312","journal-title":"ACM SIGMOD Record"},{"key":"3722_CR13","unstructured":"Han J, Pei J, Kamber M (2011) Data mining: concepts and techniques. Elsevier"},{"issue":"7","key":"3722_CR14","doi-asserted-by":"publisher","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"TP Hong","year":"2011","unstructured":"Hong T P, Lee C H, Wang S L (2011) Effective utility mining with the measure of average utility. Expert Syst Appl 38(7):8259\u20138265","journal-title":"Expert Syst Appl"},{"key":"3722_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","volume":"543","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y et al (2021) Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inf Sci 543:85\u2013105","journal-title":"Inf Sci"},{"key":"3722_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","volume":"90","author":"S Krishnamoorthy","year":"2017","unstructured":"Krishnamoorthy S (2017) Hminer: Efficiently mining high utility itemsets. Expert Syst Appl 90:168\u2013183","journal-title":"Expert Syst Appl"},{"issue":"1","key":"3722_CR17","first-page":"193","volume":"28","author":"GC Lan","year":"2012","unstructured":"Lan GC, Hong TP, Tseng VSJJoIs, et al. (2012) A projection-based approach for discovering high average-utility itemsets. J Inf Sci Eng 28(1):193\u2013209","journal-title":"J Inf Sci Eng"},{"key":"3722_CR18","doi-asserted-by":"crossref","unstructured":"Lin CW, Hong TP, Lu WH (2010) Efficiently mining high average utility itemsets with a tree structure. In: Asian conference on intelligent information and database systems. Springer. pp 131\u2013139","DOI":"10.1007\/978-3-642-12145-6_14"},{"issue":"2","key":"3722_CR19","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Li T, Fournier-Viger P et al (2016) An efficient algorithm to mine high average-utility itemsets. Adv Eng Inform 30(2):233\u2013243","journal-title":"Adv Eng Inform"},{"key":"3722_CR20","doi-asserted-by":"publisher","first-page":"12,927","DOI":"10.1109\/ACCESS.2017.2717438","volume":"5","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Ren S, Fournier-Viger P et al (2017a) Ehaupm: Efficient high average-utility pattern mining with tighter upper bounds. IEEE Access 5:12,927\u201312,940","journal-title":"IEEE Access"},{"issue":"2","key":"3722_CR21","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10489-017-0896-1","volume":"47","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Ren S, Fournier-Viger P et al (2017b) A fast algorithm for mining high average-utility itemsets. Appl Intell 47(2):331\u2013346","journal-title":"Appl Intell"},{"issue":"10","key":"3722_CR22","doi-asserted-by":"publisher","first-page":"3691","DOI":"10.1007\/s10489-018-1180-8","volume":"48","author":"JCW Lin","year":"2018","unstructured":"Lin JCW, Shao Y, Fournier-Viger P et al (2018) Maintenance algorithm for high average-utility itemsets with transaction deletion. Appl Intell 48(10):3691\u20133706","journal-title":"Appl Intell"},{"key":"3722_CR23","doi-asserted-by":"crossref","unstructured":"Lin JCW, Pirouz M, Djenouri Y et al (2020) Incrementally updating the high average-utility patterns with pre-large concept. Applied Intelligence","DOI":"10.1007\/s10489-020-01743-y"},{"key":"3722_CR24","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM international conference on Information and knowledge management. pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"3722_CR25","doi-asserted-by":"crossref","unstructured":"Liu Y, Wk Liao, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Pacific-asia conference on knowledge discovery and data mining. Springer berlin heidelberg, advances in knowledge discovery and data mining. pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"key":"3722_CR26","doi-asserted-by":"crossref","unstructured":"Lu T, Vo B, Nguyen HT et al (2015) A new method for mining high average utility itemsets. In: IFIP international conference on computer information systems and industrial management, Springer. pp 33\u201342","DOI":"10.1007\/978-3-662-45237-0_5"},{"key":"3722_CR27","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen LTT, Vu VV, Lam MTH et al (2019) An efficient method for mining high utility closed itemsets. Inf Sci 495:78\u201399","journal-title":"Inf Sci"},{"key":"3722_CR28","doi-asserted-by":"crossref","unstructured":"Nguyen LTT, Nguyen TD, Nguyen A et al (2020) Efficient method for mining high-utility itemsets using high-average utility measure. In: International conference on computational collective intelligence, Springer. pp 305\u2013315","DOI":"10.1007\/978-3-030-63007-2_24"},{"key":"3722_CR29","doi-asserted-by":"crossref","unstructured":"Sethi KK, Ramesh D (2020) A fast high average-utility itemset mining with efficient tighter upper bounds and novel list structure. The journal of supercomputing","DOI":"10.1007\/s11227-020-03247-5"},{"key":"3722_CR30","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ins.2014.03.074","volume":"278","author":"SJ Shin","year":"2014","unstructured":"Shin SJ, Lee DS, Lee WSJIS (2014) Cp-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams. Inf Sci 278:559\u2013576","journal-title":"Inf Sci"},{"issue":"6","key":"3722_CR31","doi-asserted-by":"publisher","first-page":"e12","DOI":"10.1111\/exsy.12296","volume":"35","author":"K Singh","year":"2018","unstructured":"Singh K, Shakya HK, Singh A et al (2018) Mining of high-utility itemsets with negative utility. Expert Systems 35(6):e12\u2013296","journal-title":"Expert Systems"},{"key":"3722_CR32","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ins.2019.01.056","volume":"484","author":"K Singh","year":"2019","unstructured":"Singh K, Kumar A, Singh SS et al (2019) Ehnl: an efficient algorithm for mining high utility itemsets with negative utility value and length constraints. Inf Sci 484:44\u201370","journal-title":"Inf Sci"},{"key":"3722_CR33","doi-asserted-by":"crossref","unstructured":"Song W, Liu l, Huang C (2021) Generalized maximal utility for mining high average-utility itemsets. Knowledge and Information Systems","DOI":"10.1007\/s10115-021-01614-z"},{"key":"3722_CR34","doi-asserted-by":"crossref","unstructured":"Szathmary L, Napoli A, Valtchev P (2007) Towards rare itemset mining. In: 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007). vol 1. IEEE, pp 305\u2013 312","DOI":"10.1109\/ICTAI.2007.30"},{"key":"3722_CR35","doi-asserted-by":"crossref","unstructured":"Truong T, Duong H, Le B et al (2019a) Efficient vertical mining of high average-utility itemsets based on novel upper-bounds. IEEE Trans Knowl Data Eng 31(2):301\u2013314","DOI":"10.1109\/TKDE.2018.2833478"},{"key":"3722_CR36","doi-asserted-by":"crossref","unstructured":"Truong T, Duong H, Le B et al (2019b) Efficient high average-utility itemset mining using novel vertical weak upper-bounds. Knowledge-Based Systems 183:104\u2013847","DOI":"10.1016\/j.knosys.2019.07.018"},{"key":"3722_CR37","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu CW, Shie BE et al (2010) Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining. pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"issue":"8","key":"3722_CR38","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng VS, Shie B, Wu C et al (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3722_CR39","doi-asserted-by":"crossref","unstructured":"Uno T, Kiyomi M, Arimura H (2004) Lcm ver 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Fimi","DOI":"10.1145\/1133905.1133916"},{"issue":"5","key":"3722_CR40","doi-asserted-by":"publisher","first-page":"5831","DOI":"10.3233\/JIFS-179670","volume":"38","author":"JMT Wu","year":"2020","unstructured":"Wu JMT, Teng Q, Lin JCW et al (2020) Updating high average-utility itemsets with pre-large concept. J Intell Fuzzy Syst 38(5):5831\u20135840","journal-title":"J Intell Fuzzy Syst"},{"key":"3722_CR41","doi-asserted-by":"crossref","unstructured":"Wu JMT, Li Z, Srivastava G et al (2021) Analytics of high average-utility patterns in the industrial internet of things. Applied Intelligence","DOI":"10.1007\/s10489-021-02751-2"},{"key":"3722_CR42","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Proceedings of the 2004 SIAM international conference on data mining. SIAM. pp 482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"key":"3722_CR43","doi-asserted-by":"crossref","unstructured":"Yen SJ, Lee YS, Wu CW et al (2009) An efficient algorithm for maintaining frequent closed itemsets over data stream. In: International conference on industrial, engineering and other applications of applied intelligent systems. Springer. pp 767\u2013776","DOI":"10.1007\/978-3-642-02568-6_78"},{"key":"3722_CR44","doi-asserted-by":"publisher","first-page":"144,245","DOI":"10.1109\/ACCESS.2019.2945840","volume":"7","author":"I Yildirim","year":"2019","unstructured":"Yildirim I, Celik M (2019) An efficient tree-based algorithm for mining high average-utility itemset. IEEE Access 7:144,245\u2013144,263","journal-title":"IEEE Access"},{"key":"3722_CR45","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.future.2016.10.027","volume":"68","author":"U Yun","year":"2017","unstructured":"Yun U, Kim D (2017) Mining of high average-utility itemsets using novel list structure and pruning strategy. Futur Gener Comput Syst 68:346\u2013360","journal-title":"Futur Gener Comput Syst"},{"key":"3722_CR46","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.future.2019.09.024","volume":"103","author":"U Yun","year":"2020","unstructured":"Yun U, Nam H, Kim J, et al. (2020) Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases. Futur Gener Comput Syst 103:58\u201378","journal-title":"Futur Gener Comput Syst"},{"issue":"3","key":"3722_CR47","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki M J (2000) Scalable algorithms for association mining. IEEE Trans on Knowl and Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans on Knowl and Data Eng"},{"key":"3722_CR48","doi-asserted-by":"crossref","unstructured":"Zida S, Fournier-Viger P, Lin JCW et al (2015) Efim: a highly efficient algorithm for high-utility itemset mining. In: Mexican international conference on artificial intelligence. Springer international publishing, advances in Artificial Intelligence and Soft Computing. pp 530\u2013546","DOI":"10.1007\/978-3-319-27060-9_44"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03722-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03722-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03722-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T08:17:09Z","timestamp":1657095429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03722-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":48,"alternative-id":["3722"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03722-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"5 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}