An Enhanced Approach for Compress Transaction Databases

Simple item page
dc.categoryJournal Article
dc.contributor.authorElizabeth Shanthi, I
dc.date.accessioned2017-03-28T18:47:57Z
dc.date.available2017-03-28T18:47:57Z
dc.date.issued2012
dc.departmentComputer Scienceen_US
dc.description.abstractAssociative rule mining is defined as the task that deals with the extraction of hidden knowledge and-frequent patterns from very large databases. Traditional associative mining processes are iterative, time consuming and storage expensive. To solve these processes, a way of representation that reduces this size and at the same time maintains all the important and relevant data needed to extract the desired knowledge from transaction databases is needed. This paper proposes a method that merges the transactions in the transaction database and uses FP-Growth algorithm for mining associative knowledge is presented. The experimental results in terms of compression ratio, both in terms of storage required and number of transactions, prove that the proposed algorithm is an improved version to the existing systems.en_US
dc.identifier.urihttps://ir.avinuty.ac.in/handle/avu/2216
dc.langEnglishen_US
dc.publisher.nameGlobal Journal of Computer Science And Technologyen_US
dc.publisher.typeInternationalen_US
dc.titleAn Enhanced Approach for Compress Transaction Databasesen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
CS.international_2011-2013_020.pdf
Size:
5.17 MB
Format:
Adobe Portable Document Format
Download
Collections
Journal Article