IMPROVED DENSITY BASED ALGORITHM FOR DATA STREAM CLUSTERING

2015 ◽  
Vol 77 (18) ◽  
Author(s):  
Maryam Mousavi ◽  
Azuraliza Abu Bakar
Keyword(s):  
Data Streams ◽  
Data Stream ◽  
Clustering Algorithm ◽  
Local Density ◽  
Clustering Methods ◽  
Clustering Techniques ◽  
Stream Clustering ◽  
Density Based Clustering ◽  
Clustering Quality ◽  
Data Stream Clustering

In recent years, clustering methods have attracted more attention in analysing and monitoring data streams. Density-based techniques are the remarkable category of clustering techniques that are able to detect the clusters with arbitrary shapes and noises. However, finding the clusters with local density varieties is a difficult task. For handling this problem, in this paper, a new density-based clustering algorithm for data streams is proposed. This algorithm can improve the offline phase of density-based algorithm based on MinPts parameter. The experimental results show that the proposed technique can improve the clustering quality in data streams with different densities.

scholarly journals EvolveCluster: an evolutionary clustering algorithm for streaming data

2021 ◽  
Author(s):  
Christian Nordahl ◽  
Veselka Boeva ◽  
Håkan Grahn ◽  
Marie Persson Netz
Keyword(s):  
Data Streams ◽  
Data Stream ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Streaming Data ◽  
Evolutionary Clustering ◽  
Stream Clustering ◽  
The Past ◽  
Data Stream Clustering ◽  
Evolving Data

AbstractData has become an integral part of our society in the past years, arriving faster and in larger quantities than before. Traditional clustering algorithms rely on the availability of entire datasets to model them correctly and efficiently. Such requirements are not possible in the data stream clustering scenario, where data arrives and needs to be analyzed continuously. This paper proposes a novel evolutionary clustering algorithm, entitled EvolveCluster, capable of modeling evolving data streams. We compare EvolveCluster against two other evolutionary clustering algorithms, PivotBiCluster and Split-Merge Evolutionary Clustering, by conducting experiments on three different datasets. Furthermore, we perform additional experiments on EvolveCluster to further evaluate its capabilities on clustering evolving data streams. Our results show that EvolveCluster manages to capture evolving data stream behaviors and adapts accordingly.

Survey on Data Streams Clustering Techniques

2014 ◽  
Vol 933 ◽  
pp. 768-773 ◽  
Author(s):  
Wei Hua Ma
Keyword(s):  
Big Data ◽  
Data Streams ◽  
Data Stream ◽  
Research Topic ◽  
Sliding Windows ◽  
Clustering Techniques ◽  
Research Results ◽  
Stream Clustering ◽  
Data Stream Clustering

Data stream in a popular research topic in big data era. There are many research results on data stream clustering domain. This paper firstly has a brief introduction to data stream methodologies, such as sampling, sliding windows, etc. Finally, it presents a survey on data streams clustering techniques.

scholarly journals MCDAStream: a real-time data stream clustering based on micro-cluster density and attraction

2018 ◽  
Vol 7 (2) ◽  
pp. 270 ◽  
Author(s):  
Shyam Sunder Reddy K ◽  
Shoba Bindu C
Keyword(s):  
Real Time ◽  
Data Streams ◽  
Data Stream ◽  
Clustering Algorithm ◽  
Positional Information ◽  
Time Data ◽  
Stream Clustering ◽  
Real Time Data ◽  
Cluster Density ◽  
Data Stream Clustering

Real-time data stream clustering has been widely used in many fields, and it can extract useful information from massive sets of data. Most of the existing density-based algorithms cluster the data streams based on the density within the micro-clusters. These algorithms completely omit the data density in the area between the micro-clusters and recluster the micro-clusters based on erroneous assumptions about the distribution of the data within and between the micro-clusters that lead to poor clustering results. This paper describes a novel density-based clustering algorithm for evolving data streams called MCDAStream, which clusters the data stream based on micro-cluster density and attraction between the micro-clusters. The attraction of micro-clusters characterizes the positional information of the data points in each micro-cluster. We generate better clustering results by considering both micro-cluster density and attraction of micro-clusters. The quality of the proposed algorithm is evaluated on various synthetic and real-time datasets with distinct characteristics and quality metrics.

