Algorithm for Mining High Utility Itemsets

Author(s):

Trupti T Mudkanna , DKTE Society's Textile & Engineering Institute, Ichalkaranji; Suhas B Bhagate, DKTE Society's Textile & Engineering Institute, Ichalkaranji

Keywords:

Frequent Itemset, Closedþ High Utility Itemset, Lossless and Concise Representation, Utility Mining, Data Mining

Abstract:

Mining high utility itemsets (HUIs) from databases is a very difficult data mining task, in which fining of itemsets with high utilities (e.g. high profits) takes place. However, it may present too many HUIs to users, which also degrades the efficiency of the mining process. To achieve high efficiency for the mining task and provide a concise mining result to users, this paper proposes a novel framework for mining high utility itemsets (CHUIs), which gives as a compact and lossless representation of HUIs and three efficient algorithms named as AprioriHC (Apriori based algorithm for mining High utility itemsets), AprioriHC-D (AprioriHC algorithm with Discarding unpromising and isolated items) and CHUD (High Utility Itemset Discovery) to find this representation. Further, a method called DAHU (Derive All High Utility Itemsets) is proposed to recover all HUIs from the set of CHUIs without accessing the original database.

Other Details:

Manuscript Id	:	IJSTEV4I5007
Published in	:	Volume : 4, Issue : 5
Publication Date	:	01/12/2017
Page(s)	:	36-40

Download Article