Ensemble classification algorithm for high speed data stream
Gongde Guo
Abstract
Gongde Guo
Abstract
The algorithms for mining data streams have to make fast response and adapt to the concept drift at the premise of light demands on memory resources.This paper proposed an ensemble classification algorithm for high speed data stream.After dividing a given data stream into several data blocks,it computed the central point and subspace for every class on each block which were integrated as the classification model.Meanwhile,it made use of statistics to detect concept drift.The experimental results show that the proposed method not only classifies the data stream fast and adapt to the concept drift with higher speed,but also has a better classification performance.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The algorithms for mining data streams have to make fast response and adapt to the concept drift at the premise of light demands on memory resources.This paper proposed an ensemble classification algorithm for high speed data stream.After dividing a given data stream into several data blocks,it computed the central point and subspace for every class on each block which were integrated as the classification model.Meanwhile,it made use of statistics to detect concept drift.The experimental results show that the proposed method not only classifies the data stream fast and adapt to the concept drift with higher speed,but also has a better classification performance.
Key concepts: Concept drift, Computer science, Data stream, Data stream mining, Block (permutation group theory), Subspace topology, Data mining, Algorithm