International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 117 | Views: 185

Research Paper | Computer Science & Engineering | India | Volume 3 Issue 4, April 2014 | Rating: 6.7 / 10

An Efficient Algorithm for High Utility Mining

Mahija K C | Anu KS

Abstract: Mining high utility itemsets from a transactional database refers to the discovery of itemsets with high utility like profits. Efficient discovery of high utility itemsets from a transactional database is a crucial and difficult task. Given a transactional database and a profit table containing profit of each item present in the database, high utility itemsets can be discovered. In recent years, several approaches have been proposed for generating high utility itemsets, but they incur the problems of producing a large number of candidate itemsets for high utility itemsets. The situation may become worse when the database contains lots of long transactions or lots of unpromising items. In this paper, we propose HUP-Tree (High Utility Pattern Tree), for maintaining information of high utility itemsets, which is then mined to produce high utility itemsets. The proposed methods reduce the number of candidate sets efficiently and improve the mining performance in terms of execution time and space requirement. This approach is quite effective especially when transactions contain lots of unpromising items

Keywords: High utility mining, data mining, transaction utility, transaction weighted utility, utility mining

Edition: Volume 3 Issue 4, April 2014,

Pages: 213 - 217

How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link

Verification Code will appear in 2 Seconds ... Wait