HURI - A novel algorithm for mining high utility rare itemsets

11Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In Data mining field, the primary task is to mine frequent itemsets from a transaction database using Association Rule Mining (ARM). Utility Mining aims to identify itemsets with high utilities by considering profit, quantity, cost or other user preferences. In market basket analysis, high consideration should be given to utility of item in a transaction, since items having low selling frequencies may have high profits. As a result, High Utility Itemset Mining emerged as a revolutionary field in Data Mining. Rare itemsets provide useful information in different decision-making domains. High Utility Rare Itemset Mining, HURI algorithm proposed in [12], generate high utility rare itemsets of users' interest. HURI is a two-phase algorithm, phase 1 generates rare itemsets and phase 2 generates high utility rare itemsets, according to users' interest. In this paper, performance evaluation and complexity analysis of HURI algorithm, based on different parameters have been discussed which indicates the efficiency of HURI. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Pillai, J., Vyas, O. P., & Muyeba, M. (2013). HURI - A novel algorithm for mining high utility rare itemsets. In Advances in Intelligent Systems and Computing (Vol. 177 AISC, pp. 531–540). Springer Verlag. https://doi.org/10.1007/978-3-642-31552-7_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free