Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    Graph Similarity Learning Based on Learnable Augmentation and Multi-Level Contrastive Learning

    Jian Feng*, Yifan Guo, Cailing Du

    CMC-Computers, Materials & Continua, Vol.82, No.3, pp. 5135-5151, 2025, DOI:10.32604/cmc.2025.059610 - 06 March 2025

    Abstract Graph similarity learning aims to calculate the similarity between pairs of graphs. Existing unsupervised graph similarity learning methods based on contrastive learning encounter challenges related to random graph augmentation strategies, which can harm the semantic and structural information of graphs and overlook the rich structural information present in subgraphs. To address these issues, we propose a graph similarity learning model based on learnable augmentation and multi-level contrastive learning. First, to tackle the problem of random augmentation disrupting the semantics and structure of the graph, we design a learnable augmentation method to selectively choose nodes and… More >

  • Open Access

    ARTICLE

    Federated Learning and Optimization for Few-Shot Image Classification

    Yi Zuo, Zhenping Chen*, Jing Feng, Yunhao Fan

    CMC-Computers, Materials & Continua, Vol.82, No.3, pp. 4649-4667, 2025, DOI:10.32604/cmc.2025.059472 - 06 March 2025

    Abstract Image classification is crucial for various applications, including digital construction, smart manufacturing, and medical imaging. Focusing on the inadequate model generalization and data privacy concerns in few-shot image classification, in this paper, we propose a federated learning approach that incorporates privacy-preserving techniques. First, we utilize contrastive learning to train on local few-shot image data and apply various data augmentation methods to expand the sample size, thereby enhancing the model’s generalization capabilities in few-shot contexts. Second, we introduce local differential privacy techniques and weight pruning methods to safeguard model parameters, perturbing the transmitted parameters to ensure More >

  • Open Access

    ARTICLE

    Pseudo Label Purification with Dual Contrastive Learning for Unsupervised Vehicle Re-Identification

    Jiyang Xu1, Qi Wang1,*, Xin Xiong2, Weidong Min1,3, Jiang Luo4, Di Gai1, Qing Han1,3

    CMC-Computers, Materials & Continua, Vol.82, No.3, pp. 3921-3941, 2025, DOI:10.32604/cmc.2024.058586 - 06 March 2025

    Abstract The unsupervised vehicle re-identification task aims at identifying specific vehicles in surveillance videos without utilizing annotation information. Due to the higher similarity in appearance between vehicles compared to pedestrians, pseudo-labels generated through clustering are ineffective in mitigating the impact of noise, and the feature distance between inter-class and intra-class has not been adequately improved. To address the aforementioned issues, we design a dual contrastive learning method based on knowledge distillation. During each iteration, we utilize a teacher model to randomly partition the entire dataset into two sub-domains based on clustering pseudo-label categories. By conducting contrastive… More >

  • Open Access

    ARTICLE

    Dual-Task Contrastive Meta-Learning for Few-Shot Cross-Domain Emotion Recognition

    Yujiao Tang1, Yadong Wu1,*, Yuanmei He2, Jilin Liu1, Weihan Zhang1

    CMC-Computers, Materials & Continua, Vol.82, No.2, pp. 2331-2352, 2025, DOI:10.32604/cmc.2024.059115 - 17 February 2025

    Abstract Emotion recognition plays a crucial role in various fields and is a key task in natural language processing (NLP). The objective is to identify and interpret emotional expressions in text. However, traditional emotion recognition approaches often struggle in few-shot cross-domain scenarios due to their limited capacity to generalize semantic features across different domains. Additionally, these methods face challenges in accurately capturing complex emotional states, particularly those that are subtle or implicit. To overcome these limitations, we introduce a novel approach called Dual-Task Contrastive Meta-Learning (DTCML). This method combines meta-learning and contrastive learning to improve emotion… More >

  • Open Access

    ARTICLE

    Stochastic Augmented-Based Dual-Teaching for Semi-Supervised Medical Image Segmentation

    Hengyang Liu1, Yang Yuan1,*, Pengcheng Ren1, Chengyun Song1, Fen Luo2

    CMC-Computers, Materials & Continua, Vol.82, No.1, pp. 543-560, 2025, DOI:10.32604/cmc.2024.056478 - 03 January 2025

    Abstract Existing semi-supervised medical image segmentation algorithms use copy-paste data augmentation to correct the labeled-unlabeled data distribution mismatch. However, current copy-paste methods have three limitations: (1) training the model solely with copy-paste mixed pictures from labeled and unlabeled input loses a lot of labeled information; (2) low-quality pseudo-labels can cause confirmation bias in pseudo-supervised learning on unlabeled data; (3) the segmentation performance in low-contrast and local regions is less than optimal. We design a Stochastic Augmentation-Based Dual-Teaching Auxiliary Training Strategy (SADT), which enhances feature diversity and learns high-quality features to overcome these problems. To be more… More >

  • Open Access

    ARTICLE

    Position-Aware and Subgraph Enhanced Dynamic Graph Contrastive Learning on Discrete-Time Dynamic Graph

    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 >

  • Open Access

    ARTICLE

    Efficient Clustering Network Based on Matrix Factorization

    Jieren Cheng1,3, Jimei Li1,3,*, Faqiang Zeng1,3, Zhicong Tao1,3, Yue Yang2,3

    CMC-Computers, Materials & Continua, Vol.80, No.1, pp. 281-298, 2024, DOI:10.32604/cmc.2024.051816 - 18 July 2024

    Abstract Contrastive learning is a significant research direction in the field of deep learning. However, existing data augmentation methods often lead to issues such as semantic drift in generated views while the complexity of model pre-training limits further improvement in the performance of existing methods. To address these challenges, we propose the Efficient Clustering Network based on Matrix Factorization (ECN-MF). Specifically, we design a batched low-rank Singular Value Decomposition (SVD) algorithm for data augmentation to eliminate redundant information and uncover major patterns of variation and key information in the data. Additionally, we design a Mutual Information-Enhanced More >

  • Open Access

    ARTICLE

    A New Framework for Software Vulnerability Detection Based on an Advanced Computing

    Bui Van Cong1, Cho Do Xuan2,*

    CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 3699-3723, 2024, DOI:10.32604/cmc.2024.050019 - 20 June 2024

    Abstract The detection of software vulnerabilities written in C and C++ languages takes a lot of attention and interest today. This paper proposes a new framework called DrCSE to improve software vulnerability detection. It uses an intelligent computation technique based on the combination of two methods: Rebalancing data and representation learning to analyze and evaluate the code property graph (CPG) of the source code for detecting abnormal behavior of software vulnerabilities. To do that, DrCSE performs a combination of 3 main processing techniques: (i) building the source code feature profiles, (ii) rebalancing data, and (iii) contrastive… More >

  • Open Access

    ARTICLE

    Contrastive Consistency and Attentive Complementarity for Deep Multi-View Subspace Clustering

    Jiao Wang, Bin Wu*, Hongying Zhang

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

    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 >

  • Open Access

    ARTICLE

    Recommendation Method for Contrastive Enhancement of Neighborhood Information

    Hairong Wang, Beijing Zhou*, Lisi Zhang, He Ma

    CMC-Computers, Materials & Continua, Vol.78, No.1, pp. 453-472, 2024, DOI:10.32604/cmc.2023.046560 - 30 January 2024

    Abstract Knowledge graph can assist in improving recommendation performance and is widely applied in various personalized recommendation domains. However, existing knowledge-aware recommendation methods face challenges such as weak user-item interaction supervisory signals and noise in the knowledge graph. To tackle these issues, this paper proposes a neighbor information contrast-enhanced recommendation method by adding subtle noise to construct contrast views and employing contrastive learning to strengthen supervisory signals and reduce knowledge noise. Specifically, first, this paper adopts heterogeneous propagation and knowledge-aware attention networks to obtain multi-order neighbor embedding of users and items, mining the high-order neighbor information… More >

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