Dynamic Clustering Of High Speed Data Streams

Dynamic Clustering Of High Speed Data Streams

We consider the problem of clustering data streams. A data stream can roughly be thought of as a transient, continuously increasing sequence of time-stamped data. In order to maintain an up-to-date clustering structure, it is necessary to analyze the incoming data in an online manner, tolerating but...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of computer science issues 2012-03, Vol.9 (2), p.224-224
Hauptverfasser: Chandrika, J, Kumar, K R Ananda
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Clustering
Computer science
Dynamics
High speed
On-line systems
Online
Streams
Time delay
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider the problem of clustering data streams. A data stream can roughly be thought of as a transient, continuously increasing sequence of time-stamped data. In order to maintain an up-to-date clustering structure, it is necessary to analyze the incoming data in an online manner, tolerating but a constant time delay. The purpose of this study is to analyze the working of popular algorithms on clustering data streams and make a comparative analysis.
ISSN:1694-0814
1694-0784