Mining frequent itemsets is a very interesting issue in Data Streams handling, useful for several real world applications. This task reveals many challenges such the one-pass principle as well as performance problems due to the huge volumes of Data Streams. Performance is defined in terms of CPU and main memory consumption in terms of uncertainty management issues. In this paper, we introduce the concept of Evidential Data Streams and we present a new innovative algorithm for mining frequent itemsets from evidential data streams, based on the evidence theory concepts.
