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

arXiv 2023年

作者： Ma, Jie Wang, Pinghui Kong, Dechen Wang, Zewei Liu, Jun Pei, Hongbin Zhao, Junzhou Di, Jia The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Automation Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The Shannxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China

Visual question answering requires a system to provide an accurate natural language answer given an image and a natural language question. However, it is widely recognized that previous generic VQA methods often tend to memorize biases present in the training data rather than learning proper behaviors, such as grounding images before predicting answers. Therefore, these methods usually achieve high in-distribution but poor out-of-distribution performance. In recent years, various datasets and debiasing methods have been proposed to evaluate and enhance the VQA robustness, respectively. This paper provides the first comprehensive survey focused on this emerging fashion. Specifically, we first provide an overview of the development process of datasets from in-distribution and out-of-distribution perspectives. Then, we examine the evaluation metrics employed by these datasets. Thirdly, we propose a typology that presents the development process, similarities and differences, robustness comparison, and technical features of existing debiasing methods. Furthermore, we analyze and discuss the robustness of representative vision-and-language pre-training models on VQA. Finally, through a thorough review of the available literature and experimental analysis, we discuss the key areas for future research from various viewpoints. Copyright © 2023, The Authors. All rights reserved.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

DMSACNN: Deep Multiscale Attentional Convolutional Neural Network for EEG-Based Motor Decoding

引用

IEEE Journal of Biomedical and Health Informatics 2025年 PP卷 PP页

作者： Liu, Ke Xing, Xin Yang, Tao Yu, Zhuliang Xiao, Bin Wang, Guoyin Wu, Wei Chongqing University of Posts and Telecommunications School of Computer Science and Technology Chongqing400065 China Chongqing University of Posts and Telecommunications Key Laboratory of Big Data Intelligent Computing China Chongqing University of Posts and Telecommunications Key Laboratory of Cyberspace Big Data Intelligent Security of Ministry of Education China South China University of Technology College of Automation Science and Engineering Guangzhou510641 China Chongqing Normal University National Center for Applied Mathematics in Chongqing Chongqing401331 China Shanghai Jiao Tong University School of Medicine Songjiang Hospital Songjiang Research Institute Shanghai Key Laboratory of Emotions and Affective Disorders Shanghai201600 China

Objective: Accurate decoding of electroencephalogram (EEG) signals has become more significant for the brain-computer interface (BCI). Specifically, motor imagery and motor execution (MI/ME) tasks enable the control of external devices by decoding EEG signals during imagined or real movements. However, accurately decoding MI/ME signals remains a challenge due to the limited utilization of temporal information and ineffective feature selection methods. Methods: This paper introduces DMSACNN, an end-to-end deep multiscale attention convolutional neural network for MI/ME-EEG decoding. DMSACNN incorporates a deep multiscale temporal feature extraction module to capture temporal features at various levels. These features are then processed by a spatial convolutional module to extract spatial features. Finally, a local and global feature fusion attention module is utilized to combine local and global information and extract the most discriminative spatiotemporal features. Main results: DMSACNN achieves impressive accuracies of 78.20%, 96.34% and 70.90% for hold-out analysis on the BCI-IV-2a, High Gamma and OpenBMI datasets, respectively, outperforming most of the state-of-the-art methods. Conclusion and significance: These results highlight the potential of DMSACNN in robust BCI applications. Our proposed method provides a valuable solution to improve the accuracy of the MI/ME-EEG decoding, which can pave the way for more efficient and reliable BCI systems. The source code for DMSACNN is available at https://***/xingxin-99/***. © 2025 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

LEGNN: A Label Ensemble Perspective for Training a Label-Noise-Resistant GNN with Reduced Complexity

arXiv

引用

arXiv 2024年

作者： Zhao, Rui Shi, Bin Liang, Zhiming Ruan, Jianfei Dong, Bo Lin, Lu School of Computer Science and Technology Xi'an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China School of Distance Education Xi'an Jiaotong University China College of Information Sciences and Technology Penn State University United States

