Sciweavers

Share
BDA
2000

Incremental Mining of Sequential Patterns in Large Databases

9 years 9 months ago
Incremental Mining of Sequential Patterns in Large Databases
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining on the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment. Key words: Sequential patterns, incremental mining, data mining
Florent Masseglia, Pascal Poncelet, Maguelonne Tei
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2000
Where BDA
Authors Florent Masseglia, Pascal Poncelet, Maguelonne Teisseire
Comments (0)
books