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

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Li, Zhuowen Chen, Hongmei Xiang, Biao Yuan, Zhong Luo, Chuan Li, Tianrui School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu 611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu 611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu 611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu 611756 China College of Computer Science Sichuan University Chengdu 610065 China

ISBN: (纸本)9783031927430

The main objective of incomplete multi-view clustering is to effectively utilize the existing view information to fill in the missing data and to mine the complementary information and potential associations between multiple views to effectively group samples. The existing primary means for recovering missing information are classified into two parts: one uses matrix decomposition or low-rank constraints to fill in the missing views, and the other constructs multiple graph structures and uses graph regularization to recover the corresponding missing parts. However, the two methods are relatively independent and are not used jointly to improve the model performance. This paper proposes an incomplete multi-view clustering method with complete clustering metrics and complete anchor graphs (CFAG). Specifically, each view’s missing samples are recovered by a matrix of consistent clustering metrics and represented by an anchor graph. The recovered complete data performs anchor graph construction and anchor learning and utilizes the orthogonal variation principle to learn the consistency structure of multiple anchor graphs to mine the complementary information among multiple views. The clustering metrics are obtained based on the consistency structure, and the consistency of the clustering metrics is also considered to obtain the final clustering results. The effectiveness of the proposed method is verified on multiple datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Anchor graph Incomplete multi-view clustering Missing views recovery

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Cross-Subject Decision Confidence Estimation from EEG Signals Using Spectral-Spatial-Temporal Adaptive GCN with Domain Adaptation

Cross-Subject Decision Confidence Estimation from EEG Signal...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Rong-Fei Gu Rui Li Wei-Long Zheng Bao-Liang Lu Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Brain Science and Technology Research Center Shanghai Jiao Tong University Shanghai China RuiJin-Mihoyo Laboratory Clinical Neuroscience Center RuiJin Hospital Shanghai Jiao Tong University School of Medicine Shanghai China

The study of the human decision-making process has long been a valuable field for both scientific research and practical application. Towards knowing and taking control of the decision-making process, evaluating the reliability of human decisions objectively plays an important role. Various studies have demonstrated that the confidence level of humans during the decision-making process is an important factor that reflects the correctness of decisions. In literature, several deep learning based methods have been developed to estimate decision confidence using Electroencephalography (EEG). Among these approaches, the spectral-spatial-temporal adaptive graph convolutional neural network (SST-AGCN) stands out. However, SST-AGCN focuses on specific subjects, and may lead to less efficiency in cross-subject situations, which are more common in application scenarios. In this paper, we propose a deep learning model called SST-AGCN with Domain Adaptation (SST-AGCN-DA) for cross-subject decision confidence estimation. To examine the effectiveness of our proposed model, we compare our SST-AGCN-DA with the original SST-AGCN, three typical domain adaption algorithms in the field, and the SST-AGCN with Domain Generalization (SST-AGCN-DG), which is another transfer learning model we developed in this paper. We conduct cross-subject confidence estimation experiments on an EEG dataset collected under a text-based decision-making task. The averaged results of leave-one-out cross-validation come out that the F1-scores of our proposed SST-AGCN-DA and SST-AGCN-DG are 79.45% and 77.04%, respectively, while the original SST-AGCN and the best of the existing domain adaptation algorithms are 74.15% and 74.25%, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pheromone Matrix Eigenvalue-based Convergence Assessment Indicator for Ant Colony Optimization

Pheromone Matrix Eigenvalue-based Convergence Assessment Ind...

引用

Machine Intelligence Theory and Applications (MiTA), International Conference on

作者： Xu Li Lin Shi Jian-Yu Li Jing Xu Zhi-Hui Zhan School of Computer Science and Engineering South China University of Technology Guangzhou P. R. China Research Center of Intelligent Computing & Big Data Technology Guangdong University of Finance and Economics Guangzhou Guangdong P. R. China College of Artificial Intelligence Nankai University Tianjin P. R. China

ISBN: (数字)9798350385670

ISBN: (纸本)9798350385687

As a crucial member of the evolutionary computation (EC), ant colony optimization (ACO) converges to the optimal result through a continuous process of iterative optimization. However, determining the convergence status of an ant colony remains a challenging task without well-established methods. To this end, this paper proposes a global evaluation indicator—average absolute eigenvalue of pheromone matrix (AAEPM) by constructing a pheromone matrix and analyzing its eigenvalue variations. This indicator aims to assess the convergence status of the ant colony during the evolutionary process. Experimental results show that the AAEPM is correlated with the convergence status of ACO and is not significantly influenced by algorithm parameters and problem scale.

