{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:29:02Z","timestamp":1767637742901,"version":"3.48.0"},"reference-count":128,"publisher":"Maximum Academic Press","license":[{"start":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T00:00:00Z","timestamp":1730851200000},"content-version":"unspecified","delay-in-days":310,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    High utility itemsets mining (HUIM) is an important sub-field of frequent itemset mining (FIM). Recently, HUIM has received much attention in the field of data mining. High utility itemsets (HUIs) have proven to be quite useful in marketing, retail marketing, cross-marketing, and e-commerce. Traditional HUIM approaches suffer from a drawback as they need a user-defined minimum utility (\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0269888924000055_inline1.png\"\/>\n                        <jats:tex-math>$ min\\_util $<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    ) threshold. It is not easy for the users to set the appropriate\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0269888924000055_inline2.png\"\/>\n                        <jats:tex-math>$ min\\_util $<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    threshold to find actionable HUIs. To target this drawback, top-\n                    <jats:italic>k<\/jats:italic>\n                    HUIM has been introduced. top-\n                    <jats:italic>k<\/jats:italic>\n                    HUIM is more suitable for supermarket managers and retailers to prepare appropriate strategies to generate higher profit. In this paper, we provide an in-depth survey of the current status of top-\n                    <jats:italic>k<\/jats:italic>\n                    HUIM approaches. The paper presents the task of top-\n                    <jats:italic>k<\/jats:italic>\n                    HUIM and its relevant definitions. It reviews the top-\n                    <jats:italic>k<\/jats:italic>\n                    HUIM approaches and presents their advantages and disadvantages. The paper also discusses the important strategies of the top-\n                    <jats:italic>k<\/jats:italic>\n                    HUIM, their variations, and research opportunities. The paper provides a detailed summary, analysis, and future directions of the top-\n                    <jats:italic>k<\/jats:italic>\n                    HUIM field.\n                  <\/jats:p>","DOI":"10.1017\/s0269888924000055","type":"journal-article","created":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T04:00:37Z","timestamp":1730865637000},"update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":2,"title":["Top-\n                    <i>k<\/i>\n                    high utility itemset mining: current status and future directions"],"prefix":"10.48130","volume":"39","author":[{"given":"Rajiv","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5289-362X","authenticated-orcid":false,"given":"Kuldeep","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"27968","published-online":{"date-parts":[[2024,11,6]]},"reference":[{"key":"S0269888924000055_ref49","doi-asserted-by":"crossref","unstructured":"Le, B. , Truong, C. & Tran, M.-T. 2017. Enhancing threshold-raising strategies for effective mining top-k high utility patterns. In 2017 4th NAFOSTED Conference on Information and Computer Science, 78\u201383.","DOI":"10.1109\/NAFOSTED.2017.8108042"},{"key":"S0269888924000055_ref120","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.09.009"},{"key":"S0269888924000055_ref125","doi-asserted-by":"crossref","unstructured":"Zihayat, M. , Davoudi, H. & An, A. 2016. Top-k utility-based gene regulation sequential pattern discovery. In 2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), 266\u2013273.","DOI":"10.1109\/BIBM.2016.7822529"},{"key":"S0269888924000055_ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2695823"},{"key":"S0269888924000055_ref10","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S12-S3"},{"key":"S0269888924000055_ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2942594"},{"key":"S0269888924000055_ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2510012"},{"key":"S0269888924000055_ref116","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007652502315"},{"key":"S0269888924000055_ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-95408-6_2"},{"key":"S0269888924000055_ref5","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775109"},{"key":"S0269888924000055_ref36","doi-asserted-by":"publisher","DOI":"10.1080\/08839514.2014.891839"},{"key":"S0269888924000055_ref65","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45237-0_5"},{"key":"S0269888924000055_ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3335783.3335789"},{"key":"S0269888924000055_ref93","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-55789-8_72"},{"key":"S0269888924000055_ref92","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-78811-7_38"},{"key":"S0269888924000055_ref75","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45571-X_47"},{"key":"S0269888924000055_ref84","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.01.056"},{"key":"S0269888924000055_ref87","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1316-x"},{"key":"S0269888924000055_ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2022.3223965"},{"key":"S0269888924000055_ref99","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2458860"},{"key":"S0269888924000055_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"S0269888924000055_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14717-8_6"},{"key":"S0269888924000055_ref108","doi-asserted-by":"crossref","unstructured":"Yang, R. , Xu, M. , Jones, P. & Samatova, N. 2017. Real time utility-based recommendation for revenue optimization via an adaptive online top-k high utility itemsets mining model. In 2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), 1859\u20131866.","DOI":"10.1109\/FSKD.2017.8393050"},{"key":"S0269888924000055_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06605-9_19"},{"key":"S0269888924000055_ref82","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20149-3_18"},{"key":"S0269888924000055_ref124","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.01.045"},{"key":"S0269888924000055_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.12.024"},{"key":"S0269888924000055_ref37","doi-asserted-by":"crossref","unstructured":"Kennedy, J. & Eberhart, R. 1995. Particle swarm optimization. In Proceedings of ICNN\u201995 - International Conference on Neural Networks, 4, 1942\u20131948.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"S0269888924000055_ref102","unstructured":"Wan, S. , Chen, J. , Gan, W. , Chen, G. & Goyal, V. 2021. THUE: Discovering top-k high utility episodes."},{"key":"S0269888924000055_ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.02.035"},{"key":"S0269888924000055_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.03.062"},{"key":"S0269888924000055_ref32","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"S0269888924000055_ref76","doi-asserted-by":"crossref","unstructured":"Pham, N. N. , Komnkov\u00e1 Oplatkov\u00e1, Z. , Huynh, H. M. & Vo, B. 2022a. Mining top-k high utility itemset using bio-inspired algorithms. In 2022 IEEE Workshop on Complexity in Engineering (COMPENG), 1\u20135.","DOI":"10.1109\/COMPENG50184.2022.9905433"},{"key":"S0269888924000055_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.05.066"},{"key":"S0269888924000055_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-017-0939-7"},{"key":"S0269888924000055_ref1","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, 487\u2013499. Morgan Kaufmann Publishers Inc."},{"key":"S0269888924000055_ref54","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2106-1"},{"key":"S0269888924000055_ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-06613-4"},{"key":"S0269888924000055_ref121","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"volume-title":"EFIM: A Highly Efficient Algorithm for High-Utility Itemset Mining","year":"2015","author":"Zida","key":"S0269888924000055_ref123"},{"key":"S0269888924000055_ref90","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2819162"},{"key":"S0269888924000055_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-009-9175-3"},{"key":"S0269888924000055_ref70","article-title":"Mining high utility itemsets with hill climbing and simulated annealing","volume":"13","author":"Nawaz","year":"2021","journal-title":"ACM Transactions on Management Information Systems"},{"key":"S0269888924000055_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41920-6_15"},{"key":"S0269888924000055_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67162-8_22"},{"key":"S0269888924000055_ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-16145-3_20"},{"key":"S0269888924000055_ref73","doi-asserted-by":"crossref","unstructured":"Nouioua, M. , Wang, Y. , Fournier-Viger, P. , Lin, J. C.-W. & Wu, J. M.-T. 2020. TKC: Mining top-k cross-level high utility itemsets. In 2020 International Conference on Data Mining Workshops (ICDMW), 673\u2013682.","DOI":"10.1109\/ICDMW51313.2020.00095"},{"key":"S0269888924000055_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04921-8"},{"key":"S0269888924000055_ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"S0269888924000055_ref89","doi-asserted-by":"publisher","DOI":"10.2174\/2213275912666190204134822"},{"key":"S0269888924000055_ref97","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835842"},{"key":"S0269888924000055_ref115","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.11.038"},{"key":"S0269888924000055_ref122","unstructured":"Zheng, Z. , Zhao, Y. , Zuo, Z. & Cao, L. 2009. Negative-GSP: An efficient method for mining negative sequential patterns. In Eighth Australasian Data Mining Conference, AusDM 2009, Melbourne, Australia, December 2009, Kennedy, P. J. , Ong, K. & Christen, P. (eds), CRPIT 101, 63\u201368. Australian Computer Society. http:\/\/crpit.scem.westernsydney.edu.au\/abstracts\/CRPITV101Zheng.html"},{"key":"S0269888924000055_ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.08.028"},{"key":"S0269888924000055_ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2016.04.002"},{"volume-title":"Adaptation in Natural and Artificial Systems","year":"1975","author":"Holland","key":"S0269888924000055_ref35"},{"key":"S0269888924000055_ref94","doi-asserted-by":"publisher","DOI":"10.4018\/ijdwm.2014010101"},{"key":"S0269888924000055_ref47","doi-asserted-by":"publisher","DOI":"10.4018\/IJDWM.2019010104"},{"key":"S0269888924000055_ref79","doi-asserted-by":"publisher","DOI":"10.1142\/S0219622019300027"},{"key":"S0269888924000055_ref61","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"S0269888924000055_ref105","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339546"},{"key":"S0269888924000055_ref68","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.12.092"},{"key":"S0269888924000055_ref101","doi-asserted-by":"crossref","unstructured":"Tzvetkov, P. , Yan, X. & Han, J. 2003. TSP: Mining top-k closed sequential patterns. In Third IEEE International Conference on Data Mining, 347\u2013354.","DOI":"10.1109\/ICDM.2003.1250939"},{"key":"S0269888924000055_ref62","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-230"},{"key":"S0269888924000055_ref107","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190613"},{"key":"S0269888924000055_ref118","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.04.035"},{"key":"S0269888924000055_ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.12.035"},{"key":"S0269888924000055_ref114","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.10.027"},{"key":"S0269888924000055_ref67","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.05.048"},{"key":"S0269888924000055_ref15","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"S0269888924000055_ref126","article-title":"Mining High Utility Sequential Patterns from Evolving Data Streams","author":"Zihayat","year":"2015","journal-title":"Association for Computing Machinery."},{"key":"S0269888924000055_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41561-1_6"},{"key":"S0269888924000055_ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02204-w"},{"key":"S0269888924000055_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.04.016"},{"key":"S0269888924000055_ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2043989"},{"key":"S0269888924000055_ref86","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12296"},{"key":"S0269888924000055_ref113","doi-asserted-by":"crossref","unstructured":"Yin, J. , Zheng, Z. , Cao, L. , Song, Y. & Wei, W. 2013. Efficiently mining top-k high utility sequential patterns. In 2013 IEEE 13th International Conference on Data Mining, 1259\u20131264.","DOI":"10.1109\/ICDM.2013.148"},{"key":"S0269888924000055_ref106","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1155-9"},{"key":"S0269888924000055_ref64","doi-asserted-by":"publisher","DOI":"10.4304\/jsw.9.9.2342-2347"},{"volume-title":"FHM +: Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction","year":"2016","author":"Fournier-Viger","key":"S0269888924000055_ref21"},{"key":"S0269888924000055_ref74","doi-asserted-by":"crossref","unstructured":"Pallikila, P. , Veena, P. , Kiran, R. U. , Avatar, R. , Ito, S. , Zettsu, K. & Reddy, P. K. 2021. Discovering top-k spatial high utility itemsets in very large quantitative spatiotemporal databases. In 2021 IEEE International Conference on Big Data (Big Data), 4925\u20134935.","DOI":"10.1109\/BigData52589.2021.9671912"},{"key":"S0269888924000055_ref81","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.12.010"},{"key":"S0269888924000055_ref66","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733086"},{"key":"S0269888924000055_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-1020-2"},{"key":"S0269888924000055_ref110","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74553-2_26"},{"key":"S0269888924000055_ref50","doi-asserted-by":"crossref","unstructured":"Lee, S. & Park, J. S. 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":"S0269888924000055_ref128","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2014.2369894"},{"key":"S0269888924000055_ref83","doi-asserted-by":"publisher","DOI":"10.4018\/IJDWM.2019070101"},{"key":"S0269888924000055_ref91","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-65390-3_4"},{"key":"S0269888924000055_ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.07.006"},{"key":"S0269888924000055_ref117","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.02.008"},{"key":"S0269888924000055_ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.883272"},{"key":"S0269888924000055_ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2886199"},{"key":"S0269888924000055_ref109","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2011.042259"},{"key":"S0269888924000055_ref58","doi-asserted-by":"crossref","unstructured":"Liu, J. , Wang, K. & Fung, B. C. M. 2012. Direct discovery of high utility itemsets without candidate generation. In 2012 IEEE 12th International Conference on Data Mining, Brussels, Belgium, 984\u2013989.","DOI":"10.1109\/ICDM.2012.20"},{"key":"S0269888924000055_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-5724-z"},{"key":"S0269888924000055_ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04921-8_2"},{"key":"S0269888924000055_ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18032-8_51"},{"key":"S0269888924000055_ref38","doi-asserted-by":"crossref","unstructured":"Kennedy, J. & Eberhart, R. 1997. A discrete binary version of the particle swarm algorithm. In 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, 5, 4104\u20134108.","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"S0269888924000055_ref127","doi-asserted-by":"publisher","DOI":"10.3929\/ethz-a-004284029"},{"key":"S0269888924000055_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14717-8_2"},{"key":"S0269888924000055_ref69","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0001564"},{"key":"S0269888924000055_ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835942"},{"key":"S0269888924000055_ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.09.051"},{"key":"S0269888924000055_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.03.001"},{"key":"S0269888924000055_ref85","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02611-z"},{"key":"S0269888924000055_ref95","article-title":"Heuristically mining the top-k high-utility itemsets with cross-entropy optimization","author":"Song","year":"2021","journal-title":"Applied Intelligence."},{"key":"S0269888924000055_ref104","doi-asserted-by":"crossref","unstructured":"Wu, C. W. , Fournier-Viger, P. , Gu, J. Y. & Tseng, V. S. 2015. Mining closed+ high utility itemsets without candidate generation. In 2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI), 187\u2013194.","DOI":"10.1109\/TAAI.2015.7407089"},{"key":"S0269888924000055_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-55789-8_73"},{"key":"S0269888924000055_ref119","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2981962"},{"key":"S0269888924000055_ref78","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04921-8_5"},{"key":"S0269888924000055_ref77","doi-asserted-by":"crossref","unstructured":"Pham, N. N. , Oplatkov\u00e1, Z. K. , Huynh, H. M. & Vo, B. 2022b. Mining top-k high utility itemsets using bio-inspired algorithms with a diversity within population framework. In 2022 RIVF International Conference on Computing and Communication Technologies (RIVF), 167\u2013172.","DOI":"10.1109\/RIVF55975.2022.10013891"},{"key":"S0269888924000055_ref88","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-18965"},{"key":"S0269888924000055_ref8","unstructured":"Chen, J. , Wan, S. , Gan, W. , Chen, G. & Fujita, H. 2021. TOPIC: Top-k high-utility itemset discovering. ArXiv abs\/2106.14811."},{"key":"S0269888924000055_ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.11.001"},{"key":"S0269888924000055_ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-023-04853-5"},{"key":"S0269888924000055_ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.10.049"},{"key":"S0269888924000055_ref100","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835839"},{"key":"S0269888924000055_ref98","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"S0269888924000055_ref63","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_79"},{"key":"S0269888924000055_ref111","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74553-2_26"},{"key":"S0269888924000055_ref80","unstructured":"Rathore, S. , Dawar, S. , Goyal, V. & Patel, D. 2016. Top-k high utility episode mining from a complex event sequence. In 21st International Conference on Management of Data, COMAD 2016, Pune, India, March 11\u201313, 2016, Deshpande, A. , Ravindran, B. & Ranu, S. (eds), 56\u201363, Computer Society of India. http:\/\/comad.in\/comad2016\/proceedings\/paper_19.pdf"},{"key":"S0269888924000055_ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.08.028"},{"key":"S0269888924000055_ref96","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-201357"},{"key":"S0269888924000055_ref29","doi-asserted-by":"crossref","unstructured":"Gan, W. , Wan, S. , Chen, J. , Chen, C.-M. & Qiu, L. 2020. TopHUI: Top-k high-utility itemset mining with negative utility. In 2020 IEEE International Conference on Big Data (Big Data), 5350\u20135359.","DOI":"10.1109\/BigData50022.2020.9378288"},{"key":"S0269888924000055_ref112","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339636"},{"key":"S0269888924000055_ref33","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"S0269888924000055_ref103","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0914-8"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888924000055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:42:25Z","timestamp":1767624145000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888924000055\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":128,"alternative-id":["S0269888924000055"],"URL":"https:\/\/doi.org\/10.1017\/s0269888924000055","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"type":"print","value":"0269-8889"},{"type":"electronic","value":"1469-8005"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"\u00a9 The Author(s), 2024. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}],"article-number":"e5"}}