Density-based clustering of data streams at multiple resolutions
In data stream clustering, it is desirable to have algorithms that are able to detect clusters of arbitrary shapes, changing clusters that evolve over time, and clusters with noise. In recent years, stream data clustering algorithms are based on an online-offline approach: The online component captu...
Saved in:
Main Author: | Wan, Li |
---|---|
Other Authors: | Ng Wee Keong |
Format: | Student Research Poster |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/84871 http://hdl.handle.net/10220/9065 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
CASTLE: Continuously anonymizing data streams
by: Cao, J., et al.
Published: (2013) -
Evolving large-scale data stream analytics based on scalable PANFIS
by: Za'in, Choiru, et al.
Published: (2021) -
Exploring time related issues in data stream processing
by: WU JI
Published: (2011) -
Data-driven memory management for stream join
by: Wu, J., et al.
Published: (2013) -
A novel drift detection algorithm based on features’ importance analysis in a data streams environment
by: Duda, Piotr, et al.
Published: (2020)