The full text of this article

 

An efficient strategy for mining high utility itemsets
by Bac Le, Huy Nguyen, Bay Vo
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 5, No. 2, 2011

 

Abstract: Methods for mining high utility itemsets from databases have been discussed widely in recent years. They mine itemsets having high utility from databases. Pruning candidates based on transaction-weighted utilisation value is a good method at all. In this paper, we develop a tree structure called WIT-tree, and use it in the proposed TWU-mining algorithm, an algorithm for improving the mining time and the search space. Using Diffset for fast computing transaction-weighted utilisation values and saving memory will be discussed. Experimental results show that proposed algorithms are more efficient.

Online publication date: Wed, 09-Mar-2011

 

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 Intelligent Information and Database Systems (IJIIDS):
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