Xin Xiong¹, Jing Zhang¹, Sanli Yi¹, Chunwu Wang², Ruixiang Liu³, Jianfeng He^1,*

CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 4659-4681, 2024, DOI:10.32604/cmc.2024.050528

Abstract The analysis of microstates in EEG signals is a crucial technique for understanding the spatiotemporal dynamics of brain electrical activity. Traditional methods such as Atomic Agglomerative Hierarchical Clustering (AAHC), K-means clustering, Principal Component Analysis (PCA), and Independent Component Analysis (ICA) are limited by a fixed number of microstate maps and insufficient capability in cross-task feature extraction. Tackling these limitations, this study introduces a Global Map Dissimilarity (GMD)-driven density canopy K-means clustering algorithm. This innovative approach autonomously determines the optimal number of EEG microstate topographies and employs Gaussian kernel density estimation alongside the GMD index for… More >

Jian Yu^1,2,*, Gaofeng Yu³, Xiangmei Xiao^1,2, Zhixing Lin^1,2

Journal of Cyber Security, Vol.6, pp. 41-68, 2024, DOI:10.32604/jcs.2024.049658

Abstract With the rapid advancement of the Internet, network attack methods are constantly evolving and adapting. To better identify the network attack behavior, a universal gravitation clustering algorithm was proposed by analyzing the dissimilarities and similarities of the clustering algorithms. First, the algorithm designated the cluster set as vacant, with the introduction of a new object. Subsequently, a new cluster based on the given object was constructed. The dissimilarities between it and each existing cluster were calculated using a defined difference measure. The minimum dissimilarity was selected. Through comparing the proposed algorithm with the traditional Back More >

Leila Safari-Monjeghtapeh¹, Mansour Esmaeilpour^2,*

Computer Systems Science and Engineering, Vol.48, No.3, pp. 705-721, 2024, DOI:10.32604/csse.2024.044892

Abstract Path-based clustering algorithms typically generate clusters by optimizing a benchmark function. Most optimization methods in clustering algorithms often offer solutions close to the general optimal value. This study achieves the global optimum value for the criterion function in a shorter time using the minimax distance, Maximum Spanning Tree “MST”, and meta-heuristic algorithms, including Genetic Algorithm “GA” and Particle Swarm Optimization “PSO”. The Fast Path-based Clustering “FPC” algorithm proposed in this paper can find cluster centers correctly in most datasets and quickly perform clustering operations. The FPC does this operation using MST, the minimax distance, and… More >

Yaming Kang^1,*, Peishun Ye¹, Yuxiu Bai¹, Shi Qiu²

CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 2151-2168, 2024, DOI:10.32604/cmc.2024.049360

Abstract Hyperspectral imagery encompasses spectral and spatial dimensions, reflecting the material properties of objects. Its application proves crucial in search and rescue, concealed target identification, and crop growth analysis. Clustering is an important method of hyperspectral analysis. The vast data volume of hyperspectral imagery, coupled with redundant information, poses significant challenges in swiftly and accurately extracting features for subsequent analysis. The current hyperspectral feature clustering methods, which are mostly studied from space or spectrum, do not have strong interpretability, resulting in poor comprehensibility of the algorithm. So, this research introduces a feature clustering algorithm for hyperspectral… More >

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 More >

Yanmei Shi¹, Wei Yu^2,*, Yanxia Zhao^3,*, Yungang Jia⁴

CMES-Computer Modeling in Engineering & Sciences, Vol.140, No.1, pp. 887-906, 2024, DOI:10.32604/cmes.2024.046140

Abstract Web application fingerprint recognition is an effective security technology designed to identify and classify web applications, thereby enhancing the detection of potential threats and attacks. Traditional fingerprint recognition methods, which rely on preannotated feature matching, face inherent limitations due to the ever-evolving nature and diverse landscape of web applications. In response to these challenges, this work proposes an innovative web application fingerprint recognition method founded on clustering techniques. The method involves extensive data collection from the Tranco List, employing adjusted feature selection built upon Wappalyzer and noise reduction through truncated SVD dimensionality reduction. The core… More >

Yan Wang^*, You Lu, Yuqing Zhou, Zhijian Zhao

CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.3, pp. 2673-2703, 2024, DOI:10.32604/cmes.2023.046743

Abstract Indoor positioning is a key technology in today’s intelligent environments, and it plays a crucial role in many application areas. This paper proposed an unscented Kalman filter (UKF) based on the maximum correntropy criterion (MCC) instead of the minimum mean square error criterion (MMSE). This innovative approach is applied to the loose coupling of the Inertial Navigation System (INS) and Ultra-Wideband (UWB). By introducing the maximum correntropy criterion, the MCCUKF algorithm dynamically adjusts the covariance matrices of the system noise and the measurement noise, thus enhancing its adaptability to diverse environmental localization requirements. Particularly in… More >

Xiao Feng^1,2,3,*, Zheng Yuan¹

CMC-Computers, Materials & Continua, Vol.78, No.2, pp. 1881-1895, 2024, DOI:10.32604/cmc.2023.047243

Abstract First, we propose a cross-domain authentication architecture based on trust evaluation mechanism, including registration, certificate issuance, and cross-domain authentication processes. A direct trust evaluation mechanism based on the time decay factor is proposed, taking into account the influence of historical interaction records. We weight the time attenuation factor to each historical interaction record for updating and got the new historical record data. We refer to the beta distribution to enhance the flexibility and adaptability of the direct trust assessment model to better capture time trends in the historical record. Then we propose an autoencoder-based trust… More >

Xueting Cheng¹, Ziqi Zhang^2,*, Yueshuang Bao¹, Huiping Zheng¹

Energy Engineering, Vol.120, No.11, pp. 2517-2529, 2023, DOI:10.32604/ee.2023.042633

Abstract At present, the proportion of new energy in the power grid is increasing, and the random fluctuations in power output increase the risk of cascading failures in the power grid. In this paper, we propose a method for identifying high-risk scenarios of interlocking faults in new energy power grids based on a deep embedding clustering (DEC) algorithm and apply it in a risk assessment of cascading failures in different operating scenarios for new energy power grids. First, considering the real-time operation status and system structure of new energy power grids, the scenario cascading failure risk More >

Lei Ling¹, Lijun Huang², Jie Wang², Li Zhang², Yue Wu², Yizhang Jiang¹, Kaijian Xia^2,3,*

CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.3, pp. 2353-2379, 2023, DOI:10.32604/cmes.2023.028828

Abstract In recent years, the soft subspace clustering algorithm has shown good results for high-dimensional data, which can assign different weights to each cluster class and use weights to measure the contribution of each dimension in various features. The enhanced soft subspace clustering algorithm combines interclass separation and intraclass tightness information, which has strong results for image segmentation, but the clustering algorithm is vulnerable to noisy data and dependence on the initialized clustering center. However, the clustering algorithm is susceptible to the influence of noisy data and reliance on initialized clustering centers and falls into a… More >