Utility Mining Algorithm for High Utility Item sets from Transactional Databases
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 2
Abstract
The discovery of item sets with high utility like profits is referred by mining high utility item sets from a transactional database. Although in recent years a number of relevant algorithms have been proposed, for high utility item sets the problem of producing a large number of candidate item sets is incurred. The mining performance is degraded by such a large number of candidate item sets in terms of execution time and space requirement. When the database contains lots of long transactions or long high utility item sets the situation may become worse. Internet purchasing and transactions is increased in recent years, mining of high utility item sets especially from the big transactional databases is required task to process many day to day operations in quick time. There are many methods presented for mining the high utility item sets from large transactional datasets are subjected to some serious limitations such as performance of this methods needs to be investigated in low memory based systems for mining high utility itemsets from large transactional datasets and hence needs to address further as well. Another limitation is these proposed methods cannot overcome the screenings as well as overhead of null transactions; hence, performance degrades drastically. During this paper, we are presenting the new approach to overcome these limitations. We presented distributed programming model for mining business-oriented transactional datasets by using an improved Map Reduce framework on Hadoop, which overcomes not only the single processor and main memory-based computing, but also highly scalable in terms of increasing database size. We have used this approach with existing UP-Growth and UP-Growth+ with aim of improving their performances further. In experimental studies we will compare the performances of existing algorithms UP-Growth and UP-Growth+ against the improve UP-Growth and UP-Growth+ with Hadoop.
Authors and Affiliations
Arati W. Borkar
Keywords
Related Articles
- EP ID EP99703
- DOI 10.9790/0661-16253440
- Views 127
- Downloads 0
Sentiment Analysis of English and Tamil Tweets using Path Length Similarity based Word Sense Disambiguation
Abstract: In social media, users have the privilege of connecting with people and extensively communicate, share information, discuss topics of recent trends. Friendster, LinkedIn, Instagram, Twitter are some media throu...
Secure System Password (SSP) Application for NT Editor Hacking Tool
Abstract: In windows, the password will be stored in SAM registry by default. This SAM registry hides the windows password when the system is in ON state. The password in SAM registry will be cleared or changed by using...
Analysis of Various Recommendation Systems
Abstract: In today’s world the only way to catch and keep user’s attention to one’s website is to provide them with the recommendation list to match the needs of user. In this paper the most popular and widely used recom...
Energy Consumption Using Network Stability And Multi-hop Protocol For Link Efficiency in Wireless Body Area Networks
Abstract: In this paper, we propose a minimum, power efficient and max throughput routing protocol for Wireless Body Area Networks (WBANs). We use multi-hop topology to achieve minimum energy consumption and longer...
The Improved Image Encryption-Compression System for Error Clustering and Random Permutation
Abstract: Image encryption must be led before image pressure. In this paper we concentrate how to plan a couple of image encryption and pressure calculations such that packing encoded images can at present be proficientl...