An Improved Apriori Algorithm based on Matrix Data Structure

α
Shalini Dutt
Shalini Dutt
σ
Naveen Choudhary
Naveen Choudhary
ρ
Dharm Singh
Dharm Singh
α Maharana Pratap University of Agriculture and Technology Maharana Pratap University of Agriculture and Technology

Send Message

To: Author

An Improved Apriori Algorithm based on Matrix Data Structure

Article Fingerprint

ReserarchID

CSTSDE9S3A1

An Improved Apriori Algorithm based on Matrix Data Structure Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • 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

Abstract

Mining regular/frequent itemsets is very important concept in association rule mining which shows association among the variables in huge database. the classical algorithm used for extracting regular itemsets faces two fatal deficiencies .firstly it scans the database multiple times and secondly it generates large number of irregular itemsets hence increases spatial and temporal complexties and overall decreases the efficiency of classical apriori algorithm.to overcome the limitations of classical algorithm we proposed an improved algorithm in this paper with a aim of minimizing the temporal and spatial complexities by cutting off the database scans to one by generating compressed data structure bit matrix(b_matrix)-and by reducing redundant computations for extracting regular itemsets using top down method. theoritical analysis and experimental results shows that improved algorithm is better than classical apriori algorithm.

References

10 Cites in Article
  1. R Agrawal,R Srikant (1994). Fast algorithms for mining association rules in large databases.
  2. Han (2006). Data Mining Concepts and Techniques.
  3. Ji-Ming Hu,Xian Xue-Feng (2006). The Research and Improvement of Apriori for association rules mining.
  4. Z Chen,S Cai,Song,C Zhu (2011). A Improved Aproiri Algorithm based on Pruning Optimization and Transaction Reduction.
  5. R Agrawal,R Srikant Fast Algorithms for Mining Association Rules in Large Databases Clin Proceedings of the 20.
  6. Rui Chang,Zhiyi Liu An Improved Apriori Algorithm.
  7. Huiying Wang,Xiangwei Liu (2011). The research of improved association rules mining Apriori algorithm.
  8. Qiang Ma (2010). Improved Algorithm based on Apriori Algorithm.
  9. Yubo Jia,Guanghu Xia,Hongdan Fan,Qian Zhang,Xu Li (2012). An Improved Apriori Algorithm Based on Association Analysis.
  10. Jingyao Hu The Analysis on Apriori Algorithm Based on Interest Measure.

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

Shalini Dutt. 2014. \u201cAn Improved Apriori Algorithm based on Matrix Data Structure\u201d. Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 14 (GJCST Volume 14 Issue C5): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Version of record

v1.2

Issue date

July 28, 2014

Language
en
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.

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: 8884
Total Downloads: 2322
2026 Trends
Related Research

Published Article

Mining regular/frequent itemsets is very important concept in association rule mining which shows association among the variables in huge database. the classical algorithm used for extracting regular itemsets faces two fatal deficiencies .firstly it scans the database multiple times and secondly it generates large number of irregular itemsets hence increases spatial and temporal complexties and overall decreases the efficiency of classical apriori algorithm.to overcome the limitations of classical algorithm we proposed an improved algorithm in this paper with a aim of minimizing the temporal and spatial complexities by cutting off the database scans to one by generating compressed data structure bit matrix(b_matrix)-and by reducing redundant computations for extracting regular itemsets using top down method. theoritical analysis and experimental results shows that improved algorithm is better than classical apriori algorithm.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

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

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

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 Improved Apriori Algorithm based on Matrix Data Structure

Shalini Dutt
Shalini Dutt Maharana Pratap University of Agriculture and Technology
Naveen Choudhary
Naveen Choudhary
Dharm Singh
Dharm Singh

Research Journals