Prabhat Das^1,2, Dibya Jyoti Bora¹, Sajal Saha², Cheng-Chi Lee^3,4,*, Hirak Mazumdar²

CMES-Computer Modeling in Engineering & Sciences, Vol.147, No.1, 2026, DOI:10.32604/cmes.2026.079203 - 27 April 2026

Abstract Real-time data processing is essential in the evolving landscape of IoT applications, ensuring efficiency, reliability, and adaptability. However, conventional clustering algorithms often face difficulties in managing high-frequency, continuous IoT data streams due to limited adaptability and high computational overhead. To address these challenges, this study proposes a resilient adaptation of the BIRCH (Balanced Iterative Reducing and Clustering using Hierarchies) algorithm, tailored specifically for streaming IoT data. The enhanced approach dynamically recalculates clusters and determines the optimal number of clusters using the KneeLocator method. Unlike the original batch-oriented BIRCH, the modified version processes data incrementally, enabling More >

Jeng-Shyang Pan^1,2,3, Mengfei Zhang¹, Shu-Chuan Chu^2,*, Xingsi Xue⁴, Václav Snášel⁵

CMC-Computers, Materials & Continua, Vol.83, No.1, pp. 475-496, 2025, DOI:10.32604/cmc.2025.060170 - 26 March 2025

Abstract Data clustering is an essential technique for analyzing complex datasets and continues to be a central research topic in data analysis. Traditional clustering algorithms, such as K-means, are widely used due to their simplicity and efficiency. This paper proposes a novel Spiral Mechanism-Optimized Phasmatodea Population Evolution Algorithm (SPPE) to improve clustering performance. The SPPE algorithm introduces several enhancements to the standard Phasmatodea Population Evolution (PPE) algorithm. Firstly, a Variable Neighborhood Search (VNS) factor is incorporated to strengthen the local search capability and foster population diversity. Secondly, a position update model, incorporating a spiral mechanism, is… More >

Ahmed Fahim^1,2,*

CMC-Computers, Materials & Continua, Vol.75, No.2, pp. 3695-3712, 2023, DOI:10.32604/cmc.2023.036820 - 31 March 2023

Abstract Finding clusters based on density represents a significant class of clustering algorithms. These methods can discover clusters of various shapes and sizes. The most studied algorithm in this class is the Density-Based Spatial Clustering of Applications with Noise (DBSCAN). It identifies clusters by grouping the densely connected objects into one group and discarding the noise objects. It requires two input parameters: epsilon (fixed neighborhood radius) and MinPts (the lowest number of objects in epsilon). However, it can’t handle clusters of various densities since it uses a global value for epsilon. This article proposes an adaptation of the… More >

Yutian Hong^1,*, Yuping Yan²

Energy Engineering, Vol.120, No.1, pp. 245-261, 2023, DOI:10.32604/ee.2022.022877 - 27 October 2022

Abstract With the rapid development of the economy, the scale of the power grid is expanding. The number of power equipment that constitutes the power grid has been very large, which makes the state data of power equipment grow explosively. These multi-source heterogeneous data have data differences, which lead to data variation in the process of transmission and preservation, thus forming the bad information of incomplete data. Therefore, the research on data integrity has become an urgent task. This paper is based on the characteristics of random chance and the Spatio-temporal difference of the system. According… More >

Theerapat Sangpetch¹, Tossapon Boongoen^1,*, Natthakan Iam-On²

CMC-Computers, Materials & Continua, Vol.74, No.1, pp. 1641-1655, 2023, DOI:10.32604/cmc.2023.026739 - 22 September 2022

Abstract Attempts to determine characters of astronomical objects have been one of major and vibrant activities in both astronomy and data science fields. Instead of a manual inspection, various automated systems are invented to satisfy the need, including the classification of light curve profiles. A specific Kaggle competition, namely Photometric LSST Astronomical Time-Series Classification Challenge (PLAsTiCC), is launched to gather new ideas of tackling the abovementioned task using the data set collected from the Large Synoptic Survey Telescope (LSST) project. Almost all proposed methods fall into the supervised family with a common aim to categorize each… More >

