An Enhanced Approach for Compress Transaction Databases

§ Avinashilingam deemed university for women,coimabtore

Send Message

To: Author

An Enhanced Approach for Compress Transaction Databases

Article Fingerprint

ReserarchID

CSTS4E7A

An Enhanced Approach for Compress Transaction Databases Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

Associative 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.

References

5 Cites in Article
  1. 1. J Park,M Chen,P Yu (1995). An effective hash-based algorithm for mining association rules. Proceeding of the 1995 ACM-SIGMOD International Conference on Management of Data (SIGMOD'95), 175-186.
  2. 2. R Agrawal,J Shafer (1996). Parallel mining of association rules. IEEE Transactions on Knowledge and Data Engineering, 8(6), 962-969.
  3. 3. Aristides Gionis,Heikki Mannila,Taneli Mielikäinen,Panayiotis Tsaparas (2007). Assessing data mining results via swap randomization. ACM Transactions on Knowledge Discovery from Data, 1(3), 14.
  4. 4. J Dai,D Yang,J Wu,M Hung (2008). An Efficient Data Mining Approach on Compressed Transactions. International Journal of Electrical and Computer Engineering, 3(2), 76-83.
  5. 5. R Bayardo (1998). Efficiently mining long patterns from databases. Proceeding of the 1998 ACM

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

v.vidhya rani. . "An Enhanced Approach for Compress Transaction Databases". Global Journal of Computer Science and Technology GJCST Volume 12 (GJCST Volume 12 Issue 2).

More Citation Formats

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST Classification H.2.8
H.2.4
Version of record

v1.2

Issue date
February 6, 2012

Language
English
Order Article Reprint
Experience in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 6.3K
Total Downloads: 423
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

An Enhanced Approach for Compress Transaction Databases

v.vidhya rani
v.vidhya rani Avinashilingam deemed university for women,coimabtore