کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
392683 | 665148 | 2014 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The CART decision tree for mining data streams
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: The CART decision tree for mining data streams The CART decision tree for mining data streams](/preview/png/392683.png)
چکیده انگلیسی
One of the most popular tools for mining data streams are decision trees. In this paper we propose a new algorithm, which is based on the commonly known CART algorithm. The most important task in constructing decision trees for data streams is to determine the best attribute to make a split in the considered node. To solve this problem we apply the Gaussian approximation. The presented algorithm allows to obtain high accuracy of classification, with a short processing time. The main result of this paper is the theorem showing that the best attribute computed in considered node according to the available data sample is the same, with some high probability, as the attribute derived from the whole data stream.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 266, 10 May 2014, Pages 1–15
Journal: Information Sciences - Volume 266, 10 May 2014, Pages 1–15
نویسندگان
Leszek Rutkowski, Maciej Jaworski, Lena Pietruczuk, Piotr Duda,