{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T23:13:34Z","timestamp":1784589214402,"version":"3.55.0"},"reference-count":17,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2018,5,14]],"date-time":"2018-05-14T00:00:00Z","timestamp":1526256000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Natural Science Foundation of HuBei Province of China","award":["2017CFB723"],"award-info":[{"award-number":["2017CFB723"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>High utility itemsets (HUIs) are sets of items with high utility, like profit, in a database. Efficient mining of high utility itemsets is an important problem in the data mining area. Many mining algorithms adopt a two-phase framework. They first generate a set of candidate itemsets by roughly overestimating the utilities of all itemsets in a database, and subsequently compute the exact utility of each candidate to identify HUIs. Therefore, the major costs in these algorithms come from candidate generation and utility computation. Previous works mainly focus on how to reduce the number of candidates, without dedicating much attention to utility computation, to the best of our knowledge. However, we find that, for a mining task, the time of utility computation in two-phase algorithms dominates the whole running time of these algorithms. Therefore, it is important to optimize utility computation. In this paper, we first give a basic algorithm for HUI identification, the core of which is a utility computation procedure. Subsequently, a novel candidate tree structure is proposed for storing candidate itemsets, and a candidate tree-based algorithm is developed for fast HUI identification, in which there is an efficient utility computation procedure. Extensive experimental results show that the candidate tree-based algorithm outperforms the basic algorithm and the performance of two-phase algorithms, integrating the candidate tree algorithm as their second step, can be significantly improved.<\/jats:p>","DOI":"10.3390\/info9050119","type":"journal-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T03:29:34Z","timestamp":1526354974000},"page":"119","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast Identification of High Utility Itemsets from Candidates"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2252-8757","authenticated-orcid":false,"given":"Jun-Feng","family":"Qu","sequence":"first","affiliation":[{"name":"School of Computer Engineering, Hubei University of Arts and Science, Xiangyang 441053, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengchi","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carleton University, Ottawa, ON K1S 5B6, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunsheng","family":"Xin","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Old Dominion University, Norfolk, VA 23529, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhongbo","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Engineering, Hubei University of Arts and Science, Xiangyang 441053, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2018,5,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., and Butz, C.J. (2004, January 22\u201324). A Foundational Approach to Mining Itemset Utilities from Databases. Proceedings of the Fourth SIAM International Conference on Data Mining, Lake Buena Vista, FL, USA.","DOI":"10.1137\/1.9781611972740.51"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., and Swami, A. (1993, January 25\u201328). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, DC, USA.","DOI":"10.1145\/170035.170072"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.engappai.2017.12.012","article-title":"Efficient Mining of High Utility Itemsets with Multiple Minimum Utility Thresholds","volume":"69","author":"Krishnamoorthy","year":"2018","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1016\/j.asoc.2017.09.033","article-title":"A Multi-Objective Evolutionary Approach for Mining Frequent and High Utility Itemsets","volume":"62","author":"Zhang","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ins.2017.02.058","article-title":"A Lattice-Based Approach for Mining High Utility Association Rules","volume":"399","author":"Mai","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.knosys.2016.10.027","article-title":"An ACO-Based Approach to Mine High-Utility Itemsets","volume":"116","author":"Wu","year":"2017","journal-title":"Knowl-Based Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"7393","DOI":"10.1007\/s00500-016-2282-z","article-title":"Enhancing social emotional optimization algorithm using local search","volume":"21","author":"Guo","year":"2017","journal-title":"Soft Comput."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liao, W., and Choudhary, A.N. (2005, January 18\u201320). A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets. Proceedings of the 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2005, Hanoi, Vietnam.","DOI":"10.1007\/11430919_79"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","article-title":"Efficient tree structures for high utility pattern mining in incremental databases","volume":"21","author":"Ahmed","year":"2009","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Tseng, V.S., Wu, C.-W., Shie, B.-E., and Yu, P.S. (2010, January 25\u201328). Up growth: An efficient algorithm for high utility itemset mining. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA.","DOI":"10.1145\/1835804.1835839"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","article-title":"Efficient algorithms for mining high utility itemsets from transactional databases","volume":"25","author":"Tseng","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Li, Y.-C., Yeh, J.-S., and Chang, C.-C. (April, January 29). A fast algorithm for mining share-frequent itemsets. Proceedings of the 7th Asia-Pacific Web Conference on Web Technologies Research and Development\u2014APWeb 2005, Shanghai, China.","DOI":"10.1007\/978-3-540-31849-1_41"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Li, Y.-C., Yeh, J.-S., and Chang, C.-C. (2005, January 27\u201329). Direct candidates generation: A novel algorithm for discovering complete share-frequent itemsets. Proceedings of the International Conference on Fuzzy Systems and Knowledge Discovery, Changsha, China.","DOI":"10.1007\/11540007_67"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","article-title":"Isolated Items Discarding Strategy for Discovering High Utility Itemsets","volume":"64","author":"Li","year":"2008","journal-title":"Data Knowl. Eng."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: A frequent-pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_16","unstructured":"(2018, April 08). NU-MineBench: A Data Mining Benchmark Suite. Available online: http:\/\/cucis.ece.northwestern.edu\/projects\/DMS\/MineBench.html."},{"key":"ref_17","unstructured":"(2018, April 08). Frequent Itemset Mining Dataset Repository. Available online: http:\/\/fimi.ua.ac.be\/."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/5\/119\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:04:13Z","timestamp":1760195053000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/5\/119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,14]]},"references-count":17,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2018,5]]}},"alternative-id":["info9050119"],"URL":"https:\/\/doi.org\/10.3390\/info9050119","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,14]]}}}