A probability‑based incremental association rule discovery algorithm for record insertion and deletion

Simple item page
dc.contributor.authorThusaranon, Panita
dc.contributor.authorKreesuradej, Worapoj
dc.date.accessioned2026-08-06T10:11:44Z
dc.date.available2026-08-06T10:11:44Z
dc.date.issued2015-07-01
dc.description.abstractThe maintenance of association rules for dynamic database is an important problem because the updates may not only invalidate some existing rules but also make other rules relevant. This paper is the extension work of probability-based incremental association rule discovery algorithm which can only handle new data insert into a dynamic database. Unlike the previous work, the proposed algorithm can efficiently handle in case of insertion as well as deletion simultaneously. Basically, the proposed algorithm maintains the support counts of frequent itemsets and promising frequent itemsets, i.e., infrequent itemsets that promise to be frequent in the future, in an original database. Promising frequent itemsets, which are obtained by using the principle of Bernoulli trials, can help to reduce a number of times to rescan the original database. The support counts of new candidate itemsets are approximated by using the principle of maximum possible value. The experimental results show that the execution time of the proposed algorithm is faster than that of Apriori, FUP2, EDUA, and pre-large algorithm.
dc.identifier.citationArtificial Life and Robotics, 20(2), 115-123, 2015
dc.identifier.doi10.1007/s10015-015-0210-4
dc.identifier.issn14335298
dc.identifier.other2-s2.0-84943350361
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/6297
dc.sourceArtificial Life and Robotics
dc.subjectAssociation rule discovery
dc.subjectData mining
dc.subjectIncremental association rule discovery
dc.subjectRules maintenance
dc.titleA probability‑based incremental association rule discovery algorithm for record insertion and deletion
dc.typeArticle

Files

Collections

Research