A STUDY ON EFFICIENT DATA MINING APPROACH ON COMPRESSED TRANSACTION

Dr. vidhya rani
Dr. vidhya rani * §
Contact
elizabeth shanthi
elizabeth shanthi
Contact
§ avinashilingam university

Send Message

To: Author

A STUDY ON EFFICIENT DATA MINING APPROACH ON COMPRESSED TRANSACTION

Article Fingerprint

ReserarchID

CST8IOY3

A STUDY ON EFFICIENT DATA MINING APPROACH ON COMPRESSED TRANSACTION Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
Access Review Comments
  • 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

Abstract

Data mining can be viewed as a result of the natural evolution of information technology. The spread of computing has led to an explosion in the volume of data to be stored on hard disks and sent over the Internet. This growth has led to a need for data compression, that is, the ability to reduce the amount of storage or Internet bandwidth required to handle the data. This paper analysis the various data mining approaches which is used to compress the original database into a smaller one and perform the data mining process for compressed transaction such as M2TQT,PINCER-SEARCH algorithm, APRIORI & ID3 algorithm, TM algorithm, AIS & SETM, CT-Apriori algorithm, CBMine, CT-ITL algorithm, FIUT-Tree. Among the various techniques M2TQT uses the relationship of transactions to merge related transactions and builds a quantification table to prune the candidate item sets which are impossible to become frequent in order to improve the performance of mining association rules. Thus M2TQT is observed to perform better than existing approaches.

References

27 Cites in Article
  1. Jia-Yu Dai,Don-Lin Yang,Jungpin Wu,Ming-Chuan Hung An Efficient Data Mining Approach on Compressed Transactions.
  2. T Qigarwal,Aijun Wan,An Compact Transaction Database for Efficient Frequent Pattern Mining.
  3. R Agarwal,T Imielinski,A Swami,Minign (1993). Association rules between sets of items in large databases.
  4. E Savasere,S Omiecinski,Navathe (1995). An Efficient Algorithm for Mining Association Rules in Large Databases.
  5. Santhosh Kumar (2010). Implementation of Web Usage Mining Using APRIORI and FP Growth Algorithms.
  6. Andrej Bratko,Bra (2006). Spam Filtering Using Statistical Data Compression Models.
  7. Chin-Feng Lee,Chia-Hsing Tsai Efficient Associating Mining Approaches for Compressing Incrementally Updatable Native XML Databases.
  8. G Grahne,J Zhu (2005). Fast algorithms for frequent itemset mining using FP-trees.
  9. J Arokia Renjit Dr,Shunmuganathan (2010). Mining The Data From Distributed Database Using An Improved Mining Algorithm.
  10. M Margahny,A Mitwaly (2005). Fast Algorithm for Mining Association Rules.
  11. M Sharma,* (2008). Jyotsana Sah**Applications of Data Compression Approach In Data Warehouse Design.
  12. Ramakrishnan Srikant,A Hannu Toivonen,Verkamo (2008). Management of Data.
  13. D Burdick,M Calimlim,J Flannick,J Gehrke,T Yiu (2005). MAFIA: A maximal frequent item set algorithm.
  14. Qian Wan,Aijun An Efficient Indirect Association Discovery using compact Transaction Database.
  15. Yuh-Jiuan Tsay,Tain-Jung Hsu,Jing-Rung Yu (2009). FIUT: A new method for mining frequent itemsets.
  16. Yudho Giri Sucahyo,Raj Gopalan CT-ITL: Efficient Frequent Item Set Mining Using A Compressed Prefix Tree With Pattern Growth.
  17. Yang-Liang Chen,Chin-Yuan Ho (2010). A Novelty Approach for Finding Frequent Itemsets in Horizontal and Vertical Layout-HVCFPMINETREE.
  18. Mingjun Song,Sanguthevar Rajasekaran (2006). A transaction mapping algorithm for frequent itemsets mining.
  19. Mafruz Ashrafi,David Taniar,Kate Smith (2003). A Compress-Based Association Mining Algorithm for Large Dataset.
  20. Jiawei Han,Jian Pei,Yiwen Yin,Runying Mao (2004). Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach.
  21. Jiawei Han,Yongjian Fu (1999). Mining Multiple-Level Association Rules in Large Databases.
  22. Yoones Asgharzadeh Sekhavat,M Fathian,M Gholamian,S Alizadeh (2010). Mining important association rules based on the RFMD technique.
  23. R Agrawal,R Srikant (1994). Fast Algorithms for Mining Association Rules.
  24. E Savasere,S Omiecinski,Navathe (1995). An Efficient Algorithm for Mining Association Rules in Large Databases.
  25. David Cheung,S Lee,Benjamin Kao (1997). A General Incremental Technique for Maintaining Discovered Association Rules.
  26. Wang Li Qingzhong,Haiyang,Yan Zhongmin,Ma Shaohan (2001). Efficient Mining of Association Rules by Reducing the Number of Passes over the Database.
  27. Ashish Mangalampalli,Vikram Pudi Fuzzy Association Rule Mining Algorithm for Fast and Efficient Performance on Very Large Datasets.
Show All References
Download References

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

Dr. vidhya rani, elizabeth shanthi. . "A STUDY ON EFFICIENT DATA MINING APPROACH ON COMPRESSED TRANSACTION". Global Journal of Computer Science and Technology GJCST Volume 11 (GJCST Volume 11 Issue 14).

More Citation Formats

Download Citation

  • Open Access
  • CC-BY-ND-NC 4.0
Download Article
Access OJS
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Association rulemerged transactionquantification table
Classification
GJCST Classification H.2.8
  • Submission ReceivedJune 10, 2011
  • Peer Review Double Blind
    Handling Editor
  • Accepted July 9, 2011
  • Published July 19, 2011
Version of record

v1.2

Issue date
August 2, 2011

Language
English
Order Article Reprint
Experiance 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.

View in VR
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.

View in 3D
Article Matrices
Total Views: 7.5K
Total Downloads: 596
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.

A STUDY ON EFFICIENT DATA MINING APPROACH ON COMPRESSED TRANSACTION

Dr. rani
Dr. rani avinashilingam university
elizabeth shanthi
elizabeth shanthi
  • Submission ReceivedJune 10, 2011
  • Peer Review Double Blind
    Handling Editor
  • Accepted July 9, 2011
  • Published July 19, 2011