AN ENHANCED UPGROWTH ALGORITHM FOR TEMPORAL HIGH UTILITY ITEM MINING

Abstract

 High utility item set mining from a transactional database helps to discover the items with high utility based on profit, cost and quantity. Even though many numbers of significant algorithms have been proposed in recent years they experienced the problem of producing a large number of candidate itemsets for high utility itemsets. Such a huge number of candidate item sets degrades and reduces the mining performance in terms of storage space requirement and execution time. The situation may become worse when the database contains lots of datasets, long transactions or long high utility itemsets. The proposal introduces two algorithms which are temporal utility pattern growth (TUP-Growth) and temporal UP-Growth+, for mining high utility itemsets with a set of effective strategies for pruning candidate item sets rapidly. The information of high utility itemsets is maintained in a tree-based data structure named utility pattern tree (TUP-Tree) such that candidate itemsets can be generated efficiently with only two scans of database, then that will be segmented into multiple clusters for fast computation. The proposed algorithms reduce the number of candidates and database scans effectively. This also outperforms best than the existing algorithms and significantly reduces the runtime and memory and storage overhead, especially when databases contain lots of high and long transactions

Authors and Affiliations

S. Gomathi, M. Suganya

Keywords

Related Articles

 COMPARATIVE ANALYSIS OF MLP-RBF BASED NETWORKS FOR DETECTION AND CLASSIFICATION OF POWER QUALITY DISTURBANCES

 Electrical energy is first and foremost criterion for overall economic growth of the society. Widespread expansion of automated electronic equipments and miniaturization in micro-electronics used in power system h...

Estimation in Step Stress Partially Accelerated Life Tests for Rayleigh Distribution Using Type-I Censoring

In this study a step stress partially accelerated life test (SSPALT) using type-I censoring is obtained for Rayleigh distribution. This distribution has been found appropriate for high reliability components. Maximum L...

 A Review of Image Denoisng Techniques

 One of the most fundamental challenges in the field of image processing is image denoising, where the primary objective is to estimate the original image by removing noise from a noisy version of the image. Many...

 Computer Aided Detection of Ischemic Stroke Using Verilog HDL

 Computed tomography (CT) images are widely used in the diagnosis of ischemic stroke because of its faster acquisition and compatibility with most life support devices. In present work we proposal advance technique...

Comparison of different Combining methods and Relaying Techniques in Cooperative Diversity

An ad-hoc network with a sender, a destination and a third station act-ing as a relay is analyzed. The channels are modeled containing thermal noise, Rayleigh fading and path loss. Different combining methods and diver...

Download PDF file
  • EP ID EP158303
  • DOI -
  • Views 76
  • Downloads 0

How To Cite

S. Gomathi, M. Suganya (2015).  AN ENHANCED UPGROWTH ALGORITHM FOR TEMPORAL HIGH UTILITY ITEM MINING. International Journal of Engineering Sciences & Research Technology, 4(1), 318-323. https://www.europub.co.uk/articles/-A-158303