Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (316)
  • Open Access

    ARTICLE

    C-CORE: Clustering by Code Representation to Prioritize Test Cases in Compiler Testing

    Wei Zhou1, Xincong Jiang2,*, Chuan Qin2

    CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.2, pp. 2069-2093, 2024, DOI:10.32604/cmes.2023.043248

    Abstract Edge devices, due to their limited computational and storage resources, often require the use of compilers for program optimization. Therefore, ensuring the security and reliability of these compilers is of paramount importance in the emerging field of edge AI. One widely used testing method for this purpose is fuzz testing, which detects bugs by inputting random test cases into the target program. However, this process consumes significant time and resources. To improve the efficiency of compiler fuzz testing, it is common practice to utilize test case prioritization techniques. Some researchers use machine learning to predict the code coverage of test… More >

  • Open Access

    ARTICLE

    Flag-Based Vehicular Clustering Scheme for Vehicular Ad-Hoc Networks

    Fady Samann1,*, Shavan Askar2

    CMC-Computers, Materials & Continua, Vol.77, No.3, pp. 2715-2734, 2023, DOI:10.32604/cmc.2023.043580

    Abstract Clustering schemes in vehicular networks organize vehicles into logical groups. They are vital for improving network performance, accessing the medium, and enabling efficient data dissemination. Most schemes rely on periodically broadcast hello messages to provide up-to-date information about the vehicles. However, the periodic exchange of messages overwhelms the system and reduces efficiency. This paper proposes the Flag-based Vehicular Clustering (FVC) scheme. The scheme leverages a combination of Fitness Score (FS), Link Expiration Time (LET), and clustering status flags to enable efficient cluster formation in a hybrid manner. The FVC relies on the periodic broadcast of the basic safety message in… More >

  • Open Access

    ARTICLE

    Optical Fibre Communication Feature Analysis and Small Sample Fault Diagnosis Based on VMD-FE and Fuzzy Clustering

    Xiangqun Li1,*, Jiawen Liang2, Jinyu Zhu2, Shengping Shi2, Fangyu Ding2, Jianpeng Sun2, Bo Liu2

    Energy Engineering, Vol.121, No.1, pp. 203-219, 2024, DOI:10.32604/ee.2023.029295

    Abstract To solve the problems of a few optical fibre line fault samples and the inefficiency of manual communication optical fibre fault diagnosis, this paper proposes a communication optical fibre fault diagnosis model based on variational modal decomposition (VMD), fuzzy entropy (FE) and fuzzy clustering (FC). Firstly, based on the OTDR curve data collected in the field, VMD is used to extract the different modal components (IMF) of the original signal and calculate the fuzzy entropy (FE) values of different components to characterize the subtle differences between them. The fuzzy entropy of each curve is used as the feature vector, which… More >

  • Open Access

    ARTICLE

    Examining the Use of Scott’s Formula and Link Expiration Time Metric for Vehicular Clustering

    Fady Samann1,*, Shavan Askar2

    CMES-Computer Modeling in Engineering & Sciences, Vol.138, No.3, pp. 2421-2444, 2024, DOI:10.32604/cmes.2023.031265

    Abstract Implementing machine learning algorithms in the non-conducive environment of the vehicular network requires some adaptations due to the high computational complexity of these algorithms. K-clustering algorithms are simplistic, with fast performance and relative accuracy. However, their implementation depends on the initial selection of clusters number (K), the initial clusters’ centers, and the clustering metric. This paper investigated using Scott’s histogram formula to estimate the K number and the Link Expiration Time (LET) as a clustering metric. Realistic traffic flows were considered for three maps, namely Highway, Traffic Light junction, and Roundabout junction, to study the effect of road layout on… More >

  • Open Access

    ARTICLE

    Automatic Aggregation Enhanced Affinity Propagation Clustering Based on Mutually Exclusive Exemplar Processing

    Zhihong Ouyang*, Lei Xue, Feng Ding, Yongsheng Duan

    CMC-Computers, Materials & Continua, Vol.77, No.1, pp. 983-1008, 2023, DOI:10.32604/cmc.2023.042222

    Abstract Affinity propagation (AP) is a widely used exemplar-based clustering approach with superior efficiency and clustering quality. Nevertheless, a common issue with AP clustering is the presence of excessive exemplars, which limits its ability to perform effective aggregation. This research aims to enable AP to automatically aggregate to produce fewer and more compact clusters, without changing the similarity matrix or customizing preference parameters, as done in existing enhanced approaches. An automatic aggregation enhanced affinity propagation (AAEAP) clustering algorithm is proposed, which combines a dependable partitioning clustering approach with AP to achieve this purpose. The partitioning clustering approach generates an additional set… More >

  • Open Access

    ARTICLE

    Identification of High-Risk Scenarios for Cascading Failures in New Energy Power Grids Based on Deep Embedding Clustering Algorithms

    Xueting Cheng1, Ziqi Zhang2,*, Yueshuang Bao1, Huiping Zheng1

    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 indicator is established. Based on… More >

  • Open Access

    ARTICLE

    K-Hyperparameter Tuning in High-Dimensional Space Clustering: Solving Smooth Elbow Challenges Using an Ensemble Based Technique of a Self-Adapting Autoencoder and Internal Validation Indexes

    Rufus Gikera1,*, Jonathan Mwaura2, Elizaphan Muuro3, Shadrack Mambo3

    Journal on Artificial Intelligence, Vol.5, pp. 75-112, 2023, DOI:10.32604/jai.2023.043229

    Abstract k-means is a popular clustering algorithm because of its simplicity and scalability to handle large datasets. However, one of its setbacks is the challenge of identifying the correct k-hyperparameter value. Tuning this value correctly is critical for building effective k-means models. The use of the traditional elbow method to help identify this value has a long-standing literature. However, when using this method with certain datasets, smooth curves may appear, making it challenging to identify the k-value due to its unclear nature. On the other hand, various internal validation indexes, which are proposed as a solution to this issue, may be… More >

  • Open Access

    ARTICLE

    Image Steganalysis Based on Deep Content Features Clustering

    Chengyu Mo1,2, Fenlin Liu1,2, Ma Zhu1,2,*, Gengcong Yan3, Baojun Qi1,2, Chunfang Yang1,2

    CMC-Computers, Materials & Continua, Vol.76, No.3, pp. 2921-2936, 2023, DOI:10.32604/cmc.2023.039540

    Abstract The training images with obviously different contents to the detected images will make the steganalysis model perform poorly in deep steganalysis. The existing methods try to reduce this effect by discarding some features related to image contents. Inevitably, this should lose much helpful information and cause low detection accuracy. This paper proposes an image steganalysis method based on deep content features clustering to solve this problem. Firstly, the wavelet transform is used to remove the high-frequency noise of the image, and the deep convolutional neural network is used to extract the content features of the low-frequency information of the image.… More >

  • Open Access

    ARTICLE

    Deep Learning Models Based on Weakly Supervised Learning and Clustering Visualization for Disease Diagnosis

    Jingyao Liu1,2, Qinghe Feng4, Jiashi Zhao2,3, Yu Miao2,3, Wei He2, Weili Shi2,3, Zhengang Jiang2,3,*

    CMC-Computers, Materials & Continua, Vol.76, No.3, pp. 2649-2665, 2023, DOI:10.32604/cmc.2023.038891

    Abstract The coronavirus disease 2019 (COVID-19) has severely disrupted both human life and the health care system. Timely diagnosis and treatment have become increasingly important; however, the distribution and size of lesions vary widely among individuals, making it challenging to accurately diagnose the disease. This study proposed a deep-learning disease diagnosis model based on weakly supervised learning and clustering visualization (W_CVNet) that fused classification with segmentation. First, the data were preprocessed. An optimizable weakly supervised segmentation preprocessing method (O-WSSPM) was used to remove redundant data and solve the category imbalance problem. Second, a deep-learning fusion method was used for feature extraction… More >

  • Open Access

    ARTICLE

    Genetic Algorithm Combined with the K-Means Algorithm: A Hybrid Technique for Unsupervised Feature Selection

    Hachemi Bennaceur, Meznah Almutairy, Norah Alhussain*

    Intelligent Automation & Soft Computing, Vol.37, No.3, pp. 2687-2706, 2023, DOI:10.32604/iasc.2023.038723

    Abstract The dimensionality of data is increasing very rapidly, which creates challenges for most of the current mining and learning algorithms, such as large memory requirements and high computational costs. The literature includes much research on feature selection for supervised learning. However, feature selection for unsupervised learning has only recently been studied. Finding the subset of features in unsupervised learning that enhances the performance is challenging since the clusters are indeterminate. This work proposes a hybrid technique for unsupervised feature selection called GAk-MEANS, which combines the genetic algorithm (GA) approach with the classical k-Means algorithm. In the proposed algorithm, a new… More >

Displaying 1-10 on page 1 of 316. Per Page