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

Advances in Robust Federated Learning: A Survey with Heterogeneity Considerations

IEEE Transactions on big data 2025年第3期11卷 1548-1567页

作者： Chen, Chuan Liao, Tianchi Deng, Xiaojun Wu, Zihou Huang, Sheng Zheng, Zibin Sun Yat-sen University School of Computer Science and Engineering Guangzhou510006 China Guangdong Key Laboratory of Big Data Analysis and Processing China Sun Yat-sen University School of Software Engineering Zhuhai519000 China Sun Yat-sen University School of Systems Science and Engineering Guangzhou510006 China Zhuhai Key Laboratory of Trusted Large Language Models China

In the field of heterogeneous federated learning (FL), the key challenge is to efficiently and collaboratively train models across multiple clients with different data distributions, model structures, task objectives, computational capabilities, and communication resources. This diversity leads to significant heterogeneity, which increases the complexity of model training. In this paper, we first outline the basic concepts of heterogeneous FL and summarize the research challenges in FL in terms of five aspects: data, model, task, device and communication. In addition, we explore how existing state-of-the-art approaches cope with the heterogeneity of FL, and categorize and review these approaches at three different levels: data-level, model-level, and architecture-level. Subsequently, the paper extensively discusses privacy-preserving strategies in heterogeneous FL environments. Finally, the paper discusses current open issues and directions for future research, aiming to promote the further development of heterogeneous FL. © 2015 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Laplacian Sparse Dynamic Slow Feature analysis for Process Monitoring and Fault Isolation

引用

IEEE Sensors Journal 2025年第9期25卷 15653-15667页

作者： Wu, Ping Xue, Yikai Ni, Yuxuan Pan, Haipeng Zhang, Xi He, Yuchen Gao, Jinfeng Zhejiang Sci-Tech University School of Information Science and Engineering Hangzhou310018 China China Jiliang University Key Laboratory of Intelligent Manufacturing Quality Big Data Tracing and Analysis of Zhejiang Province Hangzhou314423 China

The process monitoring and fault isolation are essential for ensuring operational safety and maintaining product quality in the industrial processes. This study introduces a novel approach to process monitoring and fault isolation based on the Laplacian sparse dynamic slow feature analysis (LSDSFA). To simultaneously account for sparsity, dynamics, and global structural information, a new optimization framework for LSDSFA is proposed. This framework incorporates the n l1 norm and a Laplacian graph into dynamic slow feature analysis (SFA), with enhancements to process variable representation. The optimization problem is addressed using the alternating direction method of multipliers (ADMMs). The proposed method decomposes the process variable space into latent and residual subspaces. In addition, three monitoring statistics are developed to facilitate effective process monitoring, while fault isolation is achieved through a two-level contribution plot. Specifically, the intrinsic structure of the process data is captured by employing a graph Laplacian operator to explore intervariable correlations. Simultaneously, the incorporation of the graph Laplacian operator and l1 norm into dynamic SFA (DSFA) reduces variable redundancy, thereby exploiting the intrinsic structure of the process data more effectively and improving interpretability through the sparsity. Experimental evaluations conducted on the widely adopted Tennessee Eastman Process (TEP) benchmark and a real-world blast furnace ironmaking process (BFIP) demonstrate the superior performance of the proposed LSDSFA-based method in comparison with related techniques. © 2001-2012 IEEE.

关键词： Blast furnaces

来源：评论

学校读者我要写书评

暂无评论

Enhancing fairness of trading environment:discovering overlapping spammer groups with dynamic co‑review graph optimization

引用

Cybersecurity 2025年第2期8卷 242-269页

作者： Chaoqun Wang Ning Li Shujuan Ji Xianwen Fang Zhen Wang Shandong Provincial Key Laboratory of Wisdom Mine Information Technology Shandong University of Science&TechnologyQingdao 266590ShandongChina Anhui Province Engineering Laboratory for Big Data Analysis and Early Warning Technology of Coal Mine Safety Anhui University of Science and TechnologyHuainanChina

