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 88
- Downloads 0
Steiner Tree: approach applying for shortest path in selected network
This paper focus on approach for shortest path from source to destination in which an autonomous system for virtual private network, whose communicate with each other in a private area. For selecting a shorte...
Online Password Guessing Attacks by Using Persuasive Click Point with Dynamic User Block
Abstract: The goal of knowledge-based authentication system is to guide the users in creating graphical passwords. User often creates memorable passwords that are easy for attackers to guess, but strong system assi...
Detecting Good Neighbor Nodes and Finding Reliable Routing Path Based on AODV Protocol
Wireless operations allow services, such as long-range communications, that are impossible or impractical to implement with the use of wires. It is supported by well-liked technique known as Adhoc Protocol  ...
ID3 Derived Fuzzy Rules for Predicting the Students AcedemicPerformance
Abstract: This paper presents a technique to use ID3 decision rules to produce fuzzy rules to get the optimizeprediction of the students academic performance. In this paper, a the student administrative data for a...
A Novel Interface to a Web Crawler using VB.NET Technology
The number of web pages is increasing into millions and trillions around the world. To make searching much easier for users, web search engines came into existence. Web Search engines are used to find speci...