Article citationsMore>>

N. F. Ayan, A. U. Tansel and E. Arkun, “An Efficient Algorithm to Update Large Itemsets with Early Pruning,” Proceedings of 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, 1999, pp. 287-291.

has been cited by the following article:

• TITLE: DARM: Decremental Association Rules Mining

  AUTHORS: Mohamed Taha, Tarek F. Gharib, Hamed Nassar

  KEYWORDS: Decremental Mining, Association Rules Maintenance, Updating Association Rules

  JOURNAL NAME: Journal of Intelligent Learning Systems and Applications, Vol.3 No.3, August 24, 2011

  ABSTRACT: Frequent item sets mining plays an important role in association rules mining. A variety of algorithms for finding frequent item sets in very large transaction databases have been developed. Although many techniques were proposed for maintenance of the discovered rules when new transactions are added, little work is done for maintaining the discovered rules when some transactions are deleted from the database. Updates are fundamental aspect of data management. In this paper, a decremental association rules mining algorithm is present for updating the discovered association rules when some transactions are removed from the original data set. Extensive experiments were conducted to evaluate the performance of the proposed algorithm. The results show that the proposed algorithm is efficient and outperforms other well-known algorithms.