Graph Neural Networks (GNNs) have been widely employed for semi-supervised node classification tasks on graphs. However, the performance of GNNs is significantly affected by label noise, that is, a small amount of incorrectly labeled nodes can substantially misguide model training. Mainstream solutions define node classification with label noise (NCLN) as a reliable labeling task, often introducing node similarity with quadratic computational complexity to more accurately assess label reliability. To this end, in this paper, we introduce the Label Ensemble Graph Neural Network (LEGNN), a lower complexity method for robust GNNs training against label noise. LEGNN reframes NCLN as a label ensemble task, gathering informative multiple labels instead of constructing a single reliable label, avoiding high-complexity computations for reliability assessment. Specifically, LEGNN conducts a two-step process: bootstrapping neighboring contexts and robust learning with gathered multiple labels. In the former step, we apply random neighbor masks for each node and gather the predicted labels as a high-probability label set. This mitigates the impact of inaccurately labeled neighbors and diversifies the label set. In the latter step, we utilize a partial label learning based strategy to aggregate the high-probability label information for model training. Additionally, we symmetrically gather a low-probability label set to counteract potential noise from the bootstrapped high-probability label set. Extensive experiments on six datasets demonstrate that LEGNN achieves outstanding performance while ensuring efficiency. Moreover, it exhibits good scalability on dataset with over one hundred thousand nodes and one million edges. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

ANIMC: A Soft Approach for Autoweighted Noisy and Incomplete Multiview Clustering

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2022年第2期3卷 192-206页

作者： Fang, Xiang Hu, Yuchong Zhou, Pan Wu, Dapeng Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering The School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Information Storage System Ministry of Education of China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States

Multiview clustering has wide real-world applications because it can process data from multiple sources. However, these data often contain missing instances and noises, which are ignored by most multiview clustering methods. Missing instances may make these methods difficult to use directly, and noises will lead to unreliable clustering results. In this article, we propose a novel autoweighted noisy and incomplete multiview clustering (ANIMC) approach via a soft autoweighted strategy and a doubly soft regular regression model. First, by designing adaptive semiregularized nonnegative matrix factorization, the soft autoweighted strategy assigns a proper weight to each view and adds a soft boundary to balance the influence of noises and incompleteness. Second, by proposing θ-norm, the doubly soft regularized regression model adjusts the sparsity of our model by choosing different θ. Compared with previous methods, ANIMC has three unique advantages: 1) it is a soft algorithm to adjust our approach in different scenarios, thereby improving its generalization ability;2) it automatically learns a proper weight for each view, thereby reducing the influence of noises;3) it performs doubly soft regularized regression that aligns the same instances in different views, thereby decreasing the impact of missing instances. Extensive experimental results show its superior advantages over other state-of-the-art works. © 2020 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A robust three-way classifier with shadowed granular-balls based on justifiable granularity

arXiv

引用

arXiv 2024年

作者： Yang, Jie Xiaodiao, Lingyun Wang, Guoyin Pedrycz, Witold Xia, Shuyin Zhang, Qinghua Wu, Di The Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China The School of Physics and Electronic Science Zunyi Normal University Zunyi563002 China The Key Laboratory of Cyberspace Big Data Intelligent Security Chongqing University of Posts and Telecommunications Chongqing400065 China The Department of Electrical and Computer Engineering University of Alberta EdmontonAB Canada College of Computer and Information Science Southwest University Chongqing400715 China

The granular-ball (GB)-based classifier introduced by Xia, exhibits adaptability in creating coarse-grained information granules for input, thereby enhancing its generality and flexibility. Nevertheless, the current GB-based classifiers rigidly assign a specific class label to each data instance and lacks of the necessary strategies to address uncertain instances. These far-fetched certain classification approachs toward uncertain instances may suffer considerable risks. To solve this problem, we construct a robust three-way classifier with shadowed GBs for uncertain data. Firstly, combine with information entropy, we propose an enhanced GB generation method with the principle of justifiable granularity. Subsequently, based on minimum uncertainty, a shadowed mapping is utilized to partition a GB into Core region, Important region and Unessential region. Based on the constructed shadowed GBs, we establish a three-way classifier to categorize data instances into certain classes and uncertain case. Finally, extensive comparative experiments are conducted with 2 three-way classifiers, 3 state-of-the-art GB-based classifiers, and 3 classical machine learning classifiers on 12 public benchmark datasets. The results show that our model demonstrates robustness in managing uncertain data and effectively mitigates classification risks. Furthermore, our model almost outperforms the other comparison methods in both effectiveness and efficiency. Copyright © 2024, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Cramér-Rao Bound Minimization for a Passive Sensing Multi-ISAC system

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Chen, Jian Chen, Qikai Deng, Yansha Jia, Jie Yin, Baoxin Wang, Xingwei Northeastern University School of Computer Science and Engineering Shenyang110819 China Northeastern University Engineering Research Center of Security Technology of Complex Network System Ministry of Education Shenyang110819 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China King's College London LondonWC2R 2LS United Kingdom

