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

2022 Chinese Automation Congress, CAC 2022

作者： Shizhao, Wang Shaoguang, Shu Xueshi, Liu Beijing Institute of Control Engineering System Software Engineering Laboratory Beijing China

ISBN: (纸本)9781665465335

The classification of imbalanced and overlapping data is more difficult. When the number of categories is uneven and category areas are overlap, general neural network classifiers can only extract limited features from the data, which makes the model relies too much on existing samples, resulting in a low classification accuracy. Aiming at the above classification problem, this paper proposes a batch-subsample prototype network model. Based on the prototype network, the model achieves the separation of different categories in classification. In the training process, selecting each batch of training data by subsample method, so that the data for training is balanced each time, which effectively reduce the impact of category imbalance and overlapping on model training. This model is tested in the dataset NSL-KDD with the characteristics of imbalance and overlapping. The experimental results show that the classification accuracy of the batch-subsample prototype network (BSPN) model has been effectively improved, and the classification ability of minority categories also be better. To a certain extent, the model solves the problem that the neural network model has poor classification effect on imbalanced and overlapping data. Above all, the batch-subsample prototype network model can improve the classification accuracy in imbalanced and overlapping data, optimize the recognition rate of minority categories, and increase the classification robustness of the model, which is of great significance for imbalanced and overlapping data classification. © 2022 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Learning with Open-world Noisy Data via Class-independent Margin in Dual Representation Space 39

Learning with Open-world Noisy Data via Class-independent Ma...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Pan, Linchao Gao, Can Zhou, Jie Wang, Jinbao College of Computer Science and Software Engineering Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China

ISBN: (纸本)157735897X

Learning with Noisy Labels (LNL) aims to improve the model generalization when facing data with noisy labels, and existing methods generally assume that noisy labels come from known classes, called closed-set noise. However, in real-world scenarios, noisy labels from similar unknown classes, i.e., open-set noise, may occur during the training and inference stage. Such open-world noisy labels may significantly impact the performance of LNL methods. In this study, we propose a novel dual-space joint learning method to robustly handle the open-world noise. To mitigate model overfitting on closed-set and open-set noises, a dual representation space is constructed by two networks. One is a projection network that learns shared representations in the prototype space, while the other is a One-Vs-All (OVA) network that makes predictions using unique semantic representations in the class-independent space. Then, bi-level contrastive learning and consistency regularization are introduced in two spaces to enhance the detection capability for data with unknown classes. To benefit from the memorization effects across different types of samples, class-independent margin criteria are designed for sample identification, which selects clean samples, weights closed-set noise, and filters open-set noise effectively. Extensive experiments demonstrate that our method outperforms the state-of-the-art methods and achieves an average accuracy improvement of 4.55% and an AUROC improvement of 6.17% on CIFAR80N. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

PAIR: Protein-aptamer interaction prediction based on language models and contrastive learning framework

PAIR: Protein-aptamer interaction prediction based on langua...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Zhang, Jun Yan, Zhiqiang Zeng, Hao Zhu, Zexuan Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Shenzhen University College of Computer Science and Software Engineering Shenzhen China

ISBN: (纸本)9798350386226

Aptamers are single-stranded DNA or RNA oligonucleotides that selectively bind to specific targets, making them valuable for drug design and diagnostic applications. Identifying the interactions between aptamers and target proteins is crucial for these applications. The systematic evolution of ligands by exponential enrichment process, traditionally used for this purpose, is challenging and time-consuming. The resulting aptamers often suffer from limitations in stability and diversity. Computational approaches have shown promise in aiding the discovery of high-performance aptamers, but existing methods are usually constrained by insufficient training data and limited generalizability. Recently, advancements in pre-training large language models have offered a new avenue to mitigate the dependency on large datasets. In this study, we propose a novel method to predict aptamer-protein interactions using large language models within a contrastive learning framework. Experimental results demonstrate that our method exhibits superior generalization and outperforms existing approaches. This method holds promise as a powerful tool for predicting aptamer-protein interactions. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Towards optimized tensor code generation for deep learning on sunway many-core processor

