Author(s): Sadak Srilekha, Laxman.Maddikunta
The discovery of itemsets with high utility like profits is referred by mining high utility itemsets from a transactional database. From past few years the number of relative algorithms has been proposed, for high utility itemsets the problem of producing a large number of candidate itemsets is incurred. The performance of mining is degraded by such a huge number of candidate itemsets in terms of space requirement and execution time. From the past few years transaction of Internet and purchasing of internet is increased. The client or customer can select the products based on their interest. In the internet the product sellers publish their ads. Two algorithms are proposed in this paper for mining high utility itemsets with a set of effective strategies for pruning candidate itemsets, namely UP-Growth (Utility Pattern Growth) and UP-Growth. In a tree-based data structure named UP-Tree (Utility Pattern Tree) The information of high utility itemsets is maintained such that with only two scans of database candidate itemsets can be generated efficiently