检索结果-内蒙古大学图书馆

Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liu, Yonghao Giunchiglia, Fausto Li, Ximing Huang, Lan Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education China

Graph few-shot learning has garnered significant attention for its ability to rapidly adapt to downstream tasks with limited labeled data, sparking considerable interest among researchers. Recent advancements in graph few-shot learning models have exhibited superior performance across diverse applications. Despite their successes, several limitations still exist. First, existing models in the meta-training phase predominantly focus on instance-level features within tasks, neglecting crucial set-level features essential for distinguishing between different categories. Second, these models often utilize query sets directly on classifiers trained with support sets containing only a few labeled examples, overlooking potential distribution shifts between these sets and leading to suboptimal performance. Finally, previous models typically require necessitate abundant labeled data from base classes to extract transferable knowledge, which is typically infeasible in real-world scenarios. To address these issues, we propose a novel model named STAR, which leverages Set funcTions and optimAl tRansport for enhancing unsupervised graph few-shot learning. Specifically, STAR utilizes expressive set functions to obtain set-level features in an unsupervised manner and employs optimal transport principles to align the distributions of support and query sets, thereby mitigating distribution shift effects. Theoretical analysis demonstrates that STAR can capture more task-relevant information and enhance generalization capabilities. Empirically, extensive experiments across multiple datasets validate the effectiveness of STAR. Our code can be found here. Copyright © 2025, The Authors. All rights reserved.

关键词： Zero-shot learning

AHMSA-Net: Adaptive Hierarchical Multi-Scale Attention Network for Micro-Expression Recognition

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Lijun Zhang, Yifan Tang, Weicheng Sun, Xinzhi Wang, Xiaomeng Li, Zhanshan College of Computer Science and Technology Jilin University Changchun Jilin130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin130012 China

Micro-expression recognition (MER) presents a significant challenge due to the transient and subtle nature of the motion changes involved. In recent years, deep learning methods based on attention mechanisms have made some breakthroughs in MER. However, these methods still suffer from the limitations of insufficient feature capture and poor dynamic adaptation when coping with the instantaneous subtle movement changes of micro-expressions. Therefore, in this paper, we design an Adaptive Hierarchical Multi-Scale Attention Network (AHMSA-Net) for MER. Specifically, we first utilize the onset and apex frames of the micro-expression sequence to extract threedimensional (3D) optical flow maps, including horizontal optical flow, vertical optical flow, and optical flow strain. Subsequently, the optical flow feature maps are inputted into AHMSA-Net, which consists of two parts: an adaptive hierarchical framework and a multi-scale attention mechanism. Based on the adaptive downsampling hierarchical attention framework, AHMSA-Net captures the subtle changes of micro-expressions from different granularities (fine and coarse) by dynamically adjusting the size of the optical flow feature map at each layer. Based on the multi-scale attention mechanism, AHMSA-Net learns micro-expression action information by fusing features from different scales (channel and spatial). These two modules work together to comprehensively improve the accuracy of MER. Additionally, rigorous experiments demonstrate that the proposed method achieves competitive results on major micro-expression databases, with AHMSA-Net achieving recognition accuracy of up to 78.21% on composite databases (SMIC, SAMM, CASMEII) and 77.08% on the CASME3 database. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep learning

Dual-level Mixup for Graph Few-shot Learning with Fewer Tasks

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liu, Yonghao Li, Mengyu Giunchiglia, Fausto Huang, Lan Li, Ximing Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education China

关键词： Contrastive Learning

Information Entropy Invariance: Enhancing Length Extrapolation in Attention Mechanisms

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Kewei Kong, Yanwen Xu, Yiping Su, Jianlin Huang, Lan Zhang, Ruochi Zhou, Fengfeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China Moonshot AI Ltd. Beijing100086 China

Since the emergence of research on improving the length extrapolation capabilities of large models in 2021, some studies have made modifications to the scaling factor in the scaled dot-product attention mechanism as part of their proposed methods without rigorous theoretical justifications. To fill this gap, we propose two new scaled temperatures based on entropy invariance to enhance length extrapolation. First, a training-free method InfoScale is designed for dot-product attention, and preserves focus on original tokens during length extrapolation by ensuring consistent entropy. Second, we theoretically analyze the impact of scaling (CosScale) on cosine attention. Experimental data demonstrates that combining InfoScale and CosScale achieves state-of-the-art performance on the GAU-α model with a context window extended to 64 times the training length, and outperforms seven existing methods. Our analysis reveals that significantly increasing CosScale approximates the Windowed Attention, and highlights the significance of attention score dilution as a key challenge in long-range context handling. The code and data are available at https://***/HT-NEKO/InfoScale. © 2025, CC BY-NC-ND.

关键词： Data handling

Dual-Network Cross-Learning for Metabolite-Disease Association Prediction

学校读者我要写书评

暂无评论

IEEE Transactions on Computational Biology and Bioinformatic...

IEEE Transactions on computational Biology and Bioinformatics 2025年第2期22卷 545-556页

作者： Yanxin Chen Qiao Ning Yitong Zhang Hui Li Shikai Guo Department of Information Science and Technology Dalian Maritime University Dalian China School of Artificial Intelligence and Computer Science Jiangnan University Wuxi China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Dalian Key Laboratory of Artificial Intelligence Dalian China

