An Improved Apriori Algorithm Based on Matrix Data Structure

Provided by: Global Journals
Topic: Data Management
Format: PDF
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 complexities and overall decreases the efficiency of classical Apriori algorithm. To overcome the limitations of classical algorithm, the authors 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.

Find By Topic