{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:24:29Z","timestamp":1781105069540,"version":"3.54.1"},"reference-count":30,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,1,1]]},"abstract":"<p>Mining high utility itemsets is one of the most important research issues in data mining owing to its ability to consider nonbinary frequency values of items in transactions and different profit values for each item. Although a number of relevant approaches have been proposed in recent years, they incur the problem of producing a large number of candidate itemsets for high utility itemsets. In this paper, the authors propose an efficient algorithm, namely BAHUI (Bitmap-based Algorithm for High Utility Itemsets), for mining high utility itemsets with bitmap database representation. In BAHUI, bitmap is used vertically and horizontally. On the one hand, BAHUI exploits a divide-and-conquer approach to visit itemset lattice by using bitmap vertically. On the other hand, BAHUI horizontally uses bitmap to calculate the real utilities of candidates. Using bitmap compression scheme, BAHUI reduces the memory usage and makes use of the efficient bitwise operation. Furthermore, BAHUI only records candidate high utility itemsets with maximal length, and inherits the pruning and searching strategies from maximal itemset mining problem. Extensive experimental results show that the BAHUI algorithm is both efficient and scalable.<\/p>","DOI":"10.4018\/ijdwm.2014010101","type":"journal-article","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T11:15:48Z","timestamp":1399461348000},"page":"1-15","source":"Crossref","is-referenced-by-count":55,"title":["BAHUI"],"prefix":"10.4018","volume":"10","author":[{"given":"Wei","family":"Song","sequence":"first","affiliation":[{"name":"College of Information Engineering, North China University of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Information Engineering, North China University of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinhong","family":"Li","sequence":"additional","affiliation":[{"name":"College of Information Engineering, North China University of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijdwm.2014010101-0","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Databases (pp. 487-499). San Francisco, CA: Morgan Kaufmann."},{"key":"ijdwm.2014010101-1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"ijdwm.2014010101-2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-009-0188-5"},{"key":"ijdwm.2014010101-3","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2011100101"},{"key":"ijdwm.2014010101-4","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIDM.2007.012945"},{"key":"ijdwm.2014010101-5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022419032620"},{"key":"ijdwm.2014010101-6","doi-asserted-by":"crossref","unstructured":"Bayardo, R. J. (1998). Efficiently mining long patterns from databases. In Proceedings ACM SIGMOD International Conference on Management of Data (pp. 85-93). New York, NY: ACM Press.","DOI":"10.1145\/276305.276313"},{"key":"ijdwm.2014010101-7","unstructured":"Chan, R., Yang, Q., & Shen, Y.-D. (2003). Mining high utility itemsets. In Proceedings of the 3rd IEEE International Conference on Data Mining (pp. 19-26). Washington, DC: IEEE Computer Society."},{"key":"ijdwm.2014010101-8","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2005100103"},{"key":"ijdwm.2014010101-9","doi-asserted-by":"crossref","unstructured":"Daly, O., & Taniar, D. (2004). Exception rules mining based on negative association rules. In Proceedings of the International Conference on Computational Science and Its Applications (pp. 543-552). Heidelberg, Germany: Springer.","DOI":"10.1007\/978-3-540-24768-5_58"},{"key":"ijdwm.2014010101-10","doi-asserted-by":"crossref","unstructured":"Erwin, A., Gopalan, R. P., & Achuthan, N. R. (2007). CTU-Mine: An efficient high utility itemset mining algorithm using the pattern growth approach. In Proceedings of the 7th IEEE International Conference on Computer and Information Technology (pp. 71-76). Washington, DC: IEEE Computer Society.","DOI":"10.1109\/CIT.2007.120"},{"key":"ijdwm.2014010101-11","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0002-x"},{"key":"ijdwm.2014010101-12","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"ijdwm.2014010101-13","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"ijdwm.2014010101-14","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2011070103"},{"issue":"1","key":"ijdwm.2014010101-15","first-page":"193","article-title":"A projection-based approach for discovering high average-utility itemsets.","volume":"28","author":"G.-C.Lan","year":"2012","journal-title":"Journal of Information Science and Engineering"},{"key":"ijdwm.2014010101-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.06.009"},{"key":"ijdwm.2014010101-17","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liao, W.-K., & Choudhary, A. N. (2005). A two phase algorithm for fast discovery of high utility of itemsets. In Proceedings of the 9th Pacific-Asia Conference on Knowledge Discovery and Data Mining (pp. 689-695). Heidelberg, Germany: Springer.","DOI":"10.1007\/11430919_79"},{"key":"ijdwm.2014010101-18","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2008070105"},{"issue":"6","key":"ijdwm.2014010101-19","doi-asserted-by":"crossref","first-page":"953","DOI":"10.3233\/IDA-2012-00561","article-title":"Mining of closed frequent subtrees from frequently updated databases.","volume":"16","author":"V. A.Nguyen","year":"2012","journal-title":"Intelligent Data Analysis"},{"key":"ijdwm.2014010101-20","doi-asserted-by":"publisher","DOI":"10.1142\/S021821300800390X"},{"key":"ijdwm.2014010101-21","doi-asserted-by":"publisher","DOI":"10.1080\/15501320601069499"},{"key":"ijdwm.2014010101-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2008.05.020"},{"key":"ijdwm.2014010101-23","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-011-0232-z"},{"key":"ijdwm.2014010101-24","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2005070103"},{"key":"ijdwm.2014010101-25","doi-asserted-by":"crossref","unstructured":"Tseng, V. S., Wu, C.-W., Shie, B.-E., & Yu, P. S. (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 (pp. 253-262). New York, NY: ACM Press.","DOI":"10.1145\/1835804.1835839"},{"key":"ijdwm.2014010101-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.02.003"},{"key":"ijdwm.2014010101-27","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2005040104"},{"key":"ijdwm.2014010101-28","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H. J., & Butz, C. J. (2004). A foundational approach to mining itemset utilities from databases. In Proceedings of the 4th SIAM International Conference on Data Mining (pp. 482-486). Philadelphia, PA: SIAM Press.","DOI":"10.1137\/1.9781611972740.51"},{"key":"ijdwm.2014010101-29","doi-asserted-by":"publisher","DOI":"10.4018\/jdwm.2009010104"}],"container-title":["International Journal of Data Warehousing and Mining"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=106859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:40:51Z","timestamp":1654098051000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijdwm.2014010101"}},"subtitle":["Fast and Memory Efficient Mining of High Utility Itemsets Based on Bitmap"],"short-title":[],"issued":{"date-parts":[[2014,1,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijdwm.2014010101","relation":{},"ISSN":["1548-3924","1548-3932"],"issn-type":[{"value":"1548-3924","type":"print"},{"value":"1548-3932","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,1]]}}}