UP-GNIV: an expeditious high utility pattern mining algorithm for itemsets with negative utility values
by Kannimuthu Subramanian; Premalatha Kandhasamy
International Journal of Information Technology and Management (IJITM), Vol. 14, No. 1, 2015

Abstract: Traditionally, frequent pattern mining dealt in extracting frequency pattern from transaction databases by not considering utility factors. Utility-based data mining focuses on all aspects of economic utility in data mining and is aimed at incorporating utility in both predictive and descriptive data mining tasks. High utility itemset (HUI) mining process incurs the problem of producing a large number of candidate itemsets since downward closure property used in frequent itemset mining is not applied in utility mining and itemsets associated with negative utility values are not supported by existing algorithms. Here, mining high utility itemset with negative item values using Utility Pattern-Growth approach for Negative Item Values (UP-GNIV) approach is proposed and compared against high utility itemsets with negative item values (HUINIV)-mine. The experimental result shows that the suggested approach performs well.

Online publication date: Sat, 09-May-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information Technology and Management (IJITM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com