Matrix based Efficient Apriori Algorithm

Miss. Nutan Dhange, Prof. Sheetal Dhande

Abstract


Apriori algorithm is a classical algorithm of association rule mining and widely used for mining association rule which uses frequent item. This algorithm produces overfull candidates of frequent itemsets, so the algorithm needs scan database frequently when finding frequent itemsets, so it must be inefficient. To address this problem the algorithm has improved based on the matrix. The matrix effectively indicate the affairs in the database and deal with the matrix to produce the largest frequent itemsets and others. It needn’t scan the database time, again to lookup the affairs, also greatly reduce the number of candidates of frequent itemsets and improves the efficiency of computing.

Full Text:

PDF


DOI: https://doi.org/10.26483/ijarcs.v3i4.1336

Refbacks

  • There are currently no refbacks.




Copyright (c) 2016 International Journal of Advanced Research in Computer Science