arrow
返回

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
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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.
Keyword:
Data stream
Density-based clustering
Merging
Pruning
Varying density
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

B
bu ali sina university
学者数:
3.1K
论文数: 3.1K
被引数: 34
I
Islamic Azad University
学者数:
4.0W
论文数: 3.3W
被引数: 9.8K
U
Universiti Kebangsaan Malaysia
学者数:
1.5W
论文数: 1.1W
被引数: 126
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
err分享
err收藏
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
err分享
err收藏
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
err分享
err收藏
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.
err分享
err收藏
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
err分享
err收藏
A new Growing Neural Gas for clustering data streams
err2016-06-01
err42
PREAI
errGhesmoune, Mohammed; Lebbah, Mustapha; Azzag, Hanene
err分享
err收藏
Gas Turbine Performance燃气轮机性能
err
IF0
err2008-02-11
err0
PREAI
errPhilip P. Walsh; Paul Fletcher
err分享
err收藏
学者 查看更多内容