{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:08:37Z","timestamp":1778645317787,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T00:00:00Z","timestamp":1662768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T00:00:00Z","timestamp":1662768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62062004"],"award-info":[{"award-number":["62062004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Postgraduate Innovation Project of North Minzu University","award":["YCX21082"],"award-info":[{"award-number":["YCX21082"]}]},{"name":"Computer Application Technology Autonomous Region Key Discipline Project","award":["PY1902"],"award-info":[{"award-number":["PY1902"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10489-022-03876-8","type":"journal-article","created":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T07:02:41Z","timestamp":1662793361000},"page":"11750-11767","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Mining closed high utility patterns with negative utility in dynamic databases"],"prefix":"10.1007","volume":"53","author":[{"given":"Meng","family":"Han","sequence":"first","affiliation":[]},{"given":"Ni","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Le","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaojuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Haodong","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,10]]},"reference":[{"issue":"12","key":"3876_CR1","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 BS, et al. (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"3876_CR2","first-page":"767","volume":"215","author":"CJ Chu","year":"2009","unstructured":"Chu CJ, Tseng VS, Liang T (2009) An efficient algorithm for mining high utility itemsets with negative item values in large databases. Appl Math Comput 215(2):767\u2013778","journal-title":"Appl Math Comput"},{"issue":"2","key":"3876_CR3","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s11704-016-6245-4","volume":"13","author":"TL Dam","year":"2019","unstructured":"Dam TL, Li K, Fournier-Viger P, et al. (2019) Cls-miner: efficient and effective closed high-utility itemset mining. Front Comput Sci 13(2):357\u2013381","journal-title":"Front Comput Sci"},{"key":"3876_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.knosys.2018.11.019","volume":"165","author":"TL Dam","year":"2019","unstructured":"Dam TL, Ramampiaro H, N\u00f8rv\u00e5g K, et al. (2019) Towards efficiently mining closed high utility itemsets from incremental databases. Knowl-Based Syst 165:13\u201329","journal-title":"Knowl-Based Syst"},{"key":"3876_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2017.08.043","volume":"420","author":"Y Djenouri","year":"2017","unstructured":"Djenouri Y, Comuzzi M (2017) Combining apriori heuristic and bio-inspired algorithms for solving the frequent itemsets mining problem. Inf Sci 420:1\u201315","journal-title":"Inf Sci"},{"key":"3876_CR6","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S (2015) Foshu: faster on-shelf high utility itemset mining\u2013with or without negative unit profit. In: Proceedings of the 30th annual ACM symposium on applied computing, pp 857\u2013864","DOI":"10.1145\/2695664.2695823"},{"key":"3876_CR7","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S et al (2014) Fhm: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: International symposium on methodologies for intelligent systems. Springer, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"3876_CR8","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Gueniche T, et al. (2015) Efficient incremental high utility itemset mining. In: Proceedings of the ASE BigData & SocialInformatics, vol 2015, pp 1\u20136","DOI":"10.1145\/2818869.2818887"},{"key":"3876_CR9","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S, Lin JCW et al (2016) Efim-closed: fast and memory efficient discovery of closed high-utility itemsets. In: International conference on machine learning and data mining in pattern recognition. Springer, pp 199\u2013213","DOI":"10.1007\/978-3-319-41920-6_15"},{"key":"3876_CR10","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.ins.2020.08.028","volume":"557","author":"X Han","year":"2021","unstructured":"Han X, Liu X, Li J, et al. (2021) Efficient top-k high utility itemset mining on massive data. Inf Sci 557:382\u2013406","journal-title":"Inf Sci"},{"issue":"1","key":"3876_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s10489-016-0890-z","volume":"47","author":"D Kim","year":"2017","unstructured":"Kim D, Yun U (2017) Efficient algorithm for mining high average-utility itemsets in incremental transaction databases. Appl Intell 47(1):114\u2013131","journal-title":"Appl Intell"},{"key":"3876_CR12","doi-asserted-by":"publisher","first-page":"115,122","DOI":"10.1016\/j.eswa.2021.115122","volume":"181","author":"GJ Krishna","year":"2021","unstructured":"Krishna GJ, Ravi V (2021) High utility itemset mining using binary differential evolution: an application to customer segmentation. Expert Syst Appl 181:115,122","journal-title":"Expert Syst Appl"},{"issue":"7","key":"3876_CR13","doi-asserted-by":"publisher","first-page":"3450","DOI":"10.1016\/j.eswa.2013.10.049","volume":"41","author":"GC Lan","year":"2014","unstructured":"Lan GC, Hong TP, Huang JP, et al. (2014) On-shelf utility mining with negative item values. Expert Syst Appl 41(7):3450\u20133459","journal-title":"Expert Syst Appl"},{"issue":"8","key":"3876_CR14","doi-asserted-by":"publisher","first-page":"7173","DOI":"10.1016\/j.eswa.2012.01.072","volume":"39","author":"CW Lin","year":"2012","unstructured":"Lin CW, Lan GC, Hong TP (2012) An incremental mining algorithm for high utility itemsets. Expert Syst Appl 39(8):7173\u20137180","journal-title":"Expert Syst Appl"},{"key":"3876_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.knosys.2016.08.022","volume":"111","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Fournier-Viger P, Gan W (2016) Fhn: an efficient algorithm for mining high-utility itemsets with negative unit profits. Knowl-Based Syst 111:283\u2013298","journal-title":"Knowl-Based Syst"},{"key":"3876_CR16","doi-asserted-by":"publisher","first-page":"107,422","DOI":"10.1016\/j.asoc.2021.107422","volume":"108","author":"JCW Lin","year":"2021","unstructured":"Lin JCW, Djenouri Y, Srivastava G, et al. (2021) A predictive ga-based model for closed high-utility itemset mining. Appl Soft Comput 108:107,422","journal-title":"Appl Soft Comput"},{"key":"3876_CR17","doi-asserted-by":"publisher","first-page":"114,546","DOI":"10.1016\/j.eswa.2020.114546","volume":"170","author":"C Liu","year":"2021","unstructured":"Liu C, Guo C (2021) Mining top-n high-utility operation patterns for taxi drivers. Expert Syst Appl 170:114,546","journal-title":"Expert Syst Appl"},{"key":"3876_CR18","doi-asserted-by":"publisher","first-page":"74,168","DOI":"10.1109\/ACCESS.2019.2919524","volume":"7","author":"J Liu","year":"2019","unstructured":"Liu J, Ju X, Zhang X, et al. (2019) Incremental mining of high utility patterns in one phase by absence and legacy-based pruning. IEEE Access 7:74,168\u201374,180","journal-title":"IEEE Access"},{"issue":"1","key":"3876_CR19","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10489-019-01524-2","volume":"50","author":"X Liu","year":"2020","unstructured":"Liu X, Wen S, Zuo W (2020) Effective sanitization approaches to protect sensitive knowledge in high-utility itemset mining. Appl Intell 50(1):169\u2013191","journal-title":"Appl Intell"},{"key":"3876_CR20","doi-asserted-by":"publisher","first-page":"101,924","DOI":"10.1016\/j.datak.2021.101924","volume":"135","author":"SM Mirbagheri","year":"2021","unstructured":"Mirbagheri SM, Hamilton HJ (2021) Mining high utility patterns in interval-based event sequences. Data Knowl Eng 135:101,924","journal-title":"Data Knowl Eng"},{"issue":"3","key":"3876_CR21","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1504\/IJCAET.2021.114494","volume":"14","author":"A Muralidhar","year":"2021","unstructured":"Muralidhar A, Venkatasubbu P (2021) Hupm-muo: high utility pattern mining under multiple utility objectives. Int J Comput Aided Eng Technol 14(3):385\u2013407","journal-title":"Int J Comput Aided Eng Technol"},{"key":"3876_CR22","doi-asserted-by":"publisher","first-page":"115,741","DOI":"10.1016\/j.eswa.2021.115741","volume":"186","author":"TD Nguyen","year":"2021","unstructured":"Nguyen TD, Nguyen LT, Vu L, et al. (2021) Efficient algorithms for mining closed high utility itemsets in dynamic profit databases. Expert Syst Appl 186:115,741","journal-title":"Expert Syst Appl"},{"issue":"10","key":"3876_CR23","doi-asserted-by":"publisher","first-page":"6785","DOI":"10.1007\/s10489-021-02204-w","volume":"51","author":"M Nouioua","year":"2021","unstructured":"Nouioua M, Fournier-Viger P, Wu CW, et al. (2021) Fhuqi-miner: fast high utility quantitative itemset mining. Appl Intell 51(10):6785\u20136809","journal-title":"Appl Intell"},{"issue":"6","key":"3876_CR24","doi-asserted-by":"publisher","first-page":"e12,296","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 Syst 35(6):e12,296","journal-title":"Expert Syst"},{"key":"3876_CR25","doi-asserted-by":"publisher","first-page":"112,967","DOI":"10.1016\/j.eswa.2019.112967","volume":"141","author":"S Sumalatha","year":"2020","unstructured":"Sumalatha S, Subramanyam R (2020) Distributed mining of high utility time interval sequential patterns using mapreduce approach. Expert Syst Appl 141:112,967","journal-title":"Expert Syst Appl"},{"issue":"3","key":"3876_CR26","doi-asserted-by":"publisher","first-page":"5637","DOI":"10.3233\/JIFS-201357","volume":"40","author":"R Sun","year":"2021","unstructured":"Sun R, Han M, Zhang C, et al. (2021) Mining of top-k high utility itemsets with negative utility. J Intell Fuzzy Syst 40(3):5637\u20135652","journal-title":"J Intell Fuzzy Syst"},{"key":"3876_CR27","doi-asserted-by":"crossref","unstructured":"Wu CW, Fournier-Viger P, Gu JY, et al. (2015) Mining closed+ high utility itemsets without candidate generation. In: 2015 conference on technologies and applications of artificial intelligence (TAAI). IEEE, pp 187\u2013194","DOI":"10.1109\/TAAI.2015.7407089"},{"issue":"1","key":"3876_CR28","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00354-019-00078-8","volume":"38","author":"I Yildirim","year":"2020","unstructured":"Yildirim I, Celik M (2020) Mining high-average utility itemsets with positive and negative external utilities. New Gener Comput 38(1):153\u2013186","journal-title":"New Gener Comput"},{"key":"3876_CR29","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.03.016","volume":"124","author":"U Yun","year":"2017","unstructured":"Yun U, Ryang H, Lee G, et al. (2017) An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl-Based Syst 124:188\u2013206","journal-title":"Knowl-Based Syst"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03876-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03876-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03876-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T10:24:54Z","timestamp":1684578294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03876-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,10]]},"references-count":29,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["3876"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03876-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,10]]},"assertion":[{"value":"7 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Ethics approval and consent to participate"}},{"value":"Authors are responsible for correctness of the statements provided in the manuscript.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Consent for Publication"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}},{"value":"The authors have no financial or proprietary interests in any material discussed in this article.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}