Incremental mining of frequent sequences from a window sliding over a stream of itemsets

National audienceWe introduce the problem of mining frequent sequences in a window sliding over a stream of itemsets. To address this problem, we present a complete and correct incremental algorithm based on a representation of frequent sequences inspired by the PSP algorithm and a method for counting the minimal occurrences of a sequence. The experiments were conducted on simulated data and on real instantaneous power consumption data. The results show that our incremental algorithm significantly improves the computation time compared to a non-incremental approach