关键词： Measurement Ant colony optimization Heuristic algorithms Evolutionary computation Eigenvalues and eigenfunctions Robustness Iterative methods Optimization Machine intelligence Convergence

来源：评论

学校读者我要写书评

暂无评论

GESH-NET: GRAPH-ENHANCED SPHERICAL HARMONIC CONVOLUTIONAL NETWORKS FOR CORTICAL SURFACE REGISTRATION

arXiv

引用

arXiv 2024年

作者： Zhang, Ruoyu Wang, Lihui Tang, Kun Xu, Jingwen Wei, Hongjiang Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China School of Biomedical Engineering Shanghai Jiao Tong University Shanghai China

Cortical surface registration plays a crucial role in coordinating individual cortical functions and anatomical features, serving as a fundamental step in cortical surface analysis. Its aim is to align the anatomical or functional regions of different individuals, which is of great importance for neuroimaging studies across different populations. Currently, cortical surface registration techniques based on classical methods have been well developed. However, a key issue with classical registration methods is that for each pair of images to be registered, it is necessary to search for the optimal transformation in the deformation space according to a specific optimization algorithm until the similarity measure function converges, which cannot meet the requirements of real-time and high-precision in medical image registration. With the spectacular success of deep learning in the field of computer vision, researching cortical surface image registration techniques based on deep learning models has become a new direction. But so far, there are still only a few studies on cortical surface image registration based on deep learning. Moreover, although deep learning methods theoretically have stronger representation capabilities, surpassing the most advanced classical methods in registration accuracy and distortion control remains a challenge. Therefore, to address this challenge, this paper constructs a deep learning model to study the technology of cortical surface image registration. The specific work is as follows: (1) An unsupervised cortical surface registration network based on a multi-scale cascaded structure is designed, and a convolution method based on spherical harmonic transformation is introduced to register cortical surface data. This solves the problem of scale-inflexibility of spherical feature transformation and optimizes the multi-scale registration process. The results show that the proposed network outperforms the other deep learning-based registration m

关键词： Spheres

来源：评论

学校读者我要写书评

暂无评论

R2 Indicator and Deep Reinforcement Learning Enhanced Adaptive Multi-Objective Evolutionary Algorithm

arXiv

引用

arXiv 2024年

作者： Tahernezhad-Javazm, Farajollah Rankin, Debbie Bois, Naomi Du Smith, Alice E. Coyle, Damien Intelligent Systems Research Center School of Computing Engineering and Intelligent Systems Ulster University LondonderryBT48 7JL United Kingdom The Bath Institute for Augmented Human University of Bath BathBA2 7AY United Kingdom The Department of Industrial and Systems Engineering Department of Computer Science and Software Engineering Auburn University AuburnAL36849 United States

