Efficient Algorithm for High Utility Pattern Mining in Incremental Databases

In this proposed work, we will consider the problem of the incremental mining of sequential patterns when new transactions are added to dynamic database. We will strive for algorithm for mining frequent sequences that uses information collected during an earlier mining process to minimize the time and cost for finding new sequential patterns in the updated database. This could be useful for mining sequential patterns by applying this proposed algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database and an increment.