A Quantified Approach for large Dataset Compression in Association Mining
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2013, Vol 15, Issue 3
Abstract
With the rapid development of computer and information technology in the last several decades, an enormous amount of data in science and engineering will continuously be generated in massive scale; data compression is needed to reduce the cost and storage space. Compression and discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is computationally the most expensive step in association rule discovery and therefore it has attracted significant research attention. However, existing compression algorithms are not appropriate in data mining for large data sets. In this research a new approach is describe in which the original dataset is sorted in lexicographical order and desired number of groups are formed to generate the quantification tables. These quantification tables are used to generate the compressed dataset, which is more efficient algorithm for mining complete frequent itemsets from compressed dataset. The experimental results show that the proposed algorithm performs better when comparing it with the mining merge algorithm with different supports and execution time.
Authors and Affiliations
Pratush Jadoun
Keywords
Related Articles
- EP ID EP110091
- DOI -
- Views 115
- Downloads 0
Enhancement of Cryptographic Security using Stopping Sets
In this paper, we have used channel codes in cryptographic secrecy. Main idea of this paper is to develop the notion of combined security due to cryptography and channel coding. Thus, it is providing a more complet...
Medical Image Segmentation Based on Level Set Method
This paper presents a shape-based approach to curve evolution for the segmentation of medical images. Automatic interpretation of medical images is a very difficult problem in computer vision. Several methods...
Improved Data Sharing Security with Dual-MAC Address Verification and SHCS
Abstract: For the easy and secure sharing of an unknown private data, an algorithm is developed. The proposed algorithm has improved the data sharing security with MAC address and SHCS verifications. This technique...
Implementation of Novel Algorithm (SPruning Algorithm)
Abstract: Decision trees are very significant for taking any type of verdict related to any field. Today there is ample amount of data but that data is uncooked data therefore to make it cooked data, data mining is...
P2P-BDS: Peer-2-Peer Botnet Detection System
Abstract: Internet has become an inevitable part of our lives. While internet offers a mass of useful services which makes communication easier and faster than ever, it presents some threats too along the way. Over...