Improving the Performance of Association Rule Mining Algorithms by Filtering Insignificant Transactions Dynamically

Research Article

Improving the Performance of Association Rule Mining Algorithms by Filtering Insignificant Transactions Dynamically

Rajendra K. Gupta and Dev Prakash Agrawal

Present study proposes an algorithm for finding frequent itemsets. Algorithm uses a novel approach to the insignificant transactions dynamically. It divides the tuples of the database to be mined intelligently in clusters. During a particular pass only those clusters that seem to be statistically useful are to be scanned and as a consequence all insignificant tuples will be filtered out dynamically. Further, the algorithm is based on a vertical data layout and offers flexibility during mining process. Experiments have been performed on real databases and the results have been presented. The results show that by removing false frequent items and insignificant transactions dynamically, the performance of association rule-mining algorithms can be improved. It has also been observed that the performance gap increases with the large size of database and/or when there exist prolific size frequent itemset in the database at the given value of minimum support.

PDF Fulltext XML References Citation

How to cite this article

Rajendra K. Gupta and Dev Prakash Agrawal, 2009. Improving the Performance of Association Rule Mining Algorithms by Filtering Insignificant Transactions Dynamically. Asian Journal of Information Management, 3: 7-17.

DOI: 10.3923/ajim.2009.7.17

URL: https://scialert.net/abstract/?doi=ajim.2009.7.17

Asian Journal of Information Management

Article Trend

Total views 263

Authors

Rajendra K. Gupta

Dev Prakash Agrawal

Keywords

Research Article

Improving the Performance of Association Rule Mining Algorithms by Filtering Insignificant Transactions Dynamically

How to cite this article

Related Articles

Leave a Comment