.png){kind=icon}
Return
SVStream: A Support Vector-Based Algorithm for Clustering Data Streams
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2011.263.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a novel data stream clustering algorithm, termed SVStream, which is based on support vector domain description and support vector clustering. In the proposed algorithm, the data elements of a stream are mapped into a kernel space, and the support vectors are used as the summary information of the historical elements to construct cluster boundaries of arbitrary shape. To adapt to both dramatic and gradual changes, multiple spheres are dynamically maintained, each describing the corresponding data domain presented in the data stream. By allowing for bounded support vectors (BSVs), the proposed SVStream algorithm is capable of identifying overlapping clusters. A BSV decaying mechanism is designed to automatically detect and remove outliers (noise). We perform experiments over synthetic and real data streams, with the overlapping, evolving, and noise situations taken into consideration. Comparison results with state-of-the-art data stream clustering methods demonstrate the effectiveness and efficiency of the proposed method.
Keywords:
Data stream clustering
support vector
clusters of arbitrary shape
overlapping
evolving
noise
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.9K
Citations:
3.2W
Organization
Cited Papers
ShareSaveSpontaneous pupil dilations during the resting state are associated with activation of the salience network.png)
NeuroImage
NeuroImageIF0
PREAI
ShareSaveShareSave
ShareSaveShareSaveSpatiotemporal Variation of Air Quality (PM and NO2) in Southern Paris during COVID-19 Lockdown PeriodsAtmosphere
OAAI
AtmosphereIF0
OAAIShareSave
View more