Choosing an appropriate optimization algorithm is essential to achieving success in optimization challenges. Here we present a new evolutionary algorithm structure that utilizes a reinforcement learning-based agent aimed at addressing these issues. The agent employs a double deep q-network to choose a specific evolutionary operator based on feedback it receives from the environment during optimization. The algorithm’s structure contains five single-objective evolutionary algorithm operators. This single-objective structure is transformed into a multi-objective one using the R2 indicator. This indicator serves two purposes within our structure: first, it renders the algorithm multi-objective, and second, provides a means to evaluate each algorithm’s performance in each generation to facilitate constructing the reinforcement learning-based reward function. The proposed R2-reinforcement learning multi-objective evolutionary algorithm (R2-RLMOEA) is compared with six other multiobjective algorithms that are based on R2 indicators. These six algorithms include the operators used in R2-RLMOEA as well as an R2 indicator-based algorithm that randomly selects operators during optimization. We benchmark performance using the CEC09 functions, with performance measured by inverted generational distance and spacing. The R2-RLMOEA algorithm outperforms all other algorithms with strong statistical significance (p © 2024, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Byzantine-Resilient Over-the-Air Federated Learning under Zero-Trust Architecture

arXiv

引用

arXiv 2025年

作者： Yao, Jiacheng Shi, Wei Xu, Wei Yang, Zhaohui Swindlehurst, A. Lee Niyato, Dusit The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China The Purple Mountain Laboratories Nanjing211111 China The Research Institute of Intelligent Networks Zhejiang Lab Hangzhou311121 China The College of Information Science and Electronic Engineering Zhejiang University Zhejiang Hangzhou310027 China The Center for Pervasive Communications and Computing Henry Samueli School of Engineering University of California at Irvine IrvineCA92697 United States The School of Computer Science and Engineering Nanyang Technological University Singapore308232 Singapore

Over-the-air computation (AirComp) has emerged as an essential approach for enabling communication-efficient federated learning (FL) over wireless networks. Nonetheless, the inherent analog transmission mechanism in AirComp-based FL (AirFL) intensifies challenges posed by potential Byzantine attacks. In this paper, we propose a novel Byzantine-robust FL paradigm for over-the-air transmissions, referred to as federated learning with secure adaptive clustering (FedSAC). FedSAC aims to protect a portion of the devices from attacks through zero trust architecture (ZTA) based Byzantine identification and adaptive device clustering. By conducting a one-step convergence analysis, we theoretically characterize the convergence behavior with different device clustering mechanisms and uneven aggregation weighting factors for each device. Building upon our analytical results, we formulate a joint optimization problem for the clustering and weighting factors in each communication round. To facilitate the targeted optimization, we propose a dynamic Byzantine identification method using historical reputation based on ZTA. Furthermore, we introduce a sequential clustering method, transforming the joint optimization into a weighting optimization problem without sacrificing the optimality. To optimize the weighting, we capitalize on the penalty convex-concave procedure (P-CCP) to obtain a stationary solution. Numerical results substantiate the superiority of the proposed FedSAC over existing methods in terms of both test accuracy and convergence rate. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

TEVA: Training-Efficient and Verifiable Aggregation for Federated Learning for Consumer Electronics in Industry 5.0

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Xia, Yuanjun Liu, Yining Chen, Jingxue Liang, Yangfan Khan, Fazlullah Alturki, Ryan Wang, Xiaopei Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software School of Computer and Information Security Guilin541004 China Wenzhou University of Technology School of Data Science and Artificial Intelligence Wenzhou325027 China University of Technology School of Mathematical and Physical Sciences SydneyNSW2007 Australia Jiaxing University Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems The Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province The Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing314001 China University of Nottingham Ningbo China School of Computer Science Faculty of Science and Engineering Zhejiang Ningbo315104 China Umm AI-Qura University Makkah Department of Software Engineering College of Computing Saudi Arabia Riverside Department of Computer Science and Engineering University of California CA92521 United States

Federated learning (FL) has been widely used for privacy-preserving model updates in Industry 5.0, facilitated by 6G networks. Despite FL's privacy-preserving advantages, it remains vulnerable to attacks where adversaries can infer private data from local models or manipulate the central server (CS) to deliver falsified global models. Current privacy-preserving approaches, primarily based on the FedAvg algorithm, fail to optimize training efficiency for non-independent and identically distributed (non-IID) data. This article proposes training-efficient and verifiable aggregation (TEVA) for FL to resolve these issues. This scheme combines threshold Paillier homomorphic encryption (TPHE), verifiable aggregation, and an optimized double momentum update mechanism (OdMum). TEVA not only leverages TPHE to protect the privacy of local models but also ensures the integrity of the global model through a verifiable aggregation mechanism. Additionally, TEVA integrates the OdMum algorithm to effectively address the challenges posed by non-IID data, promoting rapid model convergence and significantly enhancing overall training efficiency. Security analysis indicates that TEVA meets the requirements for privacy protection. Extensive experimental results demonstrate that TEVA can accelerate model convergence while incurring lower computational and communication overheads. © 1975-2011 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Unextendible and Strongly Uncompletable Product Bases

arXiv

引用

arXiv 2024年

作者： Zhen, Xiao-Fan Zuo, Hui-Juan Shi, Fei Fei, Shao-Ming School of Mathematical Sciences Hebei Normal University Shijiazhuang050024 China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China Hebei Key Laboratory of Computational Mathematics and Applications Shijiazhuang050024 China Hebei International Joint Research Center for Mathematics and Interdisciplinary Science Shijiazhuang050024 China Department of Computer Science School of Computing and Data Science University of Hong Kong Hong Kong999077 Hong Kong School of Mathematical Sciences Capital Normal University Beijing10048 China

In 2003, DiVincenzo et al. put forward the question that whether there exists an unextendible product basis (UPB) which is an uncompletable product basis (UCPB) in every bipartition [DiVincenzo et al. Commun. Math. Phys. 238, 379-410(2003)]. Recently, Shi et al. presented a UPB in tripartite systems that is also a strongly uncompletable product basis (SUCPB) in every bipartition [Shi et al. New J. Phys. 24, 113-025 (2022)]. However, whether there exist UPBs that are SUCPBs in only one or two bipartitions remains unknown. We provide a sufficient condition for the existence of SUCPBs based on a quasi U-tile structure. We analyze all possible cases about the relationship between UPBs and SUCPBs in tripartite systems. In particular, we construct a UPB with smaller size d3 − 3d2 + 1 in Cd Cd Cd, which is an SUCPB in every bipartition and has a smaller cardinality than the existing one. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：