In recent years, increasing evidence has demonstrated a close association between metabolites and various complex human diseases, providing valuable insights for disease diagnosis, treatment, and prevention. Although deep learning-based approaches have achieved certain success in predicting metabolic disease associations, challenges remain in enriching graph information and effectively integrating metabolic and disease features. To address these issues, this paper proposes a model named DCMDA, which extracts deep features of both metabolites and diseases using Dual-network Cross-learning for Metabolite- Disease Association prediction. DCMDA consists of three parts. The data processing module integrates similarity networks with association networks to construct a heterogeneous network. The feature extraction module extracts features from the metabolite-disease association network based on the non-negative matrix factorization method and from the heterogeneous network using graph autoencoder techniques. The feature fusion module combines the association matrix feature with the heterogeneous network feature through a Cross-Attention mechanism, thereby obtaining deep representations of metabolites and diseases. These features are then used to train the model to predict association scores between metabolites and diseases. Experimental results demonstrate that in 5-fold cross-validation, DCMDA achieves an area under the receiver operating characteristic curve (AUC) of 97.8% and an area under the precision-recall curve (AUPR) of 97.9%, outperforming state-of-the-art prediction methods.

关键词： Diseases Feature extraction Data mining Semantics Deep learning Kernel Information entropy Prediction algorithms Noise Nearest neighbor methods

Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liu, Yonghao Li, Mengyu Pang, Wei Giunchiglia, Fausto Huang, Lan Feng, Xiaoyue Guan, Renchu Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin University China Mathematical and Computer Sciences Heriot-Watt University United Kingdom University of Trento Italy

Short text classification, as a research subtopic in natural language processing, is more challenging due to its semantic sparsity and insufficient labeled samples in practical scenarios. We propose a novel model named MI-DELIGHT for short text classification in this work. Specifically, it first performs multi-source information (i.e., statistical information, linguistic information, and factual information) exploration to alleviate the sparsity issues. Then, the graph learning approach is adopted to learn the representation of short texts, which are presented in graph forms. Moreover, we introduce a dual-level (i.e., instance-level and cluster-level) contrastive learning auxiliary task to effectively capture different-grained contrastive information within massive unlabeled data. Meanwhile, previous models merely perform the main task and auxiliary tasks in parallel, without considering the relationship among tasks. Therefore, we introduce a hierarchical architecture to explicitly model the correlations between tasks. We conduct extensive experiments across various benchmark datasets, demonstrating that MI-DELIGHT significantly surpasses previous competitive models. It even outperforms popular large language models on several datasets. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

VECLLF: A vehicle-edge collaborative lifelong learning framework for anomaly detection in VANETs

学校读者我要写书评

暂无评论

Computer Networks 2025年 265卷

作者： Wang, Yingqing Liang, Yanhua Huang, Yue Qin, Guihe Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Jilin University Center for Computer Fundamental Education Changchun130012 China

With the rapid development of intelligent connected vehicles, Vehicular Ad Hoc Network (VANET) is widely used in intelligent transportation systems. VANETs are vulnerable to attacks in their operating environments, such as denial of service (DoS) attacks and injection attacks. Thus, the development of an efficient anomaly detection framework is a promising solution. Most existing methods can only detect known attacks, are less efficient in detecting unknown attacks, and fail to deal with them. To solve these problems, the lifelong learning framework (LLF) is introduced, which aims to store and label suspicious data by applying blockchain and then retrain the model. However, existing LLFs are overly idealized as they do not adequately consider the key issues of label budget and storage space. To improve the practicality of existing methods, this paper proposes a novel LLF based on the existing LLF, called Vehicle Edge Collaborative Lifelong Learning Framework (VECLLF), which can deploy the model update task on the edge server. Specifically, the proposed anomaly detection module based on ensemble active learning is used to achieve high-performance detection under a limited label budget, the proposed incremental learning module based on a sample library continuously learns the model by replaying representative samples within limited storage space, the proposed optimization-based feature selection module is used to remove redundant and interfering features, and the explainable artificial intelligence (XAI) module is used to explain the model to ensure its interpretability. In addition, the blockchain-based database (BC-DB) module is used to help store suspicious data and interact with security agencies to label it. We conducted experiments on two public datasets, AWID2 and CICIDS2017, and the results show that VECLLF outperforms state-of-the-art anomaly detection models and existing LLF, with F1-scores exceeding 97% on both datasets. Furthermore, we collect data from th

关键词： Rapid transit

UAV-Assisted Joint Mobile Edge Computing and Data Collection via Matching-Enabled Deep Reinforcement Learning

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Wang, Boxiong Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

Unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) and data collection (DC) have been popular research issues. Different from existing works that consider MEC and DC scenarios separately, this paper investigates a multi-UAV-assisted joint MEC-DC system. Specifically, we formulate a joint optimization problem to minimize the MEC latency and maximize the collected data volume. This problem can be classified as a non-convex mixed integer programming problem that exhibits long-term optimization and dynamics. Thus, we propose a deep reinforcement learning-based approach that jointly optimizes the UAV movement, user transmit power, and user association in real time to solve the problem efficiently. Specifically, we reformulate the optimization problem into an action space-reduced Markov decision process (MDP) and optimize the user association by using a two-phase matching-based association (TMA) strategy. Subsequently, we propose a soft actor-critic (SAC)-based approach that integrates the proposed TMA strategy (SAC-TMA) to solve the formulated joint optimization problem collaboratively. Simulation results demonstrate that the proposed SAC-TMA is able to coordinate the two subsystems and can effectively reduce the system latency and improve the data collection volume compared with other benchmark algorithms. © 2025 IEEE. All rights reserved,

关键词： Unmanned aerial vehicles (UAV)

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO-LSTM method effectively mitigates hot spot problems and offers superior performance compared to traditional strategies. © 2014 IEEE.

关键词： Deep reinforcement learning