{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:36:25Z","timestamp":1769837785665,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s00500-025-10930-3","type":"journal-article","created":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:52:10Z","timestamp":1765533130000},"page":"209-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TKHN: efficient mining of top-K high utility itemsets with negative item values"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5289-362X","authenticated-orcid":false,"given":"Kuldeep","family":"Singh","sequence":"first","affiliation":[]},{"given":"Rajiv","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Shashank Sheshar","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Dharmendra Prasad","family":"Mahato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,12]]},"reference":[{"key":"10930_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, VLDB \u201994, pages 487\u2013499, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc"},{"issue":"2","key":"10930_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10489-009-0188-5","volume":"34","author":"CF Ahmed","year":"2011","unstructured":"Ahmed CF, Tanbeer SK, Jeong B-S, Lee Y-K (2011) HUC-prune: an efficient candidate pruning technique to mine high utility patterns. Appl Intell 34(2):181\u2013198","journal-title":"Appl Intell"},{"key":"10930_CR3","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.ins.2021.12.024","volume":"587","author":"M Ashraf","year":"2022","unstructured":"Ashraf M, Abdelkader T, Rady S, Gharib TF (2022) Tkn: an efficient approach for discovering top-k high utility itemsets with positive or negative profits. Inf Sci 587:654\u2013678","journal-title":"Inf Sci"},{"key":"10930_CR4","unstructured":"Chan R, Yang Q, Shen Y-D (2003) Mining high utility itemsets. In: Proceedings of the Third IEEE International Conference on Data Mining, ICDM \u201903, pages 19\u201326, Washington, DC, USA. IEEE Computer Society"},{"issue":"2","key":"10930_CR5","first-page":"767","volume":"215","author":"C-J Chu","year":"2009","unstructured":"Chu C-J, 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":"3","key":"10930_CR6","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10115-016-1020-2","volume":"52","author":"T-L Dam","year":"2017","unstructured":"Dam T-L, Li K, Fournier-Viger P, Duong Q-H (2017) An efficient algorithm for mining top-k on-shelf high utility itemsets. Knowl Inf Syst 52(3):621\u2013655","journal-title":"Knowl Inf Syst"},{"key":"10930_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"Q-H Duong","year":"2016","unstructured":"Duong Q-H, Liao B, Fournier-Viger P, Dam T-L (2016) An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowledge-Based Systems 104:106\u2013122","journal-title":"Knowledge-Based Systems"},{"key":"10930_CR8","doi-asserted-by":"crossref","unstructured":"Erwin A, Gopalan RP, Achuthan NR (2008) Efficient Mining of High Utility Itemsets from Large Datasets, pages 554\u2013561. Springer Berlin Heidelberg, Berlin, Heidelberg","DOI":"10.1007\/978-3-540-68125-0_50"},{"key":"10930_CR9","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu C-W, Zida S, Tseng VS (2014) FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning, pages 83\u201392. Springer International Publishing, Cham","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"10930_CR10","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S (2015) FOSHU: faster on-shelf high utility itemset mining \u2013 with or without negative unit profit. In Proceedings of the 30th Annual ACM Symposium on Applied Computing, SAC \u201915, pages 857\u2013864, New York, NY, USA. ACM","DOI":"10.1145\/2695664.2695823"},{"key":"10930_CR11","doi-asserted-by":"crossref","unstructured":"Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Tseng VS (2017) Mining high-utility itemsets with both positive and negative unit profits from uncertain databases. In Jinho Kim, Kyuseok Shim, Longbing Cao, Jae-Gil Lee, Xuemin Lin, and Yang-Sae Moon, editors, Advances in Knowledge Discovery and Data Mining, pages 434\u2013446, Cham. Springer International Publishing","DOI":"10.1007\/978-3-319-57454-7_34"},{"issue":"5","key":"10930_CR12","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","volume":"42","author":"S Krishnamoorthy","year":"2015","unstructured":"Krishnamoorthy S (2015) Pruning strategies for mining high utility itemsets. Expert Syst Appl 42(5):2371\u20132381","journal-title":"Expert Syst Appl"},{"key":"10930_CR13","volume-title":"Efficiently mining high utility itemsets with negative unit profits","author":"S Krishnamoorthy","year":"2017","unstructured":"Krishnamoorthy S (2017) Efficiently mining high utility itemsets with negative unit profits. Knowledge-Based Systems"},{"issue":"Supplement C","key":"10930_CR14","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(Supplement C):168\u2013183","journal-title":"Expert Syst Appl"},{"key":"10930_CR15","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.eswa.2018.09.051","volume":"117","author":"S Krishnamoorthy","year":"2019","unstructured":"Krishnamoorthy S (2019) Mining top-k high utility itemsets with effective threshold raising strategies. Expert Syst Appl 117:148\u2013165","journal-title":"Expert Syst Appl"},{"issue":"7","key":"10930_CR16","doi-asserted-by":"publisher","first-page":"3450","DOI":"10.1016\/j.eswa.2013.10.049","volume":"41","author":"G-C Lan","year":"2014","unstructured":"Lan G-C, Hong T-P, Huang J-P, Tseng VS (2014) On-shelf utility mining with negative item values. Expert Syst Appl 41(7):3450\u20133459","journal-title":"Expert Syst Appl"},{"issue":"1","key":"10930_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"G-C Lan","year":"2014","unstructured":"Lan G-C, Hong T-P, Tseng VS (2014) An efficient projection-based indexing approach for mining high utility itemsets. Knowl Inf Syst 38(1):85\u2013107","journal-title":"Knowl Inf Syst"},{"issue":"7","key":"10930_CR18","doi-asserted-by":"publisher","first-page":"2715","DOI":"10.1016\/j.eswa.2012.11.021","volume":"40","author":"D Lee","year":"2013","unstructured":"Lee D, Park S-H, Moon S (2013) Utility-based association rule mining: a marketing solution for cross-selling. Expert Syst Appl 40(7):2715\u20132725","journal-title":"Expert Syst Appl"},{"key":"10930_CR19","doi-asserted-by":"crossref","unstructured":"Lee S, Park JS (2016) Top-k high utility itemset mining based on utility-list structures. In 2016 International Conference on Big Data and Smart Computing (BigComp), 101\u2013108","DOI":"10.1109\/BIGCOMP.2016.7425807"},{"key":"10930_CR20","doi-asserted-by":"crossref","unstructured":"Li HF, Huang HY, Chen YC, Liu YJ, Lee SY (2008) Fast and memory efficient mining of high utility itemsets in data streams. In 2008 Eighth IEEE International Conference on Data Mining, pages 881\u2013886","DOI":"10.1109\/ICDM.2008.107"},{"key":"10930_CR21","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.knosys.2016.08.022","volume":"111","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, 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"},{"issue":"5","key":"10930_CR22","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1109\/TKDE.2015.2510012","volume":"28","author":"J Liu","year":"2016","unstructured":"Liu J, Wang K, Fung BCM (2016) Mining high utility patterns in one phase without generating candidates. IEEE Trans Knowl Data Eng 28(5):1245\u20131257","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"10930_CR23","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ins.2018.02.035","volume":"441","author":"J Liu","year":"2018","unstructured":"Liu J, Zhang X, Fung BCM, Li J, Iqbal F (2018) Opportunistic mining of top-N high utility patterns. Inf Sci 441:171\u2013186","journal-title":"Inf Sci"},{"key":"10930_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, CIKM \u201912, pages 55\u201364, New York, NY, USA . ACM","DOI":"10.1145\/2396761.2396773"},{"key":"10930_CR25","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W-k, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In Proceedings of the 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD\u201905, pages 689\u2013695, Berlin, Heidelberg. Springer-Verlag","DOI":"10.1007\/11430919_79"},{"key":"10930_CR26","doi-asserted-by":"crossref","unstructured":"Philippe P, Lin JC-W, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The SPMF Open-Source Data Mining Library Version 2, pages 36\u201340. Springer International Publishing, Cham","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"10930_CR27","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.knosys.2014.12.010","volume":"76","author":"H Ryang","year":"2015","unstructured":"Ryang H, Yun U (2015) Top-k high utility pattern mining with effective threshold raising strategies. Knowledge-Based Systems 76:109\u2013126","journal-title":"Knowledge-Based Systems"},{"key":"10930_CR28","unstructured":"Rymon R (1992) Search through systematic set enumeration. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, KR\u201992, pages 539\u2013550, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc"},{"key":"10930_CR29","doi-asserted-by":"crossref","unstructured":"Shie B-E, Hsiao H-F, Tseng VS, Yu PS (2011) Mining High Utility Mobile Sequential Patterns in Mobile Commerce Environments, pages 224\u2013238. Springer Berlin Heidelberg, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-20149-3_18"},{"issue":"5","key":"10930_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3645115","volume":"18","author":"K Singh","year":"2024","unstructured":"Singh K, Biswas B (2024) Mining top-k high on-shelf utility itemsets using novel threshold raising strategies. ACM Trans Knowl Discov Data 18(5):1\u201323","journal-title":"ACM Trans Knowl Discov Data"},{"key":"10930_CR31","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, Shakya HK, Biswas B (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"},{"issue":"6","key":"10930_CR32","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12296","volume":"35","author":"K Singh","year":"2018","unstructured":"Singh K, Shakya HK, Abhimanyu S, Biswas B (2018) Mining of high utility itemsets with negative utility. Expert Systems 35(6):e12296. https:\/\/doi.org\/10.1111\/exsy.12296","journal-title":"Expert Systems"},{"issue":"6","key":"10930_CR33","first-page":"6551","volume":"35","author":"K Singh","year":"2018","unstructured":"Singh K, Singh SS, Kumar A, Biswas B (2018) High utility itemsets mining with negative utility value: A survey. J Int & Fuz Sys 35(6):6551\u20136562","journal-title":"J Int & Fuz Sys"},{"issue":"3","key":"10930_CR34","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1007\/s10489-018-1316-x","volume":"49","author":"K Singh","year":"2019","unstructured":"Singh K, Singh SS, Kumar A, Biswas B (2019) TKEH: an efficient algorithm for mining top-k high utility itemsets. Appl Intell 49(3):1078\u20131097","journal-title":"Appl Intell"},{"issue":"1","key":"10930_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/ijdwm.2014010101","volume":"10","author":"W Song","year":"2014","unstructured":"Song W, Liu Y, Li J (2014) BAHUI: fast and memory efficient mining of high utility itemsets based on bitmap. Int J Data Warehous Min 10(1):1\u201315","journal-title":"Int J Data Warehous Min"},{"issue":"1","key":"10930_CR36","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"VS Tseng","year":"2016","unstructured":"Tseng VS, Wu CW, Fournier-Viger P, Yu PS (2016) Efficient algorithms for mining top-k high utility itemsets. IEEE Trans Knowl Data Eng 28(1):54\u201367","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"10930_CR37","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-E, Wu C-W, Yu PS (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":"10930_CR38","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu C-W, Shie B-E, Yu PS (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, KDD \u201910, pages 253\u2013262, New York, NY, USA . ACM","DOI":"10.1145\/1835804.1835839"},{"key":"10930_CR39","unstructured":"Uno T, Kiyomi M, Arimura H (2004) LCM ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In:IEEE ICDM Workshop on Frequent Itemset Mining Implementations, volume 126, Brighton, UK"},{"key":"10930_CR40","doi-asserted-by":"crossref","unstructured":"Wu CW, Shie B-E, Tseng VS, Yu PS (2012) Mining top-k high utility itemsets. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201912, pages 78\u201386, New York, NY, USA. ACM","DOI":"10.1145\/2339530.2339546"},{"issue":"10","key":"10930_CR41","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001417500355","volume":"31","author":"X Tiantian","year":"2017","unstructured":"Tiantian X, Dong X, Jianliang X, Dong X (2017) Mining high utility sequential patterns with negative item values. Int J Pattern Recognit Artif Intell 31(10):1750035","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"3","key":"10930_CR42","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H Yao","year":"2006","unstructured":"Yao H, Hamilton HJ (2006) Mining itemset utilities from transaction databases. Data Knowl Eng 59(3):603\u2013626","journal-title":"Data Knowl Eng"},{"key":"10930_CR43","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 Third SIAM International Conference on Data Mining, pages 482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"key":"10930_CR44","doi-asserted-by":"crossref","unstructured":"Yen S-J, Lee Y-S (2007) Mining High Utility Quantitative Association Rules, pages 283\u2013292. Springer Berlin Heidelberg, Berlin, Heidelberg","DOI":"10.1007\/978-3-540-74553-2_26"},{"issue":"8","key":"10930_CR45","doi-asserted-by":"publisher","first-page":"3861","DOI":"10.1016\/j.eswa.2013.11.038","volume":"41","author":"U Yun","year":"2014","unstructured":"Yun U, Ryang H, Ryu KH (2014) High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst Appl 41(8):3861\u20133878","journal-title":"Expert Syst Appl"},{"issue":"3","key":"10930_CR46","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"10930_CR47","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","volume":"51","author":"S Zida","year":"2017","unstructured":"Zida S, Fournier-Viger P, Lin JC-W, Wu C-W, Tseng VS (2017) Efim: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595\u2013625","journal-title":"Knowl Inf Syst"},{"key":"10930_CR48","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ins.2014.01.045","volume":"285","author":"M Zihayat","year":"2014","unstructured":"Zihayat M, An A (2014) Mining top-k high utility patterns over data streams. Inf Sci 285:138\u2013161","journal-title":"Inf Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10930-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10930-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10930-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T15:54:48Z","timestamp":1769788488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10930-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,12]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10930"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10930-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,12]]},"assertion":[{"value":"20 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflicts of interest. The article mines top-K high-utility itemsets with negative utility values.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}