Within the thriving e-commerce landscape,some unscrupulous merchants hire spammer groups to post misleading reviews or ratings,aiming to manipulate public perception and disrupt fair market *** phenomenon has prompted a heightened research focus on spammer groups *** the e-commerce domain,current spammer group detection algorithms can be classified into three categories,i.e.,Frequent Item Mining-based,graph-based,and burst-based ***,existing graph-based algorithms have limitations in that they did not adequately consider the redundant relationships within co-review graphs and neglected to detect overlapping members within spammer *** address these issues,we introduce an overlapping spammer group detection algorithm based on deep reinforcement learning named ***,the algorithm filters out highly suspicious products and gets the set of reviewers who have reviewed these ***,taking these reviewers as nodes and their co-reviewing relationships as edges,we construct a homogeneous co-reviewing ***,to efficiently identify and handle the redundant relationships that are accidentally formed between ordinary users and spammer group members,we propose the Auto-Sim algorithm,which is a specifically tailored algorithm for dynamic optimization of the co-reviewing graph,allowing for adjustments to the reviewers’relationship network within the ***,candidate spammer groups are discovered by using the Ego-Splitting overlapping clustering algorithm,allowing overlapping members to exist in these ***,these groups are refined and ranked to derive the final list of spammer *** results based on real-life datasets show that our proposed DRL-OSG algorithm performs better than the baseline algorithms in Precision.

关键词： Spammer groups Homogeneous network Redundant relationships Overlapping members Deep reinforcement learning Ego-splitting algorithm

来源：评论

学校读者我要写书评

暂无评论

Wind turbine detection based on high spatial resolution four-band reflectance images 6

Wind turbine detection based on high spatial resolution four...

引用

6th International Conference on Geoscience and Remote Sensing Mapping, GRSM 2024

作者： Deng, Fengying Qiao, Baojun Li, Kaitao Zhao, Limin Chen, Xingfeng Li, Jiaguo Liu, Jun Sun, Yuan Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China Aerospace Information Research Institute Chinese Academy of Science Beijing China School of Space Information Space Engineering University Beijing China

ISBN: (纸本)9781510688018

Wind turbine detection is essential for the power industry and regulatory agencies to efficiently and accurately determine their number and spatial distribution. Under complex underlying surface conditions, the detection accuracy of conventional methods is low, especially when dealing with multi-scale wind turbine targets. In addition, the underutilization of the near-infrared (NIR) band limits the capability of optical remote sensing sensors in wind turbine detection. To address the above problems, this paper proposes a wind turbine detection algorithm YOLOv8m-BD based on high spatial resolution four-band reflectance images using YOLOv8m as the baseline model. Firstly, the four-band image is input through channel adaptation modification. Next, the CSPDarknet53 to 2-stage FPN (C2f) module is enhanced by introducing deformable convolution (DCN) to expand the receptive field. Finally, the effectiveness of our design was validated through extensive experiments on a self-built wind turbine dataset. Compared to the YOLOv8m baseline model that only inputs RGB three bands, the improved YOLOv8m-BD achieves an accuracy of 96.4% and a false alarm rate of 2.0%, an increase of 3.4% in accuracy and a decrease of 2.5% in false alarm rate. © 2025 SPIE.

关键词： Proximity sensors

来源：评论

学校读者我要写书评

暂无评论

ACFM: Adaptive Channel Feature Matching for Pedestrian Re-Identification

引用

IEEE Access 2025年 13卷 82278-82290页

作者： Lu, Zhengcai Tian, Zhengwei Luzhou Vocational and Technical College School of Artificial Intelligence & Big Data Sichuan 646000 China Luzhou Key Laboratory of Intelligent Data Analysis and Processing China

