An efficient and sensitive decision tree approach to mining concept-drifting data streams

檔案

本條目沒有附加檔案。

日期

2008

類型

期刊名稱

INFORMATICA

卷期與頁次

第 19 卷第 1 期,頁 135–156

ISSN

0868-4952

語言

英文

摘要

Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data block is basically a random sample from a stationary distribution, but many databases available violate this assumption. That is, the class of an instance may change over time, known as concept drift. In this paper, we propose a Sensitive Concept Drift Probing Decision Tree algorithm (SCRIPT), which is based on the statistical X(2) test, to handle the concept drift problem on data streams. Compared with the proposed methods, the advantages of SCRIPT include: a) it can avoid unnecessary system cost for stable data streams b) it can immediately and efficiently corrects original classifier while data streams are instable; c) it is more suitable to the applications in which a sensitive detection of concept drift is required.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Tsai, C.-J., Lee, C.-I., & Yang, W.-P. (2008). An efficient and sensitive decision tree approach to mining concept-drifting data streams. INFORMATICA, 19(1), 135–156. https://ir.lib.nycu.edu.tw/handle/11536/9882

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/9882