Data Stream Clustering Algorithm Based on Affinity Propagation and Density

2011 ◽  
Vol 267 ◽  
pp. 444-449 ◽  
Author(s):  
Yang Li ◽  
Bai Hong Tan
Keyword(s):  
Data Stream ◽  
Clustering Algorithm ◽  
Dynamic Environment ◽  
Reference Points ◽  
Affinity Propagation ◽  
Stream Clustering ◽  
Density Based Clustering ◽  
Data Stream Clustering ◽  
Point Set ◽  
Data Stream Analysis

Data stream clustering is an important issue in data steam mining. In the field of data stream analysis, conventional methods seem not quite efficient. Because neither they can adapt to the dynamic environment of data stream, nor the mining models and result s can meet users’ needs. An affinity propagation and grid based clustering method is proposed to effectively address the problem. The algorithm applies AP clustering on each partition of the data stream to generate reference point set, and subsequently density based clustering is applied to these reference points to get the clustering result of each periods. Theoretic analysis and experimental results show it is effective and efficient.

scholarly journals Constraint-based discriminative dimension selection for high-dimensional stream clustering

2018 ◽  
Vol 4 (3) ◽  
pp. 167
Author(s):  
Kitsana Waiyamai ◽  
Thanapat Kangkachit
Keyword(s):  
Data Streams ◽  
Clustering Algorithm ◽  
Expert Knowledge ◽  
Clustering Algorithms ◽  
Clustering Methods ◽  
Dynamic Constraints ◽  
Stream Clustering ◽  
Clustering Quality ◽  
Active Research ◽  
Clustering Data

Clustering data streams is one of active research topic in data mining. However, runtime of the existing stream clustering algorithms increases and their performance drop in the face of large number of dimensions. Complexity of the stream clustering methods is increased when perform on data with large number of dimensions. In order to reduce the clustering complexity, one possible solution consists in determining the appropriate subset of cluster dimensions via dimension projection. SED-Stream is an efficient clustering algorithm that supports high dimension data streams. The aim of this paper is to increase performance of SED-Stream in terms of both clustering quality and execution-time. In order to improve the clustering process, background or domain expert knowledge are integrated as “constraints” in SEDC-Stream. The new algorithm, SEDC-Stream, supports the evolving characteristics of the dynamic constraints which are activation, fading, outdating and prioritization. SEDC-Stream algorithm is able to reduce cluster splitting time, and place new incoming points to their suitable clusters. Compared to SED-Stream on the three real-world streams datasets, SEDC-Stream is able to generate a better clustering performance in terms of both purity and f-measure.

An Efficient Data Stream Clustering Algorithm Based on Dynamic Grids

2011 ◽  
Vol 186 ◽  
pp. 665-670
Author(s):  
Yun Wu ◽  
Feng Gao
Keyword(s):  
Data Streams ◽  
Data Stream ◽  
Arbitrary Shape ◽  
Clustering Algorithm ◽  
Stream Clustering ◽  
Research Fields ◽  
Efficient Data ◽  
Data Stream Clustering ◽  
Synthetic Datasets ◽  
Clustering Data

Data mining based on data stream has become one of hot research fields. In this paper we present a novel algorithm for clustering data streams based on dynamic grids named DG-CluStream. DG-CluStream partitions and prunes grids dynamically, improves the accuracy of grids gradually through saving feature tuples of grids. The algorithm can discover clusters with arbitrary shape and is more efficient than those static methods due to a notable decrease on the number of the grids. Through fading coefficient, DG-CluStream can also deal with the problem of concept drifting efficiently. The experimental results on real datasets and synthetic datasets demonstrate promising availabilities of the approach.

Distributed data stream clustering algorithm based on affinity propagation

2013 ◽  
Vol 33 (9) ◽  
pp. 2477-2481
Author(s):  
Jianpeng ZHANG ◽  
Xin JIN ◽  
Fucai CHEN ◽  
Hongchang CHEN ◽  
Ying HOU
Keyword(s):  
Data Stream ◽  
Clustering Algorithm ◽  
Affinity Propagation ◽  
Distributed Data ◽  
Stream Clustering ◽  
Data Stream Clustering
Sign in / Sign up

Export Citation Format

Share Document