Zhen-Yu Chen¹, Feng-Chi Liu², Xin Wang³, Cheng-Hsiung Lee¹, Ching-Sheng Lin^1,*

CMC-Computers, Materials & Continua, Vol.82, No.3, pp. 4287-4300, 2025, DOI:10.32604/cmc.2025.061661 - 06 March 2025

Abstract In the domain of knowledge graph embedding, conventional approaches typically transform entities and relations into continuous vector spaces. However, parameter efficiency becomes increasingly crucial when dealing with large-scale knowledge graphs that contain vast numbers of entities and relations. In particular, resource-intensive embeddings often lead to increased computational costs, and may limit scalability and adaptability in practical environments, such as in low-resource settings or real-world applications. This paper explores an approach to knowledge graph representation learning that leverages small, reserved entities and relation sets for parameter-efficient embedding. We introduce a hierarchical attention network designed to refine More >

Mei Chen, Yunsheng Xu, Nan Wu, Ying Pan^*

CMC-Computers, Materials & Continua, Vol.82, No.3, pp. 5307-5324, 2025, DOI:10.32604/cmc.2024.060993 - 06 March 2025

Abstract With the development of the Semantic Web, the number of ontologies grows exponentially and the semantic relationships between ontologies become more and more complex, understanding the true semantics of specific terms or concepts in an ontology is crucial for the matching task. At present, the main challenges facing ontology matching tasks based on representation learning methods are how to improve the embedding quality of ontology knowledge and how to integrate multiple features of ontology efficiently. Therefore, we propose an Ontology Matching Method Based on the Gated Graph Attention Model (OM-GGAT). Firstly, the semantic knowledge related… More >

Naikang Zhong¹, Xiao Lin^1,2,3,4,*, Wen Du⁵, Jin Shi⁶

CMC-Computers, Materials & Continua, Vol.82, No.3, pp. 5285-5306, 2025, DOI:10.32604/cmc.2025.059102 - 06 March 2025

Abstract Multi-label image classification is a challenging task due to the diverse sizes and complex backgrounds of objects in images. Obtaining class-specific precise representations at different scales is a key aspect of feature representation. However, existing methods often rely on the single-scale deep feature, neglecting shallow and deeper layer features, which poses challenges when predicting objects of varying scales within the same image. Although some studies have explored multi-scale features, they rarely address the flow of information between scales or efficiently obtain class-specific precise representations for features at different scales. To address these issues, we propose… More >

Ming Liu, Qichao Yang, Wenqing Wang, Shengli Liu^*

CMC-Computers, Materials & Continua, Vol.82, No.2, pp. 2985-3004, 2025, DOI:10.32604/cmc.2024.059417 - 17 February 2025

Abstract The proliferation of internet traffic encryption has become a double-edged sword. While it significantly enhances user privacy, it also inadvertently shields cyber-attacks from detection, presenting a formidable challenge to cybersecurity. Traditional machine learning and deep learning techniques often fall short in identifying encrypted malicious traffic due to their inability to fully extract and utilize the implicit relational and positional information embedded within data packets. This limitation has led to an unresolved challenge in the cybersecurity community: how to effectively extract valuable insights from the complex patterns of traffic packet transmission. Consequently, this paper introduces the… More >

Jian Feng^*, Tian Liu, Cailing Du

CMC-Computers, Materials & Continua, Vol.81, No.2, pp. 2895-2909, 2024, DOI:10.32604/cmc.2024.056434 - 18 November 2024

Abstract Unsupervised learning methods such as graph contrastive learning have been used for dynamic graph representation learning to eliminate the dependence of labels. However, existing studies neglect positional information when learning discrete snapshots, resulting in insufficient network topology learning. At the same time, due to the lack of appropriate data augmentation methods, it is difficult to capture the evolving patterns of the network effectively. To address the above problems, a position-aware and subgraph enhanced dynamic graph contrastive learning method is proposed for discrete-time dynamic graphs. Firstly, the global snapshot is built based on the historical snapshots… More >

Gang Long, Zhaoxin Zhang^*

CMC-Computers, Materials & Continua, Vol.81, No.1, pp. 327-343, 2024, DOI:10.32604/cmc.2024.054558 - 15 October 2024

Abstract Network anomaly detection plays a vital role in safeguarding network security. However, the existing network anomaly detection task is typically based on the one-class zero-positive scenario. This approach is susceptible to overfitting during the training process due to discrepancies in data distribution between the training set and the test set. This phenomenon is known as prediction drift. Additionally, the rarity of anomaly data, often masked by normal data, further complicates network anomaly detection. To address these challenges, we propose the PUNet network, which ingeniously combines the strengths of traditional machine learning and deep learning techniques… More >

Chunjuan Bo^1,*, Xin Chen², Junxing Zhang¹

CMC-Computers, Materials & Continua, Vol.80, No.1, pp. 1105-1122, 2024, DOI:10.32604/cmc.2024.052329 - 18 July 2024

Abstract Significant advancements have been witnessed in visual tracking applications leveraging ViT in recent years, mainly due to the formidable modeling capabilities of Vision Transformer (ViT). However, the strong performance of such trackers heavily relies on ViT models pretrained for long periods, limiting more flexible model designs for tracking tasks. To address this issue, we propose an efficient unsupervised ViT pretraining method for the tracking task based on masked autoencoders, called TrackMAE. During pretraining, we employ two shared-parameter ViTs, serving as the appearance encoder and motion encoder, respectively. The appearance encoder encodes randomly masked image data,… More >

Zhihui Song, Jinchen Xu, Kewei Li, Zheng Shan^*

CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 4573-4601, 2024, DOI:10.32604/cmc.2024.049310 - 20 June 2024

Abstract Prior studies have demonstrated that deep learning-based approaches can enhance the performance of source code vulnerability detection by training neural networks to learn vulnerability patterns in code representations. However, due to limitations in code representation and neural network design, the validity and practicality of the model still need to be improved. Additionally, due to differences in programming languages, most methods lack cross-language detection generality. To address these issues, in this paper, we analyze the shortcomings of previous code representations and neural networks. We propose a novel hierarchical code representation that combines Concrete Syntax Trees (CST)… More >

Yingchao Li^1,*, Jianbin Wang¹, Haibin Wang²

Energy Engineering, Vol.121, No.4, pp. 1049-1065, 2024, DOI:10.32604/ee.2023.045228 - 26 March 2024

Abstract With the increasing demand for electrical services, wind farm layout optimization has been one of the biggest challenges that we have to deal with. Despite the promising performance of the heuristic algorithm on the route network design problem, the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored. In this paper, the wind farm layout optimization problem is defined. Then, a multi-objective algorithm based on Graph Neural Network (GNN) and Variable Neighborhood Search (VNS) algorithm is proposed. GNN provides the basis representations for the following search algorithm so that the expressiveness… More >

Lanze Zhang, Yijun Gu^*, Jingjie Peng

CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.2, pp. 1701-1731, 2024, DOI:10.32604/cmes.2023.045129 - 29 January 2024

Abstract Graph Neural Networks (GNNs) play a significant role in tasks related to homophilic graphs. Traditional GNNs, based on the assumption of homophily, employ low-pass filters for neighboring nodes to achieve information aggregation and embedding. However, in heterophilic graphs, nodes from different categories often establish connections, while nodes of the same category are located further apart in the graph topology. This characteristic poses challenges to traditional GNNs, leading to issues of “distant node modeling deficiency” and “failure of the homophily assumption”. In response, this paper introduces the Spatial-Frequency domain Adaptive Heterophilic Graph Neural Networks (SFA-HGNN), which… More >