Welcome to the InfoSci Platform
Reference Hub51
BAHUI: Fast and Memory Efficient Mining of High Utility Itemsets Based on Bitmap

BAHUI: Fast and Memory Efficient Mining of High Utility Itemsets Based on Bitmap

Wei Song, Yu Liu, Jinhong Li
Copyright: © 2014 |Volume: 10 |Issue: 1 |Pages: 15
ISSN: 1548-3924|EISSN: 1548-3932|EISBN13: 9781466653757|DOI: 10.4018/ijdwm.2014010101
Cite Article Cite Article

MLA

Song, Wei, et al. "BAHUI: Fast and Memory Efficient Mining of High Utility Itemsets Based on Bitmap." IJDWM vol.10, no.1 2014: pp.1-15. http://doi.org/10.4018/ijdwm.2014010101

APA

Song, W., Liu, Y., & Li, J. (2014). BAHUI: Fast and Memory Efficient Mining of High Utility Itemsets Based on Bitmap. International Journal of Data Warehousing and Mining (IJDWM), 10(1), 1-15. http://doi.org/10.4018/ijdwm.2014010101

Chicago

Song, Wei, Yu Liu, and Jinhong Li. "BAHUI: Fast and Memory Efficient Mining of High Utility Itemsets Based on Bitmap," International Journal of Data Warehousing and Mining (IJDWM) 10, no.1: 1-15. http://doi.org/10.4018/ijdwm.2014010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.