International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Open Access | Fully Refereed | Peer Reviewed

ISSN: 2319-7064


Downloads: 119

Review Papers | Computer Science & Engineering | India | Volume 8 Issue 1, January 2019


A Comparative Analysis of Various Algorithms for High Utility Itemset Mining

Mansi Jaiswal, Vijay Prakash


Abstract: Frequent pattern mining has been an important topic since the concept of frequent itemsets was first introduced by Agrawal et al [6]. Given a dataset of transactions, frequent pattern mining finds the itemsets whose support (i. e. the percentage of transactions containing the itemset) is no less than a given minimum support threshold. However, neither the number of occurrences of an item in a transaction, nor the importance of an item, is considered in frequent pattern mining. Itemsets with more occurrences or importance may be more interesting to users, since they may bring more profit. In light of this, high utility itemset mining has been studied [9, 15, 42, 35]. In high utility itemset mining, the term utility refers to the importance of an itemset; e. g. , the total profit the itemset brings. An itemset is a High Utility Itemset (HUI) if the utility of the itemset is no less than a given minimum threshold. High utility itemset mining focuses more on the utility values in the dataset, which are usually related to profits for the business. Such utilities are interesting to the business owners, who could gain more profits from them. For example, supermarkets use frequent itemset mining to find merchandises customers usually buy together, so as to make recommendations to customers. However, with high utility itemset mining, supermarkets will be able to recommend not only the merchandises people usually buy together, but also the merchandises which will lead to more profits for the store.1 Most of the frequent pattern mining algorithms prune off itemsets in an early stage based on the popular Apriori property [8]: every sub-pattern of a frequent pattern must be frequent (also called the downward closure property). However, this property does not hold in high utility itemset mining, which makes mining high utility itemsets more challenging. The state-of-the-art approaches achieve good performance when the dataset is relatively small. However, the volume of data can grow so faster than expected, that a single machine may not be able to handle a very large amount of data.


Keywords: RUP/FRUP-GROWTH algorithm, HUI, data mining, apriori, big data


Edition: Volume 8 Issue 1, January 2019,


Pages: 2097 - 2100


How to Cite this Article?

Mansi Jaiswal, Vijay Prakash, "A Comparative Analysis of Various Algorithms for High Utility Itemset Mining", International Journal of Science and Research (IJSR), https://www.ijsr.net/get_abstract.php?paper_id=ART20194820, Volume 8 Issue 1, January 2019, 2097 - 2100

How to Share this Article?

Enter Your Email Address


Similar Articles with Keyword 'HUI'

Downloads: 109

Comparative Studies, Computer Science & Engineering, India, Volume 5 Issue 11, November 2016

Pages: 1419 - 1424

High Utility Itemsets Mining ? A Brief Explanation with a Proposal

Anu Augustin, Dr. Vince Paul

Share this Article

Downloads: 132

Research Paper, Computer Science & Engineering, India, Volume 8 Issue 2, February 2019

Pages: 548 - 554

Mining Top-k High Utility Itemset using Efficient Algorithms

Pramod Pardeshi, Ujwala Patil

Share this Article

Similar Articles with Keyword 'data mining'

Downloads: 0

Research Paper, Computer Science & Engineering, India, Volume 10 Issue 8, August 2021

Pages: 1068 - 1070

Predicting the Course Knowledge Level of Students using Data Mining Techniques

Thapaswini P S

Share this Article

Downloads: 66

Research Paper, Computer Science & Engineering, India, Volume 10 Issue 2, February 2021

Pages: 1669 - 1672

Random Forest Based Heart Disease Prediction

Adeen, Preeti Sondhi

Share this Article

Similar Articles with Keyword 'apriori'

Downloads: 104

Research Paper, Computer Science & Engineering, India, Volume 5 Issue 4, April 2016

Pages: 2334 - 2339

A Novel Way for Mining Frequent and Interesting Patterns using Genetic Algorithm

Reshu Tyagi, Muskaan Batra

Share this Article

Downloads: 106

Dissertation Chapters, Computer Science & Engineering, India, Volume 4 Issue 6, June 2015

Pages: 2953 - 2955

Probabilistic Frequent Sequential Patterns Analysis Using Apriori of Unsure Databases

Madhavi G. Patil, Ravi Patki

Share this Article

Similar Articles with Keyword 'big data'

Downloads: 2 | Weekly Hits: ⮙2 | Monthly Hits: ⮙2

Review Papers, Computer Science & Engineering, India, Volume 10 Issue 10, October 2021

Pages: 584 - 587

Big Data Getting Bigger: Catering Challenges

Daksh Mehta

Share this Article

Downloads: 105

Informative Article, Computer Science & Engineering, India, Volume 5 Issue 11, November 2016

Pages: 1482 - 1485

Overview of Big Data

Nivedita Manohar

Share this Article

Similar Articles with Keyword 'algorithm'

Downloads: 136 | Weekly Hits: ⮙2 | Monthly Hits: ⮙4

Research Paper, Computer Science & Engineering, India, Volume 9 Issue 11, November 2020

Pages: 457 - 461

Artificial Intelligence for Hiring

Ishan Borker, Ashok Veda

Share this Article

Downloads: 518 | Weekly Hits: ⮙3 | Monthly Hits: ⮙8

Research Paper, Computer Science & Engineering, India, Volume 9 Issue 7, July 2020

Pages: 1454 - 1458

Heart Disease Prediction with Machine Learning Approaches

Megha Kamboj

Share this Article
Top