کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4961866 1446519 2016 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
New Algorithm for Frequent Itemsets Mining from Evidential Data Streams
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
New Algorithm for Frequent Itemsets Mining from Evidential Data Streams
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Procedia Computer Science - Volume 96, 2016, Pages 645-653
نویسندگان
, , ,