scholarly journals A novel evolving data stream clustering method based on optimization model

2017 ◽  
Vol 47 (11) ◽  
pp. 1464-1482
Author(s):  
Liang BAI ◽  
Hangyuan DU ◽  
Wenjian WANG
2021 ◽  
Vol 1955 (1) ◽  
pp. 012048
Author(s):  
Chunhua Yang ◽  
Cong Wang ◽  
Xiao Hu ◽  
Niankang You ◽  
Xuguang Yang

2021 ◽  
Author(s):  
Christian Nordahl ◽  
Veselka Boeva ◽  
Håkan Grahn ◽  
Marie Persson Netz

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.


2020 ◽  
Vol 11 (2) ◽  
pp. 19-36
Author(s):  
Umesh Kokate ◽  
Arviand V. Deshpande ◽  
Parikshit N. Mahalle

Evolution of data in the data stream environment generates patterns at different time instances. The cluster formation changes with respect to time because of the behaviour and members of clusters. Data stream clustering (DSC) allows us to investigate the changes of the group behaviour. These changes in the behaviour of the group members over time lead to formation of new clusters and may make old clusters extinct. Also, these extinct old clusters may recur over time. The problem is to identify and record these change patterns of evolving data streams. The knowledge obtained from these change patterns is then used for trends analysis over evolving data streams. In order to address this flexible clustering requirement, density-based clustering method is proposed to dynamically cluster evolving data streams. The decay factor identifies formation of new clusters and diminishing of older clusters on arrival of data points. This indicates trends in evolving data streams.


2013 ◽  
Vol 380-384 ◽  
pp. 1529-1532
Author(s):  
Shuang Zhang ◽  
Shi Xiong Zhang

This paper presents a probabilistic data stream clustering method P-Stream. An effective clustering algorithm called P-Stream for probabilistic data stream is developed in this paper for the first time. For the uncertain tuples in the data stream, the concepts of strong cluster, transitional clusters and weak cluster are proposed in the P-Stream. With these concepts, an effective strategy of choosing candidate cluster is designed, which can find the sound cluster for every continuously arriving data point. In this paper, we systematically defined the dataspace, the uncertain data, and proposed a updated algorithm of queries on uncertain data based on Effective Clustering Algorithm.


2016 ◽  
Vol 126 ◽  
pp. 111-116 ◽  
Author(s):  
Baoju Zhang ◽  
Shan Qin ◽  
Wei Wang ◽  
Dan Wang ◽  
Lei Xue

Sign in / Sign up

Export Citation Format

Share Document