Ashutosh Kumar Dubey^1,*, Umesh Gupta², Sonal Jain²

CMC-Computers, Materials & Continua, Vol.70, No.3, pp. 4523-4543, 2022, DOI:10.32604/cmc.2022.021148 - 11 October 2021

Abstract This study aims to empirically analyze teaching-learning-based optimization (TLBO) and machine learning algorithms using k-means and fuzzy c-means (FCM) algorithms for their individual performance evaluation in terms of clustering and classification. In the first phase, the clustering (k-means and FCM) algorithms were employed independently and the clustering accuracy was evaluated using different computational measures. During the second phase, the non-clustered data obtained from the first phase were preprocessed with TLBO. TLBO was performed using k-means (TLBO-KM) and FCM (TLBO-FCM) (TLBO-KM/FCM) algorithms. The objective function was determined by considering both minimization and maximization criteria. Non-clustered data… More >

Farzaneh Khorasani¹, Morteza Mohammadi Zanjireh^1,*, Mahdi Bahaghighat¹, Qin Xin²

Computer Systems Science and Engineering, Vol.40, No.3, pp. 1085-1098, 2022, DOI:10.32604/csse.2022.016003 - 24 September 2021

Abstract With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance… More >

Ayat Alrosan¹, Waleed Alomoush², Mohammed Alswaitti^3,*, Khalid Alissa⁴, Shahnorbanun Sahran⁵, Sharif Naser Makhadmeh⁶, Kamal Alieyan⁷

CMC-Computers, Materials & Continua, Vol.68, No.2, pp. 1575-1593, 2021, DOI:10.32604/cmc.2021.015925 - 13 April 2021

Abstract Fuzzy C-means (FCM) is a clustering method that falls under unsupervised machine learning. The main issues plaguing this clustering algorithm are the number of the unknown clusters within a particular dataset and initialization sensitivity of cluster centres. Artificial Bee Colony (ABC) is a type of swarm algorithm that strives to improve the members’ solution quality as an iterative process with the utilization of particular kinds of randomness. However, ABC has some weaknesses, such as balancing exploration and exploitation. To improve the exploration process within the ABC algorithm, the mean artificial bee colony (MeanABC) by its… More >

Marta Mieczyńska^1,*, Ireneusz Czarnowski²

Computer Systems Science and Engineering, Vol.36, No.1, pp. 69-82, 2021, DOI:10.32604/csse.2021.014327 - 23 December 2020

Abstract Automatic Identification System (AIS) data stream analysis is based on the AIS data of different vessel’s behaviours, including the vessels’ routes. When the AIS data consists of outliers, noises, or are incomplete, then the analysis of the vessel’s behaviours is not possible or is limited. When the data consists of outliers, it is not possible to automatically assign the AIS data to a particular vessel. In this paper, a clustering method is proposed to support the AIS data analysis, to qualify noises and outliers with respect to their suitability, and finally to aid the reconstruction… More >

Jingyi Fang¹, Xueguan Song², Nianmin Yao³, Maolin Shi^2,*

CMES-Computer Modeling in Engineering & Sciences, Vol.126, No.1, pp. 397-417, 2021, DOI:10.32604/cmes.2021.012895 - 22 December 2020

Abstract Fuzzy clustering theory is widely used in data mining of full-face tunnel boring machine. However, the traditional fuzzy clustering algorithm based on objective function is difficult to effectively cluster functional data. We propose a new Fuzzy clustering algorithm, namely FCM–ANN algorithm. The algorithm replaces the clustering prototype of the FCM algorithm with the predicted value of the articial neural network. This makes the algorithm not only satisfy the clustering based on the traditional similarity criterion, but also can effectively cluster the functional data. In this paper, we rst use the t-test as an evaluation index… More >