{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:51:46Z","timestamp":1777704706509,"version":"3.51.4"},"reference-count":67,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T00:00:00Z","timestamp":1541635200000},"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":[[2018,12,24]]},"abstract":"<jats:p>Mining high utility itemsets (HUIs) is a basic task of frequent itemsets mining (FIM). In recent years, a trend in FIM has been to design algorithm for mining HUIs because FIM assumes that each item can not appear more than once in a transaction and all items have the same importance (weight, unit profit, price, etc.). However, in real-world, items appear more than once in a transaction and also have some importance. HUIs mining considers that items appear with some quantity and importance. Traditional HUIs mining algorithms assume that items have only positive unit profit. However, in real-world, items may appear with negative unit profit also. For example, it is common that a retail store sells items at a loss to stimulate the sale of other related items or simply to attract customers to their retail location. Therefore, items occur with negative unit profit or negative utility. To consider negative unit profit, HUIs with negative utility has been introduced. This paper surveys recent studies on HUIs mining with negative utility and their applications. The main goal is to provide a survey of recent advancements and research opportunities. This paper presents key concepts and terminology related to HUIs mining with negative utility. This presents a taxonomy of all the algorithms consider negative utility. To the best of our knowledge, this is the first survey on the mining task of HUIs with negative utility. The paper also presents research opportunities and the challenges in HUIs mining problems.<\/jats:p>","DOI":"10.3233\/jifs-18965","type":"journal-article","created":{"date-parts":[[2018,11,9]],"date-time":"2018-11-09T15:42:36Z","timestamp":1541778156000},"page":"6551-6562","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":12,"title":["High utility itemsets mining with negative utility value: A survey"],"prefix":"10.1177","volume":"35","author":[{"given":"Kuldeep","family":"Singh","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology (BHU), Varanasi, India."}]},{"given":"Shashank Sheshar","family":"Singh","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology (BHU), Varanasi, India."}]},{"given":"Ajay","family":"Kumar","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology (BHU), Varanasi, India."}]},{"given":"Bhaskar","family":"Biswas","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology (BHU), Varanasi, India."}]}],"member":"179","published-online":{"date-parts":[[2018,11,8]]},"reference":[{"key":"e_1_3_1_2_2","first-page":"487","volume-title":"In Proceedings of the 20th International Conference on Very Large Data Bases, VLDB \u201994","author":"Agrawal R.","year":"1994","unstructured":"R.Agrawal and R.Srikant, Fast algorithms for mining association rules in large databases, In Proceedings of the 20th International Conference on Very Large Data Bases, VLDB \u201994, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc, 1994, pp. 487\u2013499."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-009-0188-5"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.bdr.2017.10.004"},{"key":"e_1_3_1_6_2","first-page":"19","volume-title":"In Proceedings of the Third IEEE International Conference on Data Mining, ICDM '03","author":"Chan R.","year":"2003","unstructured":"R.Chan, Q.Yang and Y.-D.Shen, Mining high utility itemsets, In Proceedings of the Third IEEE International Conference on Data Mining, ICDM '03, Washington, DC, USA, IEEE Computer Society, 2003, pp. 19\u201326."},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2007.07.026"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.05.066"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-1020-2"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1080\/23270012.2015.1020891"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2188804"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.04.016"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68125-0_50"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14717-8_2"},{"key":"e_1_3_1_15_2","first-page":"115","volume-title":"FHM $$+$$ : Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction","author":"Fournier-Viger P.","year":"2016","unstructured":"P.Fournier-Viger, J.C.-W.Lin, Q.-H.Duong and T.-L.Dam, FHM $$+$$ : Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction, Springer International Publishing, Cham, 2016a, pp. 115\u2013127."},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"e_1_3_1_17_2","first-page":"83","volume-title":"FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-Occurrence Pruning","author":"Fournier-Viger P.","year":"2014","unstructured":"P.Fournier-Viger, C.-W.Wu, S.Zida and V.S.Tseng, FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-Occurrence Pruning, Cham, Springer International Publishing, 2014, pp. 83\u201392."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2695823"},{"key":"e_1_3_1_19_2","first-page":"199","volume-title":"EFIM-Closed: Fast and Memory Efficient Discovery of Closed High-Utility Itemsets","author":"Fournier-Viger P.","year":"2016","unstructured":"P.Fournier-Viger, S.Zida, J.C.-W.Lin, C.-W.Wu and V.S.Tseng, EFIM-Closed: Fast and Memory Efficient Discovery of Closed High-Utility Itemsets, Springer International Publishing, Cham, 2016c, pp. 199\u2013213."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57454-7_34"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.11.001"},{"key":"e_1_3_1_23_2","article-title":"Efficiently mining high utility itemsets with negative unit profits","author":"Krishnamoorthy S.","year":"2017","unstructured":"S.Krishnamoorthy, Efficiently mining high utility itemsets with negative unit profits, Knowledge-Based Systems (2017a).","journal-title":"Knowledge-Based Systems"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.08.028"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.10.049"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0492-y"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.11.021"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.107"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0330-z"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.06.009"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.08.022"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2510012"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1089827.1089839"},{"key":"e_1_3_1_35_2","first-page":"689","article-title":"A two-phase algorithm for fast discovery of high utility itemsets","author":"Liu Y.","year":"2005","unstructured":"Y.Liu, W.-K.Liao and A.Choudhary, 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'05, Berlin, Heidelberg, Springer-Verlag, 2005b, pp. 689\u2013695.","journal-title":"In Proceedings of the 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD'05"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.04.037"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/568574.568580"},{"key":"e_1_3_1_38_2","first-page":"3957","article-title":"A survey on data preprocessing for data stream mining: Current status and future directions","volume":"239","author":"Ramirez-Gallego S.","year":"2017","unstructured":"S.Ramirez-Gallego, B.Krawczyk, S.Garcia, M.Wozniak and F.Herrera, A survey on data preprocessing for data stream mining: Current status and future directions, Neuro-computing 239 (2017), 3957.","journal-title":"Neuro-computing"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.12.010"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20149-3_18"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12296."},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/2818567.2818573"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-2553-9_15"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-2695-6_15"},{"key":"e_1_3_1_45_2","article-title":"Tkeh: An efficient algorithm for mining top-k high utility itemsets","author":"Singh K.","year":"2018","unstructured":"K.Singh, S.S.Singh, A.Kumar and B.Biswas, Tkeh: An efficient algorithm for mining top-k high utility itemsets, Applied Intelligence (2018b).","journal-title":"Applied Intelligence"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.4018\/ijdwm.2014010101"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJITM.2015.066056"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2345377"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2458860"},{"key":"e_1_3_1_51_2","first-page":"253","volume-title":"In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '10","author":"Tseng V.S.","year":"2010","unstructured":"V.S.Tseng, C.-W.Wu, B.-E.Shie and P.S.Yu, Upgrowth: An efficient algorithm for high utility itemset mining, In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '10, New York, NY, USA, ACM, 2010, pp. 253\u2013262."},{"key":"e_1_3_1_52_2","volume-title":"In IEEE ICDM Workshop on Frequent Itemset Mining Implementations","author":"Uno T.","year":"2004","unstructured":"T.Uno, M.Kiyomi and H.Arimura, Lcm ver, 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets, In IEEE ICDM Workshop on Frequent Itemset Mining Implementations, volume 126, Brighton, UK, 2004."},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2015.7407089"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339546"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001417500355"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2005.10.004"},{"key":"e_1_3_1_57_2","first-page":"482","article-title":"A foundational approach to mining itemset utilities from databases","author":"Yao H.","year":"2004","unstructured":"H.Yao, H.J.Hamilton and C.J.Butz, A foundational approach to mining itemset utilities from databases, In Proceedings of the Third SIAM International Conference on Data Mining, 2004, pp. 482\u2013486.","journal-title":"In Proceedings of the Third SIAM International Conference on Data Mining"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74553-2_26"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339636"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.11.038"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-151792"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.07.026"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-015-0478-7"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3085-1"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0986-0"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.01.045"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-18965","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-18965","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-18965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:41:49Z","timestamp":1777455709000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-18965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,8]]},"references-count":67,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12,24]]}},"alternative-id":["10.3233\/JIFS-18965"],"URL":"https:\/\/doi.org\/10.3233\/jifs-18965","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,8]]}}}