Pakorn Santakij¹, Samai Srisuay^2,*, Pongporn Punpeng¹

Computer Systems Science and Engineering, Vol.48, No.3, pp. 665-689, 2024, DOI:10.32604/csse.2024.045066

Abstract Social media has revolutionized the dissemination of real-life information, serving as a robust platform for sharing life events. Twitter, characterized by its brevity and continuous flow of posts, has emerged as a crucial source for public health surveillance, offering valuable insights into public reactions during the COVID-19 pandemic. This study aims to leverage a range of machine learning techniques to extract pivotal themes and facilitate text classification on a dataset of COVID-19 outbreak-related tweets. Diverse topic modeling approaches have been employed to extract pertinent themes and subsequently form a dataset for training text classification models.… 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 >

Jili Chen^1,2, Hailan Wang², Xiaolan Xie^1,2,*

Computer Systems Science and Engineering, Vol.48, No.3, pp. 645-663, 2024, DOI:10.32604/csse.2023.037957

Abstract Fuzzy C-Means (FCM) is an effective and widely used clustering algorithm, but there are still some problems. considering the number of clusters must be determined manually, the local optimal solutions is easily influenced by the random selection of initial cluster centers, and the performance of Euclid distance in complex high-dimensional data is poor. To solve the above problems, the improved FCM clustering algorithm based on density Canopy and Manifold learning (DM-FCM) is proposed. First, a density Canopy algorithm based on improved local density is proposed to automatically deter-mine the number of clusters and initial cluster… 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 >

Ruchun Jia¹, Jianwei Zhang^1,*, Yi Lin¹, Yunxiang Han¹, Feike Yang²

CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 2523-2546, 2024, DOI:10.32604/cmc.2024.047543

Abstract In order to enhance the accuracy of Air Traffic Control (ATC) cybersecurity attack detection, in this paper, a new clustering detection method is designed for air traffic control network security attacks. The feature set for ATC cybersecurity attacks is constructed by setting the feature states, adding recursive features, and determining the feature criticality. The expected information gain and entropy of the feature data are computed to determine the information gain of the feature data and reduce the interference of similar feature data. An autoencoder is introduced into the AI (artificial intelligence) algorithm to encode and… 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 >

Linlin Yuan^1,2, Tiantian Zhang^1,3, Yuling Chen^1,*, Yuxiang Yang¹, Huang Li¹

CMC-Computers, Materials & Continua, Vol.79, No.1, pp. 1561-1579, 2024, DOI:10.32604/cmc.2023.046907

Abstract The development of technologies such as big data and blockchain has brought convenience to life, but at the same time, privacy and security issues are becoming more and more prominent. The K-anonymity algorithm is an effective and low computational complexity privacy-preserving algorithm that can safeguard users’ privacy by anonymizing big data. However, the algorithm currently suffers from the problem of focusing only on improving user privacy while ignoring data availability. In addition, ignoring the impact of quasi-identified attributes on sensitive attributes causes the usability of the processed data on statistical analysis to be reduced. Based… More >

Jiao Wang, Bin Wu^*, Hongying Zhang

CMC-Computers, Materials & Continua, Vol.79, No.1, pp. 143-160, 2024, DOI:10.32604/cmc.2023.046011

Abstract Deep multi-view subspace clustering (DMVSC) based on self-expression has attracted increasing attention due to its outstanding performance and nonlinear application. However, most existing methods neglect that view-private meaningless information or noise may interfere with the learning of self-expression, which may lead to the degeneration of clustering performance. In this paper, we propose a novel framework of Contrastive Consistency and Attentive Complementarity (CCAC) for DMVsSC. CCAC aligns all the self-expressions of multiple views and fuses them based on their discrimination, so that it can effectively explore consistent and complementary information for achieving precise clustering. Specifically, the More >

Haosong Gou¹, Gaoyi Zhang¹, Renê Ripardo Calixto², Senthil Kumar Jagatheesaperumal³, Victor Hugo C. de Albuquerque^2,*

CMES-Computer Modeling in Engineering & Sciences, Vol.140, No.1, pp. 1077-1102, 2024, DOI:10.32604/cmes.2024.047806

Abstract Large-scale wireless sensor networks (WSNs) play a critical role in monitoring dangerous scenarios and responding to medical emergencies. However, the inherent instability and error-prone nature of wireless links present significant challenges, necessitating efficient data collection and reliable transmission services. This paper addresses the limitations of existing data transmission and recovery protocols by proposing a systematic end-to-end design tailored for medical event-driven cluster-based large-scale WSNs. The primary goal is to enhance the reliability of data collection and transmission services, ensuring a comprehensive and practical approach. Our approach focuses on refining the hop-count-based routing scheme to achieve… 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 >