AN ENHANCED UPGROWTH ALGORITHM FOR TEMPORAL HIGH UTILITY ITEM MINING
Journal Title: International Journal of Engineering Sciences & Research Technology - Year 2015, Vol 4, Issue 1
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
- EP ID EP158303
- DOI -
- Views 70
- Downloads 0
Big Data: Performance Analysis of Vendor and Value Creation through Big Data Analytics
There has been a dramatic increase in the amount of data generated which is currently measured in zettabytes and still increasing. Managing the fast paced increase in data volume is going to be challenging as ever...
A REVIEW ON OBJECT REMOVAL USING EXAMPLER BASED IMAGE IMPAINTING TECHNIQUE
Image inpainting was historically done manually by painters for removing defect from paintings and photographs. Fill the region of missing information from a signal using surrounding information and re - form signa...
VIRTUAL MACHINE PLACEMENT AND LOAD REBALANCING ALGORITHMS IN CLOUD COMPUTING SYSTEMS
The goal of virtual machine placement in cloud environment is to provide better service to the cloud users, and also the effective use of available resources. In this paper a review of various algorithms has b...
Based on Claim Verification Handling Flood Attacks in Disruption Tolerant Network
Disruption-Tolerant Networks (DTNs) deliver data to the collection of intermittently connected nodes. In traditional networks, malicious nodes within a DTN may try to attempt a data destruction or delay in transmi...
Dynamic Time Sync Reference Load Balancing In Virtual Router Redundancy Protocol
In this paper, we discuss on Dynamic Time Sync Reference Load Balancing technique to enhance the Virtual Router Redundancy Protocol with Dynamic load balancing feature to utilize the redundant VRRP Backup device, inord...