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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

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

Graph neural networks have been demonstrated as a powerful paradigm for effectively learning graph-structured data on the web and mining content from it. Current leading graph models require a large number of labeled samples for training, which unavoidably leads to overfitting in few-shot scenarios. Recent research has sought to alleviate this issue by simultaneously leveraging graph learning and meta-learning paradigms. However, these graph meta-learning models assume the availability of numerous meta-training tasks to learn transferable meta-knowledge. Such assumption may not be feasible in the real world due to the difficulty of constructing tasks and the substantial costs involved. Therefore, we propose a SiMple yet effectIve approach for graph few-shot Learning with fEwer tasks, named SMILE. We introduce a dual-level mixup strategy, encompassing both within-task and across-task mixup, to simultaneously enrich the available nodes and tasks in meta-learning. Moreover, we explicitly leverage the prior information provided by the node degrees in the graph to encode expressive node representations. Theoretically, we demonstrate that SMILE can enhance the model generalization ability. Empirically, SMILE consistently outperforms other competitive models by a large margin across all evaluated datasets with in-domain and cross-domain settings. Our anonymous code can be found here. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

PRG: Prompt-Based Distillation Without Annotation via Proxy Relational Graph

arXiv

引用

arXiv 2024年

作者： Xu, Yijin Liu, Jialun Wei, Hualiang Li, Wenhui The College of Computer Science and Technology The Key Laboratory of Symbolic Computation and Knowledge Engineer Ministry of Education Jilin University Jilin Changchun130012 China Baidu VIS. Beijing100000 China

In this paper, we propose a new distillation method for extracting knowledge from Large Foundation Models (LFM) into lightweight models, introducing a novel supervision mode that does not require manually annotated data. While LFMs exhibit exceptional zero-shot classification abilities across datasets, relying solely on LFM-generated embeddings for distillation poses two main challenges: LFM’s task-irrelevant knowledge and the high density of features. The transfer of task-irrelevant knowledge could compromise the student model’s discriminative capabilities, and the high density of features within target domains obstructs the extraction of discriminative knowledge essential for the task. To address this issue, we introduce the Proxy Relational Graph (PRG) method. We initially extract task-relevant knowledge from LFMs by calculating a weighted average of logits obtained through text prompt embeddings. Then we construct sample-class proxy graphs for LFM and student models, respectively, to model the correlation between samples and class proxies. Then, we achieve the distillation of selective knowledge by aligning the relational graphs produced by both the LFM and the student model. Specifically, the distillation from LFM to the student model is achieved through two types of alignment: 1) aligning the sample nodes produced by the student model with those produced by the LFM, and 2) aligning the edge relationships in the student model’s graph with those in the LFM’s graph. Our experimental results validate the effectiveness of PRG, demonstrating its ability to leverage the extensive knowledge base of LFMs while skillfully circumventing their inherent limitations in focused learning scenarios. Notably, in our annotation-free framework, PRG achieves an accuracy of 76.23% (T: 77.9%) on CIFAR-100 and 72.44% (T: 75.3%) on the ImageNet-1K. Copyright © 2024, The Authors. All rights reserved.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Positive and unlabeled learning with controlled probability boundary fence 24

Positive and unlabeled learning with controlled probability ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Changchun Li Yuanchao Dai Lei Feng Ximing Li Bing Wang Jihong Ouyang College of Computer Science and Technology and Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore

Positive and Unlabeled (PU) learning refers to a special case of binary classification, and technically, it aims to induce a binary classifier from a few labeled positive training instances and loads of unlabeled instances. In this paper, we derive a theorem indicating that the probability boundary of the asymmetric disambiguation-free expected risk of PU learning is controlled by its asymmetric penalty, and we further empirically evaluated this theorem. Inspired by the theorem and its empirical evaluations, we propose an easy-to-implement two-stage PU learning method, namely Positive and Unlabeled Learning with Controlled Probability Boundary Fence (PUL-CPBF). In the first stage, we train a set of weak binary classifiers concerning different probability boundaries by minimizing the asymmetric disambiguation-free empirical risks with specific asymmetric penalty values. We can interpret these induced weak binary classifiers as a probability boundary fence. For each unlabeled instance, we can use the predictions to locate its class posterior probability and generate a stochastic label. In the second stage, we train a strong binary classifier over labeled positive training instances and all unlabeled instances with stochastic labels in a self-training manner. Extensive empirical results demonstrate that PUL-CPBF can achieve competitive performance compared with the existing PU learning baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

computational Methods for Inferring and Reconstructing Gene Regulatory Networks

