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

Dynamic memory Allocation using ballooning and virtualization in cloud computing

Cloud computing has changed the way in which computer resources are used and shared. Once we register with cloud service provider we can access the software or hardware resources without the need to purchase our own prod...

Test Cases Prioritization For Event –Driven Software By Using Genetic Algorithm

Abstract: Event-Driven software (EDS) is being used very frequently in this interconnected world of ubiquitous computing. Two mostly used classes are the GUI stand alone applications and Web applications. Testing ofthese...

 Enhancement of Security Levels Using a Secure Intrusion Detection System in Manets

Abstract: A Mobile Ad hoc Network (MANET) is a system of wireless mobile nodes that dynamically self-organize in arbitrary and temporary network topologies .A Security is an important issue for ad hoc networks, especiall...

Big Data Authentication Using Cloud Storage with Fine Grained Updates

Abstract: Now a days cloud computing is one of the intensively growing technology.Cloud computing is storing and accessingbased program over the internet without use of your computer’s hard drive. Proposed system mainly...

 A Secured Agent-Based Framework for Data Warehouse Management

 Managing data warehouses (DWs) is typically characterized by intensive data processing and protracted activities which usually degrade performance. Moreover, DWs are usually designed with the overall objective...

Download PDF file
  • EP ID EP110091
  • DOI -
  • Views 105
  • Downloads 0

How To Cite

Pratush Jadoun (2013).  A Quantified Approach for large Dataset Compression in  Association Mining. IOSR Journals (IOSR Journal of Computer Engineering), 15(3), 79-84. https://europub.co.uk./articles/-A-110091