Hui Du, Zhiyuan Hu^*, Depeng Lu, Jingrui Liu

CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 3239-3259, 2024, DOI:10.32604/cmc.2024.046314

Abstract Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets with uneven density. Additionally, they incur substantial computational costs when applied to high-dimensional data due to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset and compute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similarity matrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a vote for the point with the highest density among its KNN. By utilizing the vote counts of each point, we develop… More >

Dayu Xu^1,#, Jiaming Lü^1,#, Xuyao Zhang², Hongtao Zhang^1,*

CMC-Computers, Materials & Continua, Vol.78, No.2, pp. 2557-2573, 2024, DOI:10.32604/cmc.2024.045932

Abstract Data stream clustering is integral to contemporary big data applications. However, addressing the ongoing influx of data streams efficiently and accurately remains a primary challenge in current research. This paper aims to elevate the efficiency and precision of data stream clustering, leveraging the TEDA (Typicality and Eccentricity Data Analysis) algorithm as a foundation, we introduce improvements by integrating a nearest neighbor search algorithm to enhance both the efficiency and accuracy of the algorithm. The original TEDA algorithm, grounded in the concept of “Typicality and Eccentricity Data Analytics”, represents an evolving and recursive method that requires no prior knowledge. While the… More >