Mining dynamic databases by weighting

Abstract

A dynamic database is a set of transactions, in which the content and the size can change over time. There is an essential difference between dynamic database mining and traditional database mining. This is because recently added transactions can be more 'interesting' than those inserted long ago in a dynamic database. This paper presents a method for mining dynamic databases. This approach uses weighting techniques to increase efficiency, enabling us to reuse frequent itemsets mined previously. This model also considers the novelty of itemsets when assigning weights. In particular, this method can find a kind of new patterns from dynamic databases, referred to trend patterns. To evaluate the effectiveness and efficiency of the proposed method, we implemented our approach and compare it with existing methods.