Article Fingerprint
ReserarchID
CSTSDE9S3A1
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.
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): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
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.
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.
Total Score: 103
Country: India
Subject: Global Journal of Computer Science and Technology - C: Software & Data Engineering
Authors: Shalini Dutt, Naveen Choudhary, Dharm Singh (PhD/Dr. count: 0)
View Count (all-time): 259
Total Views (Real + Logic): 8884
Total Downloads (simulated): 2322
Publish Date: 2014 07, Mon
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
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.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.