引用

Frontiers of Computer Science 2024年第2期18卷 1-15页

作者： Mingzhen LI Changxi LIU Jianjin LIAO Xuegui ZHENG Hailong YANG Rujun SUN Jun XU Lin GAN Guangwen YANG Zhongzhi LUAN Depei QIAN State Key Laboratory of Software Development Environment Beijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China National University of Singapore Singapore 119077Singapore State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214000China Science and Technology on Special System Simulation Laboratory Beijing Simulation Center Beijing 100854China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China

The flourish of deep learning frameworks and hardware platforms has been demanding an efficient compiler that can shield the diversity in both software and hardware in order to provide application *** the existing deep learning compilers,TVM is well known for its efficiency in code generation and optimization across diverse hardware *** the meanwhile,the Sunway many-core processor renders itself as a competitive candidate for its attractive computational power in both scientific computing and deep learning *** paper combines the trends in these two ***,we propose swTVM that extends the original TVM to support ahead-of-time compilation for architecture requiring cross-compilation such as *** addition,we leverage the architecture features during the compilation such as core group for massive parallelism,DMA for high bandwidth memory transfer and local device memory for data locality,in order to generate efficient codes for deep learning workloads on *** experiment results show that the codes generated by swTVM achieve 1.79x improvement of inference latency on average compared to the state-of-the-art deep learning framework on Sunway,across eight representative *** work is the first attempt from the compiler perspective to bridge the gap of deep learning and Sunway processor particularly with productivity and efficiency in *** believe this work will encourage more people to embrace the power of deep learning and Sunwaymany-coreprocessor.

关键词： sunway processor deep learning compiler code generation performance optimization

来源：评论

学校读者我要写书评

暂无评论

Active Deduction Heuristic Algorithm of Standard Contradiction Separation Rule Based on Reinforcement Learning 18

Active Deduction Heuristic Algorithm of Standard Contradicti...

引用

18th International Conference on Intelligent systems and Knowledge engineering, ISKE 2023

作者： Zhong, Jian Liu, Peiyao Chen, Shuwei School of Computer and Software Engineering National-Local Joint Engineering Laboratory of System Credibility Automatic Verification Xihua University Chengdu China

ISBN: (纸本)9798350318401

Machine learning has been a prominent research focus in recent years, and integrating machine learning methods into automated theorem provers has become a current trend in theorem proving research. Standard contradiction separation rule is a newly proposed multi-clause, dynamic, and synergized deductive inference rule. The key aspect of standard contradiction separation rule is how to plan deduction paths. In order to better plan the deduction path, this paper explores the dynamic learning within the process of contradiction separation deduction and introduces a novel active deductive heuristic algorithm based on reinforcement learning. Experimental results demonstrate that this new algorithm enhances the reasoning capability of the theorem prover Prover9. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of Computer Science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

A novel policy iteration algorithm for solving the optimal consensus control problem of a discrete-time multiagent system with unknown dynamics

引用

Science China(Information Sciences) 2023年第8期66卷 269-270页

作者： Wenkai XU Li WANG Shiwen SUN Chengyi XIA Zengqiang CHEN Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology The Engineering Research Center of Learning-Based Intelligent System Ministry of Education College of Artificial Intelligence Nankai University

At present, an increasing number of researchers have noticed the importance of optimal consensus control(OCC) of multiagent systems(MASs) because of their rich practical applications in various areas [1–4]. To accomp...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Stage Transfer Learning Evolutionary Algorithm for Dynamic Multiobjective Optimization 13

Multi-Stage Transfer Learning Evolutionary Algorithm for Dyn...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Wang, Qianhui Zhu, Qingling Ji, Junkai College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

ISBN: (纸本)9798350308365