The integrated sensing and communication (ISAC) system can simultaneously provide communication and radar sensing, effectively improving spectrum utilization. However, existing research mainly focuses on the mono-static sensing ISAC system, which has shortcomings in limited sensing range and accuracy. We thus investigate a passive sensing multi-ISAC system with multiple communication users and sensing targets, and consider two cases for multi-target sensing without and with prior target knowledge at the base stations (BSs), in which the BSs are interested in estimating the targets' response matrix and channel coefficients, respectively. We also formulate a joint beamforming problem to minimize the Cramér-Rao bound (CRB) of the worst estimation constrained by communication requirements, and obtain the optimal solution with semidefinite relaxation (SDR) assisted transformation. To verify the advantages of our proposed scheme, we consider the bi-static BSs system (B-B) and beamforming with sensing interference cancellation (W-S) as two benchmark schemes. Numerical results illustrate that the proposed scheme obtains better sensing performance and effectively alleviates the effect caused by sensing interference. © 1967-2012 IEEE.

关键词： Cramer-Rao bounds

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Network Architecture Search Framework with Adaptive Multimodal Fusion for Hand Gesture Recognition

arXiv

引用

arXiv 2024年

作者： Xia, Yizhang Song, Shihao Hou, Zhanglu Xu, Junwen Zou, Juan Liu, Yuan Yang, Shengxiang Hunan Engineering Research Center of Intelligent System Optimization and Security Key Laboratory of Intelligent Computing and Information Processing Ministry of Education of China Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Hunan Province Xiangtan411105 China The Centre for Computational Intelligence School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Hand gesture recognition (HGR) based on multimodal data has attracted considerable attention owing to its great potential in applications. Various manually designed multimodal deep networks have performed well in multimodal HGR (MHGR), but most of existing algorithms require a lot of expert experience and time-consuming manual trials. To address these issues, we propose an evolutionary network architecture search framework with the adaptive multimodel fusion (AMF-ENAS). Specifically, we design an encoding space that simultaneously considers fusion positions and ratios of the multimodal data, allowing for the automatic construction of multimodal networks with different architectures through decoding. Additionally, we consider three input streams corresponding to intra-modal surface electromyography (sEMG), intra-modal accelerometer (ACC), and inter-modal sEMG-ACC. To automatically adapt to various datasets, the ENAS framework is designed to automatically search a MHGR network with appropriate fusion positions and ratios. To the best of our knowledge, this is the first time that ENAS has been utilized in MHGR to tackle issues related to the fusion position and ratio of multimodal data. Experimental results demonstrate that AMF-ENAS achieves state-of-the-art performance on the Ninapro DB2, DB3, and DB7 datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Structural disorder-induced topological phase transitions in quasicrystals

引用

Physical Review B 2024年第19期109卷 195301-195301页

作者： Tan Peng Yong-Chen Xiong Chun-Bo Hua Zheng-Rong Liu Xiaolu Zhu Wei Cao Fang Lv Yue Hou Bin Zhou Ziyu Wang Rui Xiong Key Laboratory of Artificial Micro- and Nano-Structures of Ministry of Education School of Physics and Technology Wuhan University Wuhan 430072 China Hubei Key Laboratory of Energy Storage and Power Battery and School of Mathematics Physics and Optoelectronic Engineering Hubei University of Automotive Technology Shiyan 442002 China School of Electronic and Information Engineering Hubei University of Science and Technology Xianning 437100 China Department of Physics Hubei University Wuhan 430062 China The Institute of Technological Science Wuhan University Wuhan 430072 China Key Laboratory of Intelligent Sensing System and Security of Ministry of Education Hubei University Wuhan 430062 China

