arrow
Return

Varying density method for data stream clustering

delete2020-12-01
delete6
PRE
AI
M
Maryam Mousavi *
H
Hassan Khotanlou
DOI:10.1016/j.asoc.2020.106797delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, a new online-offline density-based clustering method for data stream with varying density is proposed. In the online phase, the summary of data is created (often known as microclusters) and in the offline phase, this synopsis of data is used to form the final clusters. Finding the accurate micro-clusters is the goal of online phase. When a new data point arrives, the procedure of finding the nearest and best fit micro-cluster is the time consuming process. This procedure can lead to increase the execution time. To address this problem, a new merging algorithm is proposed. For maintaining a limited number of micro-clusters, a pruning process is applied along with the summarization process. In the existing methods, this pruning process takes too long time to remove micro-clusters whose do not receive objects frequently that cause to increase the memory usage. In this paper, to solve this problem, a new pruning algorithm is introduced. Another problem with density-based methods is that they use global parameters in the data sets with varying density that can lead to dramatic decrease in the clustering quality. In our work, to create final clusters, a new density-based algorithm that works based on only MinPts parameter is proposed for increasing the clustering quality of data sets with varying density. The performance evaluation on both synthetic and real data sets illustrates the efficiency and effectiveness of the proposed method. The experimental results show that our method can increase the clustering quality in data sets with varying density along with limited time and memory usage. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Data stream
Density-based clustering
Merging
Pruning
Varying density
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

B
bu ali sina university
Scholars:
3.1K
Papers: 3.1K
Citations: 34
I
Islamic Azad University
Scholars:
4.0W
Papers: 3.3W
Citations: 9.8K
U
Universiti Kebangsaan Malaysia
Scholars:
1.5W
Papers: 1.1W
Citations: 126
researcher View more organizations
Cited Papers

Cited Papers

errShare
errSave
errShare
errSave
Data Stream Clustering: A Survey
err2013-07-11
err386
errOAAI
errSilva, Jonathan A.; Faria, Elaine R.; Barros, Rodrigo C.; Hruschka, Eduardo R.; de Carvalho, Andre C. P. L. F.; Gama, Joao
errShare
errSave
Density-Based Clustering of Data Streams at Multiple Resolutions
err2009-07-28
err109
errOAAI
errWan, Li; Ng, Wee Keong; Dang, Xuan Hong; Yu, Philip S.; Zhang, Kuan
errShare
errSave
Online behavior change detection in computer games
err2013-11-01
err14
PREAI
errVallim, Rosane M. M.; Andrade Filho, Jose A.; de Mello, Rodrigo F.; de Carvalho, Andre C. P. L. F.
errShare
errSave
Fast Expansion of the Asian-Pacific Genotype of the Chikungunya Virus in Indonesia
err2021-04-21
err0
errOAAI
errYusnita Mirna Anggraeni; Triwibowo Ambar Garjito; Mega Tyas Prihatin; Sri Wahyuni Handayani; Kusumaningtyas Sekar Negari; Ary Oktsari Yanti; Muhammad Choirul Hidajat; Dhian Prastowo; Tri Baskoro Tunggul Satoto; Sylvie Manguin; Laurent Gavotte; Roger Frutos
errShare
errSave
A new Growing Neural Gas for clustering data streams
err2016-06-01
err42
PREAI
errGhesmoune, Mohammed; Lebbah, Mustapha; Azzag, Hanene
errShare
errSave
Gas Turbine Performance
err
IF0
err2008-02-11
err0
PREAI
errPhilip P. Walsh; Paul Fletcher
errShare
errSave
researcher View more