An efficient strategy for mining high utility itemsets. (10th March 2011)

• Record Type: Journal Article
• Authors: Le, Bac; Nguyen, Huy; Vo, Bay
• Is Part Of: International journal of intelligent information and database systems. Volume 5:Number 2(2011)
• Page Start: 164
• Page End: 176
• Publication Date: 2011-03-10
• Subjects: utility itemsets -- utility constraints -- utility upper bound -- transaction weighted utilisation -- WIT-tree -- tree structures; Database management -- Computer programs -- Periodicals; Information retrieval -- Computer programs -- Periodicals; Information storage and retrieval systems -- Computer programs -- Periodicals; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; Intelligent agents (Computer software) -- Periodicals; 006.33
• Languages: English
• ISSNs: 1751-5858

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.