On Density-Based Data Streams Clustering Algorithms： A Survey

Clustering data streams has drawn lots of attention in the last few years due to their ever-growing presence. Data streams put additional challenges on clustering such as limited time and memory and one pass clustering. Furthermore, discovering clusters with arbitrary shapes is very important in dat...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of computer science and technology Ročník 29; číslo 1; s. 116 - 141
Hlavní autori: Amini, Amineh, Wah, Teh Ying, Saboohi, Hadi
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 2014
Springer Nature B.V
Predmet:
Algorithms
Analysis
Artificial Intelligence
Cluster analysis
Clustering
Computer Science
data
Data processing
Data Structures and Information Theory
Data transmission
Datasets
Density
density-based
grid-based
Information Systems Applications (incl.Internet)
Knowledge
micro-clustering
micro-clusteringdata
Noise
Regular Paper
Social networks
Social research
Software Engineering
stream
Studies
Theory of Computation
density-based clustering
data stream
micro-clustering
grid-based clustering
ISSN:1000-9000, 1860-4749
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Clustering data streams has drawn lots of attention in the last few years due to their ever-growing presence. Data streams put additional challenges on clustering such as limited time and memory and one pass clustering. Furthermore, discovering clusters with arbitrary shapes is very important in data stream applications. Data streams are infinite and evolving over time, and we do not have any knowledge about the number of clusters. In a data stream environment due to various factors, some noise appears occasionally. Density-based method is a remarkable class in clustering data streams, which has the ability to discover arbitrary shape clusters and to detect noise. Furthermore, it does not need the nmnber of clusters in advance. Due to data stream characteristics, the traditional density-based clustering is not applicable. Recently, a lot of density-based clustering algorithms are extended for data streams. The main idea in these algorithms is using density- based methods in the clustering process and at the same time overcoming the constraints, which are put out by data streanFs nature. The purpose of this paper is to shed light on some algorithms in the literature on density-based clustering over data streams. We not only summarize the main density-based clustering algorithms on data streams, discuss their uniqueness and limitations, but also explain how they address the challenges in clustering data streams. Moreover, we investigate the evaluation metrics used in validating cluster quality and measuring algorithms＇ performance. It is hoped that this survey will serve as a steppingstone for researchers studying data streams clustering, particularly density-based algorithms.
Bibliografia:11-2296/TP
Amineh Amini, Mernber~ IEEE, Teh Ying Wah, and Hadi Saboohi, Member, ACM, IEEE （ Department of Information Systems, Faculty of Computer Science and Information Technology, University of Malaya Kuala Lumpur 50603, Malaysia） E-mail： amini@siswa.um.edu.my; tehyw@um.edu.my; saboohi@siswa.um.edu.my
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-014-1416-y