Welcome to the InfoSci Platform
Reference Hub2
Mining Top-k Regular High-Utility Itemsets in Transactional Databases

Mining Top-k Regular High-Utility Itemsets in Transactional Databases

P. Lalitha Kumari, S. G. Sanjeevi, T.V. Madhusudhana Rao
Copyright: © 2019 |Volume: 15 |Issue: 1 |Pages: 22
ISSN: 1548-3924|EISSN: 1548-3932|EISBN13: 9781522564188|DOI: 10.4018/IJDWM.2019010104
Cite Article Cite Article

MLA

Kumari, P. Lalitha, et al. "Mining Top-k Regular High-Utility Itemsets in Transactional Databases." IJDWM vol.15, no.1 2019: pp.58-79. http://doi.org/10.4018/IJDWM.2019010104

APA

Kumari, P. L., Sanjeevi, S. G., & Rao, T. M. (2019). Mining Top-k Regular High-Utility Itemsets in Transactional Databases. International Journal of Data Warehousing and Mining (IJDWM), 15(1), 58-79. http://doi.org/10.4018/IJDWM.2019010104

Chicago

Kumari, P. Lalitha, S. G. Sanjeevi, and T.V. Madhusudhana Rao. "Mining Top-k Regular High-Utility Itemsets in Transactional Databases," International Journal of Data Warehousing and Mining (IJDWM) 15, no.1: 58-79. http://doi.org/10.4018/IJDWM.2019010104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Mining high-utility itemsets is an important task in the area of data mining. It involves exponential mining space and returns a very large number of high-utility itemsets. In a real-time scenario, it is often sufficient to mine a small number of high-utility itemsets based on user-specified interestingness. Recently, the temporal regularity of an itemset is considered as an important interesting criterion for many applications. Methods for finding the regular high utility itemsets suffers from setting the threshold value. To address this problem, a novel algorithm called as TKRHU (Top k Regular High Utility Itemset) Miner is proposed to mine top-k high utility itemsets that appears regularly where k represents the desired number of regular high itemsets. A novel list structure RUL and efficient pruning techniques are developed to discover the top-k regular itemsets with high profit. Efficient pruning techniques are designed for reducing search space. Experimental results show that proposed algorithm using novel list structure achieves high efficiency in terms of runtime and space.

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.