Recently, structural disorder-induced topological phase transitions in periodic systems have attracted much attention. However, in aperiodic systems such as quasicrystalline systems, the interplay between structural disorder and band topology is still unclear. In this work, we investigate the effects of structural disorder on a quantum spin Hall insulator phase and a higher-order topological phase in a two-dimensional Amman-Beenker tiling quasicrystalline lattice. We demonstrate that the structural disorder can induce a topological phase transition from a quasicrystalline normal insulator phase to an amorphous quantum spin Hall insulator phase, which is confirmed by bulk gap closing and reopening, robust edge states, a quantized spin Bott index, and conductance. Furthermore, the structural disorder-induced higher-order topological phase transition from a quasicrystalline normal insulator phase to an amorphous higher-order topological phase characterized by a quantized quadrupole moment and topological corner states is also found. More strikingly, the disorder-induced higher-order topological insulator with eight corner states represents a distinctive topological state that eludes realization in conventional crystalline systems. Our work extends the study of the interplay between disorder effects and topologies to quasicrystalline and amorphous systems.

关键词： Topological insulators Topological phase transition Amorphous materials Tight-binding model

来源：评论

学校读者我要写书评

暂无评论

Several classes of linear codes with few weights derived from Weil sums

arXiv

引用

arXiv 2025年

作者： Hu, Zhao Qiu, Mingxiu Li, Nian Tang, Xiaohu Wu, Liwei Key Laboratory of Intelligent Sensing System and Security Hubei University Ministry of Education Hubei Provincial Engineering Research Center of Intelligent Connected Vehicle Network Security School of Cyber Science and Technology Hubei University Wuhan430062 China State Key Laboratory of Integrated Service Networks Xi’an710071 China Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan430062 China Southwest Jiaotong University Chengdu610031 China Wuhan Maritime Communication Research Institute China

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of t-weight linear codes over Fq are presented with the defining sets given by the intersection, difference and union of two certain sets, where t = 3, 4, 5, 6 and q is an odd prime power. By using Weil sums and Gauss sums, the parameters and weight distributions of these codes are determined completely. Moreover, three classes of optimal codes meeting the Griesmer bound are obtained, and computer experiments show that many (almost) optimal codes can be derived from our constructions. Copyright © 2025, The Authors. All rights reserved.

关键词： Weibull distribution

来源：评论

学校读者我要写书评

暂无评论

FedCSA: Boosting the Convergence Speed of Federated Unlearning under data Heterogeneity

FedCSA: Boosting the Convergence Speed of Federated Unlearni...

引用

IEEE International Conference on Big data and Cloud Computing (BdCloud)

作者： Zhen Wang Daniyal M Alghazzawi Li Cheng Gaoyang Liu Chen Wang Zeng Cheng Yang Yang Key Laboratory of Intelligent Sensing System and Security (Ministry of Education) School of Artificial Intelligence Hubei University Wuhan China King Abdulaziz University Jeddah Saudi Arabia Huazhong University of Science and Technology Wuhan China

The exponential growth of the Internet and the widespread availability of personal data have raised significant concerns regarding personal privacy and societal security. In response, the “right to be forgotten” has emerged as a fundamental principle, empowering individuals to request the removal of their personal data. Though relieving the privacy concerns at a certain degree by doing so, Artificial Intelligence (AI) models, trained by personal data, still suffers from privacy leakage risks. Therefore, machine unlearning attracts great attention from both industry and academia, aiming at erasing the risks of privacy leakage of AI models. However, existing machine unlearning methods primarily operate within centralized frame-works, limiting their applicability to decentralized Federated Learning (FL) settings where data is decentralized and not directly accessible. Additionally, current federated unlearning methods only approximate data deletion, leaving a potential risk of data leakage. To address these issues, this paper presents FedCSA, The FedCSA approach adopts a divide-and-conquer strategy by clustering and slicing the users’ data. Subsequently, submodels are trained on each individual slice, and their aggregation yields the global model. During the unlearning task, only the corresponding sub-model undergoes retraining, significantly reducing training time while ensuring data privacy and achieving precise data deletion. Extensive experiments are conducted on real-world datasets, including MNIST, Fashion-MNIST, and CIFAR-10, to evaluate the performance of FedCSA. The results demonstrate that FedCSA outperforms state-of-the-art machine learning methods, such as retrain and SISA, in terms of efficiency and global model performance. Our code is publicly available at https://***/ZhenWang9/FedCSA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：