Computational Methods for Inferring and Reconstructing Gene ...

引用

作者： Xianglu Zhou Haiyang Jia College of Computer Science and Technology Jilin University College of Software Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of EducationJilin University

Gene regulatory network(GRN) describes dynamic and complex gene interactions that determine the functions of ***,understanding of GRNs has played a great role in cancer treatment,drug design,and gene ***,the GRN study suffers from a lack of experiment measurement data and the complexity of the *** approaches have evolved in recent years to promote the study of *** this review,we summarized popular computational approaches for GRN *** started with traditional bioinformatic methods,such as Bayesian networks and mutual information ***,we introduced how today's hot technology in the computer field-machine learning benefited GRN ***-based approaches and other machine-learning methods are elaborated on in this *** discussed not only the advantages and progression brought by various methods but also the drawbacks and limitations,such as the accuracy and robustness of GRN *** expect to inspire readers for improved GRN study approaches via our introduction to this field.

关键词： Gene Regulatory Network Bioinformatics Machine Learning

来源：评论

学校读者我要写书评

暂无评论

A Sparse Optical Flow Method for Camera Tracking under Fisheye Camera Models

A Sparse Optical Flow Method for Camera Tracking under Fishe...

引用

Frontiers Technology of Information and Computer (ICFTIC), IEEE International Conference on

作者： Zuoming Zhang Xin Wang College of Computer Science and Technology Jilin China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin China

In computer image processing, optical flow is a classic task used to track the motion of pixels. In the field of robotics, methods like SLAM extensively employ sparse optical flow as a substitute for time-consuming feature point matching methods, enabling rapid and stable camera tracking. However, the widespread use of fisheye cameras introduces distortion issues in practical applications. Traditional sparse optical flow struggles to accurately track pixel positions in such scenarios, affecting the precision of camera pose tracking. Therefore, we introduce a sparse optical flow method designed for fisheye camera models, which correctly utilizes prior information obtained during camera tracking to enhance the accuracy of sparse optical flow. Finally, we propose a scheme for constructing a semi-distortion lookup table to accelerate distortion operations and reduce memory requirements. We conducted extensive testing on simulated datasets with various camera motion scenarios, and the experimental results demonstrate that our method outperforms OpenCV in terms of accuracy and versatility.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Crossed-Time Delay Neural Network for Speaker Recognition 1

引用

27th International Conference on MultiMedia Modeling, MMM 2021

作者： Chen, Liang Liang, Yanchun Shi, Xiaoshu Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education School of Computer Zhuhai College of Jilin University Zhuhai519041 China

ISBN: (数字)9783030678326

ISBN: (纸本)9783030678319

Time Delay Neural Network (TDNN) is a well-performing structure for deep neural network-based speaker recognition systems. In this paper we introduce a novel structure, named Crossed-Time Delay Neural Network (CTDNN) to enhance the performance of current TDNN for speaker recognition. Inspired by the multi-filters setting of convolution layers from convolution neural networks, we set multiple time delay units with different context size at the bottom layer and construct a multilayer parallel network. The proposed CTDNN gives significant improvements over original TDNN on both speaker verification and identification tasks. It outperforms in VoxCeleb1 dataset in verification experiment with a 2.6% absolute Equal Error Rate improvement. In few shots condition, CTDNN reaches 90.4% identification accuracy, which doubles the identification accuracy of original TDNN. We also compare the proposed CTDNN with another new variant of TDNN, Factorized-TDNN, which shows that our model has a 36% absolute identification accuracy improvement under few shots condition. Moreover, the proposed CTDNN can handle training with a larger batch more efficiently and hence, utilize calculation resources economically. © 2021, Springer Nature Switzerland AG.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

ON A COUPLED-PHYSICS TRANSMISSION EIGENVALUE PROBLEM AND ITS SPECTRAL PROPERTIES WITH APPLICATIONS

arXiv

引用

arXiv 2024年

作者： Diao, Huaian Liu, Hongyu Meng, Qingle Wang, Li School of Mathematics Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China Department of Mathematics City University of Hong Kong Kowloon Hong Kong

In this paper, we investigate a transmission eigenvalue problem that couples the principles of acoustics and elasticity. This problem naturally arises when studying fluid-solid interactions and constructing bubbly-elastic structures to create metamaterials. We uncover intriguing local geometric structures of the transmission eigenfunctions near the corners of the domains, under typical regularity conditions. As applications, we present novel unique identifiability and visibility results for an inverse problem associated with an acoustoelastic system, which hold practical significance. © 2024, CC BY.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：