Page
%P
-
Chapter and Conference Paper
Efficient Algorithms for Incremental Update of Frequent Sequences
Most of the works proposed so far on mining frequent sequences assume that the underlying database is static. However, in real life, the database is modified from time to time. This paper studies the problem o...
-
Chapter and Conference Paper
LGen — A Lattice-Based Candidate Set Generation Algorithm for I/O Efficient Association Rule Mining
Most algorithms for association rule mining are variants of the basic Apriori algorithm [2]. One characteristic of these Aprioribased algorithms is that candidate itemsets are generated in rounds, with the size o...