The Community for Technology Leaders
2010 IEEE International Conference on Data Mining (2010)
Sydney, Australia
Dec. 13, 2010 to Dec. 17, 2010
ISSN: 1550-4786
ISBN: 978-0-7695-4256-0
pp: 929-934
ABSTRACT
The problem of data stream classification is challenging because of many practical aspects associated with efficient processing and temporal behavior of the stream. Two such well studied aspects are infinite length and concept-drift. Since a data stream may be considered a continuous process, which is theoretically infinite in length, it is impractical to store and use all the historical data for training. Data streams also frequently experience concept-drift as a result of changes in the underlying concepts. However, another important characteristic of data streams, namely, concept-evolution is rarely addressed in the literature. Concept-evolution occurs as a result of new classes evolving in the stream. This paper addresses concept-evolution in addition to the existing challenges of infinite-length and concept-drift. In this paper, the concept-evolution phenomenon is studied, and the insights are used to construct superior novel class detection techniques. First, we propose an adaptive threshold for outlier detection, which is a vital part of novel class detection. Second, we propose a probabilistic approach for novel class detection using discrete Gini Coefficient, and prove its effectiveness both theoretically and empirically. Finally, we address the issue of simultaneous multiple novel class occurrence, and provide an elegant solution to detect more than one novel classes at the same time. We also consider feature-evolution in text data streams, which occurs because new features (i.e., words) evolve in the stream. Comparison with state-of-the-art data stream classification techniques establishes the effectiveness of the proposed approach.
INDEX TERMS
data stream, concept-evolution, novel class, outlier
CITATION

L. Khan et al., "Addressing Concept-Evolution in Concept-Drifting Data Streams," 2010 IEEE International Conference on Data Mining(ICDM), Sydney, Australia, 2010, pp. 929-934.
doi:10.1109/ICDM.2010.160
92 ms
(Ver 3.3 (11022016))