Recently, the application of transfer learning within dynamic multiobjective evolutionary algorithms (DMOEAs) has shown significant potential to solve dynamic multiobjective optimization problems (DMOPs). This approach utilizes the transfer learning technique which reuses information from previous environments to accelerate the search process in the new environment. However, the risk of negative transfer can lead to an erroneous search direction and inefficient use of computational resources. To address this issue, this paper proposes a novel multistage transfer learning DMOEA, named MSTL. The algorithm is designed to enhance the convergence and diversity of the population through the combination of the pre-transfer learning stage and the transfer learning and validation stage when environmental changes occur. In the pre-transfer learning stage, a suitable target domain, source domain, and validation classifier sample sets are generated guided by historical information. In the transfer learning and validation stage, the TrAdaboost technique to transfer knowledge from the target to the source domain, with the results verified by two validation classifiers to mitigate negative transfer. Experimental results demonstrate that our proposed algorithm outperforms four competing algorithms in terms of diversity and convergence on a widely recognized benchmark suite. © 2024 IEEE.

关键词： Dynamic multiobjective optimization evolutionary algorithm transfer learning

来源：评论

学校读者我要写书评

暂无评论

UAV-Mounted Intelligent Reflecting Surface in Maritime Wireless Powered Communication Network

引用

China Communications 2025年第3期22卷 254-269页

作者： Liu Yuan Han Fengxia Zhao Shengjie School of Information Science and Electrical Engineering Shandong Jiaotong UniversityJinan 250357China College of Electronic and Information Engineering Tongji UniversityShanghai 201804China School of Software Engineering Tongji UniversityShanghai 201804China Engineering Research Center of Key Software Technologies for Smart City Perception and Planning Ministry of EducationShanghai 200003China Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 201804China

Intelligent reflecting surface(IRS)assisted with the wireless powered communication network(WPCN)can enhance the desired signal energy and carry out the power-sustaining problem in ocean monitoring *** this paper,we investigate a reliable communication structure where multiple buoys transmit data to a base station(BS)with the help of the unmanned aerial vehicle(UAV)-mounted IRS and harvest energy from the base station *** organically combine WPCN with maritime data collection scenario,a scheduling protocol that employs the time division multiple access(TDMA)is proposed to serve multiple buoys for uplink data ***,we compare the full-duplex(FD)and half-duplex(HD)mechanisms in the maritime data collection system to illustrate different performances under these two *** maximize the fair energy efficiency under the energy harvesting constraints,a joint optimization problem on user association,BS transmit power,UAV’s trajectory and IRS’s phase shift is *** solve the non-convex problem,the original problem is decoupled into several subproblems,and successive convex optimization and block coordinate descent(BCD)methods are employed obtain the near-optimal solutions *** results demonstrate that the UAV-mounted IRS can significantly improve energy efficiency in our considered system.

关键词： full-duplex IRS joint optimization TDMA UAV WPCN

来源：评论

学校读者我要写书评

暂无评论

GCD-Sampling: A General Cross-scale Decoupled Sampling for Point Cloud 39

GCD-Sampling: A General Cross-scale Decoupled Sampling for P...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Dai, Tao Wang, Yanzi Xiong, Jianyu Zha, Yaohua Xia, Shu-Tao Zhu, Zexuan College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Tsinghua Shenzhen International Graduate School Tsinghua University China Shenzhen City Key Laboratory of Embedded System Design Shenzhen China

ISBN: (纸本)157735897X

Sampling strategy (e.g., fixed farthest point sampling) of point cloud has been an essential step for developing practical solutions in 3D computer vision tasks. Previous fixed sampling is simple, but suffer from suboptimal performance for downstream tasks. To adapt to target networks properly, adaptive sampling methods with trainable parameters have been recently developed to enhance the performance. However, existing adaptive sampling methods still suffer from the over-coupling problem of target network, and thus become model-specific, which limits their practical applications. To address this issue, we propose a novel general cross-scale decoupled sampling method (GCD-sampling) for point cloud, which consists of original feature cache, cross-scale feature fusion and convex combination learning for better feature extraction. To reduce the coupling relationship with the target task network, our method only utilizes the point cloud coordinates as the input and output of itself. Besides, we introduce an arbitrary scale structure to enable parameter sharing across multi-scale sampling in point cloud networks. Extensive experiments on different architectures demonstrate the effectiveness of our method over other existing adaptive sampling methods. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：