Image misalignment is a significant challenge in the field of pedestrian re-identification. Previous studies typically align pedestrian features using additional models or by leveraging auxiliary information. However, these methods are data-dependent and can fail when dealing with substantial scene variations. To address these challenges, this paper proposes an efficient adaptive channel feature matching (ACFM) strategy. This method adaptively aligns channel feature maps according to image content, enables accurate matching of local features across images, and mitigates the need for supplementary data. Building on the ACFM approach, this paper develops a multi-branch adaptive matching network model. The model incorporates a channel attention mechanism to enhance the representation capacity of individual channels and integrates the ACFM algorithm within local branches to optimize the distance metric computation, effectively capturing and aligning local details. The multi-branch structure is designed to handle both global and local features, enabling the network to comprehensively capture and integrate image information. Evaluation experiments conducted on two widely-used benchmark datasets, Market-1501 and DukeMTMC-reID, demonstrate that the proposed method offers significant advantages over current state-of-the-art approaches. © 2013 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

EXISTENCE AND UNIQUENESS OF SOLUTIONS FOR UNCERTAIN NONLINEAR SWITCHED SYSTEMS WITH V-N JUMPS

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2025年第1期87卷 129-140页

作者： Jia, Zhifu Li, Cunlin School of Mathematics and Physics Suqian University Suqian223800 China [Ningxia Key Laboratory of intelligent information and Big Data Processing Governance and Social Management Research Center of Northwest Ethnic Regions North Minzu University Yinchuan China

In this paper, an uncertain nonlinear switched system with V-n jumps, characterized by its sensitivity to subjective uncertainties, is modeled using uncertain differential equations with V-n jumps. To account for the discontinuous jump behavior in each subsystem, a V-n jumps process associated with an uncertain Z-n jumps variable, defined by a jump uncertainty distribution, is introduced. Under the assumptions of linear growth and Lipschitz conditions, an existence and uniqueness theorem for the solutions of uncertain nonlinear switched systems with V-n jumps is established and rigorously proven. An illustrative example is provided to demonstrate the effectiveness and applicability of the theoretical results. © 2025, Politechnica University of Bucharest. All rights reserved.

关键词： Uncertain systems

来源：评论

学校读者我要写书评

暂无评论

A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving

引用

Neural Computing and Applications 2025年第3期37卷 1651-1672页

作者： Xu, Junjie Chen, Yuzhong Xiao, Lingsheng Liao, Hongmiao Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Math word problem (MWP) represents a critical research area within reading comprehension, where accurate comprehension of math problem text is crucial for generating math expressions. However, current approaches still grapple with unresolved challenges in grasping the sensitivity of math problem text and delineating distinct roles across various clause types, and enhancing numerical representation. To address these challenges, this paper proposes a Numerical Magnitude Aware Multi-Channel Hierarchical Encoding Network (NMA-MHEA) for math expression generation. Firstly, NMA-MHEA implements a multi-channel hierarchical context encoding module to learn context representations at three different channels: intra-clause channel, inter-clause channel, and context-question interaction channel. NMA-MHEA constructs hierarchical constituent-dependency graphs for different levels of sentences and employs a Hierarchical Graph Attention Neural Network (HGAT) to learn syntactic and semantic information within these graphs at the intra-clause and inter-clause channels. NMA-MHEA then refines context clauses using question information at the context-question interaction channel. Secondly, NMA-MHEA designs a number encoding module to enhance the relative magnitude information among numerical values and type information of numerical values. Experimental results on two public benchmark datasets demonstrate that NMA-MHEA outperforms other state-of-the-art models. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Multitasking Algorithm for Efficient Multiobjective Recommendations

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 518-532页

作者： Tian, Ye Ji, Luke Hu, Yiwei Ma, Haiping Wu, Le Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China Anhui University Institutes of Physical Science and Information Technology Hefei230601 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei230029 China

Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for multiobjective recommendation. Owing to the population-based search paradigm, these algorithms can produce a number of recommendation lists, making diverse tradeoffs between multiple metrics and meeting the requirements of accuracy, novelty, diversity, and other user preferences. However, these algorithms are criticized for the low efficiency of the optimization process, especially when the number of users is large. To address this issue, this article proposes an evolutionary multitasking-based recommendation method, where each task corresponds to a user and all the tasks are optimized simultaneously, thus highly improving the efficiency of recommendation. To enhance the convergence speed, all the users are divided into multiple populations according to the similarity between their preferences, where each population evolves with internal knowledge transfer between users, and all the populations evolve with external knowledge transfer between populations. Experimental results on various datasets verify that the proposed method can better balance between multiple metrics than classical and deep neural network-based recommendation methods and exhibits significantly higher efficiency than evolutionary multiobjective optimization-based recommendation methods. © 2024 IEEE. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Dynamic graph-based graph attention network for anomaly detection in industrial multivariate time series data

引用

Applied Intelligence 2025年第6期55卷 1-18页

作者： Gao, Cong Ma, Hongye Pei, Qingqi Chen, Yanping School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China School of Telecommunications Engineering Xidian University Xi’an710071 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121 China

For industrial big data, anomaly detection for multivariate time series data is of critical strategic significance. However, the complexity of industrial equipment and production processes, combined with the high dimensionality of production data, makes it challenging for traditional anomaly detection methods to effectively capture the complex interdependencies and dynamic evolutionary relationships among multiple variables. Additionally, issues such as unstable data distributions, variability, and data drift exacerbate the challenges faced by anomaly detection methods in industrial data analysis and decision-making. This study presents a dynamic graph-based graph attention network for anomaly detection in a multivariate time series data (D-GATAD) model, introducing an innovative approach to dynamic graph construction. The proposed method seamlessly integrates node content features with graph topological structure information, enabling adaptive construction of dynamic graphs based on the current sensor network structure. This design allows for precise modeling of the complex temporal dependencies between variables. Furthermore, the method incorporates an optimized prediction-based model design that organically combines embedding vectors with node data, thereby significantly enhancing the interpretability of the analytical results. Experimental evaluations demonstrate that the proposed method outperforms existing state-of-the-art models across multiple public benchmark datasets. Notably, on the highly complex WADI dataset, it achieves a 5.12% improvement in the AUC score, underscoring its robustness and effectiveness in industrial anomaly detection. This research offers an innovative and widely applicable solution for industrial data analysis and anomaly detection, with significant implications for practical deployment. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Uniform Attention Maps: Boosting Image Fidelity in Reconstruction and Editing

Uniform Attention Maps: Boosting Image Fidelity in Reconstru...

引用

2025 IEEE/CVF Winter Conference on Applications of Computer Vision, WACV 2025

作者： Mo, Wenyi Zhang, Tianyu Bai, Yalong Su, Bing Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China China Beijing Key Laboratory of Big Data Management and Analysis Methods China Du Xiaoman Technology China

ISBN: (纸本)9798331510831

Text-guided image generation and editing using diffusion models have achieved remarkable advancements. Among these, tuning-free methods have gained attention for their ability to perform edits without extensive model adjustments, offering simplicity and efficiency. However, existing tuning-free approaches often struggle with balancing fidelity and editing precision. Reconstruction errors in DDIM Inversion are partly attributed to the cross-attention mechanism in U-Net, which introduces misalignments during the inversion and reconstruction process. To address this, we analyze reconstruction from a structural perspective and propose a novel approach that replaces traditional cross-attention with uniform attention maps, significantly enhancing image reconstruction fidelity. Our method effectively minimizes distortions caused by varying text conditions during noise prediction. To complement this improvement, we introduce an adaptive mask-guided editing technique that integrates seamlessly with our reconstruction approach, ensuring consistency and accuracy in editing tasks. Experimental results demonstrate that our approach not only excels in achieving high-fidelity image reconstruction but also performs robustly in real image composition and editing scenarios. This study underscores the potential of uniform attention maps to enhance the fidelity and versatility of diffusion-based image processing methods. Code is available at https://***/Mowenyii/Uniform-Attention-Maps. © 2025 IEEE.

关键词： Photointerpretation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：