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

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

来源：评论

学校读者我要写书评

暂无评论

Improved quantum image weighted average filtering algorithm

引用

Quantum Information Processing 2025年第5期24卷 1-24页

作者： Yuan, Suzhen Li, Xianli Yinxia, Shu Qing, Xianrong Deng, Jermiah D. College of Opto Electronic Engineering Chongqing University of Posts and Telecommunications Chongqing Chongqing400065 China School of Computing University of Otago Dunedin Dunedin9054 New Zealand School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing Chongqing400065 China Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing Chongqing400065 China

Average filtering plays a vital role in image smoothing tasks. However, existing quantum image weighted average filtering methods suffer from high circuit complexity. Therefore, this paper proposes an improved quantum color image weighted average filtering algorithm and its corresponding quantum circuit. First, we improve the quantum circuit to prepare classical color images into a quantum state. Then, an improved quantum divider is developed, and a weighted average filter is constructed using basic quantum image processing modules. Next, to enhance the universality of the filter, a quantum comparator with lower circuit complexity is used to design a noise detection module for distinguishing noise from real signals. Finally, a quantum circuit for color image weighted average filtering is designed, and simulations are conducted on the IBM Quantum Experience (IBM Q) platform to verify the feasibility of our algorithm. The analysis shows that compared with existing methods, this method significantly reduces the circuit complexity and has better filtering performance. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Particle Swarm Optimization Algorithm Based on Decomposition and Multi-Selection Strategy

引用

computers, Materials & Continua 2025年第1期82卷 997-1026页

作者： Li Ma Cai Dai Xingsi Xue Cheng Peng School of Computer Science Shaanxi Normal UniversityXi’an710119China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of TechnologyFuzhou350118China Information Construction and Management Center and Institute of Artificial Intelligence and Educational New Productivity Ningxia Normal UniversityGuyuan756099China

The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization *** the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search ***,two update strategies based on decomposition are used to update the evolving population and external archive,***,a multiselection strategy is *** first strategy is for the subspace without a non-dominated *** the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global *** second strategy is for the subspace with a non-dominated *** the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local *** third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated *** the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to ***,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search ***,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test *** results show that the proposed algorithm has better performance.

关键词： Multi-objective optimization multi-objective particle swarm optimization decomposition multi-selection strategy

来源：评论

学校读者我要写书评

暂无评论

Advances in Robust Federated Learning: A Survey with Heterogeneity Considerations

引用

IEEE Transactions on big data 2025年第03期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

来源：评论

学校读者我要写书评

暂无评论

Phasmatodea Population Evolution Algorithm Based on Spiral Mechanism and Its Application to data Clustering

引用

computers, Materials & Continua 2025年第4期83卷 475-496页

作者： Jeng-Shyang Pan Mengfei Zhang Shu-Chuan Chu Xingsi Xue Václav Snášel College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao266590China School of Artificial Intelligence Nanjing University of Information Science and TechnologyNanjing210044China Department of Information Management Chaoyang University of TechnologyTaichung41349TaiwanChina Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of TechnologyFuzhou350118China Faculty of Electrical Engineering and Computer Science VŠB-Technical University of OstravaOstrava70833Czech Republic

data clustering is an essential technique for analyzing complex datasets and continues to be a central research topic in data *** clustering algorithms,such as K-means,are widely used due to their simplicity and *** paper proposes a novel Spiral Mechanism-Optimized Phasmatodea Population Evolution Algorithm(SPPE)to improve clustering *** SPPE algorithm introduces several enhancements to the standard Phasmatodea Population Evolution(PPE)***,a Variable Neighborhood Search(VNS)factor is incorporated to strengthen the local search capability and foster population ***,a position update model,incorporating a spiral mechanism,is designed to improve the algorithm’s global exploration and convergence ***,a dynamic balancing factor,guided by fitness values,adjusts the search process to balance exploration and exploitation *** performance of SPPE is first validated on CEC2013 benchmark functions,where it demonstrates excellent convergence speed and superior optimization results compared to several state-of-the-art metaheuristic *** further verify its practical applicability,SPPE is combined with the K-means algorithm for data clustering and tested on seven *** results show that SPPE-K-means improves clustering accuracy,reduces dependency on initialization,and outperforms other clustering *** study highlights SPPE’s robustness and efficiency in solving both optimization and clustering challenges,making it a promising tool for complex data analysis tasks.

关键词： Phasmatodea population evolution algorithm data clustering meta-heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Causal fMRI-Mamba: Causal State Space Model for Neural Decoding and Brain Task States Recognition

Causal fMRI-Mamba: Causal State Space Model for Neural Decod...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Deng, Weihao Han, Fei Ling, Qinghua Liu, Qing Han, Henry School of Computer Science and Communication Engineering JiangSu University China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications China School of Computer Jiangsu University of Science and Technology China School of Electronic and Information Engineering West Anhui University China School of Engineering and Computer Science Baylor University United States

ISBN: (纸本)9798350368741

Deep learning advances neural decoding in functional magnetic resonance imaging (fMRI) tasks with convolution and attention-based methods. However, these methods struggle with capturing global spatiotemporal information due to high dimensionality, noise and inter-individual difference of fMRI, which also increase computational complexity and prior bias. To this end, a novel causal state space model, Causal fMRI-Mamba, is proposed for neural decoding and task state mapping. It effectively captures global spatiotemporal information via eliminating local redundancies and capturing long-distance dependencies. Meanwhile, a causal representation framework is designed to extract invariant high-order features and disentangle related causal features, enhancing model performance. Furthermore, a dense connection module is expanded to prevent significant causal information loss in hidden states of inter layers. On the HCP brain task state classification task, Causal fMRI-Mamba achieves better performance and generalization than comparison methods. © 2025 IEEE.

关键词： causal representation learning Neuro-decoding state space model task-based fMRI

来源：评论

学校读者我要写书评

暂无评论

KAIM: A distributed K-anonymity selection mechanism based on dual incentives

引用

Ad Hoc Networks 2025年 175卷

作者： Hu, Zhaowei Ni, Shiyun Quan, Hangyi Ding, Bocheng He, Peng School of Computer Science and Artificial Intelligence Aliyun School of Big Data School of Software Changzhou University Changzhou213159 China

With the growing demand for privacy protection, the construction of anonymous zones based on distributed K-anonymity mechanisms has gained widespread attention in the field of location privacy protection. However, existing methods often overlook the limitations of reputation evaluation in identifying potential unknown malicious behaviors of collaborators when selecting assistants to build K-anonymous zones. At the same time, the issue of delayed responses from collaborators during the process of encouraging user cooperation through incentive mechanisms, which may lead to construction failures, has not been effectively addressed. To tackle these challenges, this paper proposes a dual-incentive distributed K-anonymity selection mechanism (KAIM) that combines the Hidden Markov Model (HMM). This mechanism encourages collaborators to participate in the construction of anonymous zones quickly and on time by establishing two incentive models: the requester collaboration incentive model and the collective benefit optimization incentive model. These dual incentives help form the optimal requester-collaborator participation set, enabling efficient construction of K-anonymous zones. Additionally, the KAIM mechanism uses the HMM to model the behaviors of requesters and collaborators, and its effectiveness in identifying malicious user behaviors is validated on real datasets. Experimental results show that the HMM model can identify anomalous activities that significantly differ from normal behavioral patterns with high accuracy, providing strong assurance for the construction of anonymous zones. © 2025

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

A Vertical Federated Multi-View Fuzzy Clustering Method for Incomplete data

引用

IEEE Transactions on Fuzzy Systems 2025年第5期33卷 1510-1524页

作者： Li, Yan Hu, Xingchen Yu, Shengju Ding, Weiping Pedrycz, Witold Kiat, Yeo Chai Liu, Zhong National University of Defense Technology Laboratory for Big Data and Decision Hunan Changsha410073 China National University of Defense Technology School of Computer Hunan Changsha410073 China Nantong University School of Artificial Intelligence and Computer Science Nantong226019 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Polish Academy of Sciences Systems Research Institute Warsaw00-901 Poland Istinye University Faculty of Engineering and Natural Sciences Department of Computer Engineering Turkey Nanyang Technological University College of Computing and Data Science Singapore639798 Singapore

Multi-view fuzzy clustering (MVFC) has gained widespread adoption owing to its inherent flexibility in handling ambiguous data. The proliferation of privatization devices has driven the emergence of new challenge in MVFC researches. Federated learning, a technique that can jointly train without directly using raw data, has gain significant attention in decentralized MVFC. However, their applicability depends on the assumptions of data integrity and independence between different views. In fact, while within distributed environments, data typically exhibits two challenging problems: (1) multiple views within a single client;(2) incomplete data. Existing methods exhibit limitations in effectively addressing these challenges. Hence, in this study, we aim at achieving the effective clustering for incomplete data by a novel vertical federated MVFC framework. Specifically, a unified clustering framework is designed to capture both local client learning and global server training. For the local client learning, the data reconstruction strategy and prototype alignment strategy are introduced to ensure the preservation of data structure and refinement of clustering relationships, which mitigates the impact of incomplete data. Meanwhile, the global training process implements aggregation based on client-specific information. The whole process is realized based on the unified fuzzy clustering framework, promoting collaborative learning between client-specific and server information. Theoretical analyses and extensive experiments are carefully conducted to validate the effectiveness and efficiency of the proposed method from multiple perspectives. © 1993-2012 IEEE.

关键词： data integrity

来源：评论

学校读者我要写书评

暂无评论

A Reinforcement Learning Agent Controlled Multi-branch Small Object Detection Framework

A Reinforcement Learning Agent Controlled Multi-branch Small...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Hong, Junkun Long, Yitian Luo, Yueyi Hua, Liujie Long, Jun Qi, Qianqian School of Computer Science and Engineering Central South University Changsha China Data Science Institute Vanderbilt University NashvilleTN United States School of Mathematics and Statistics Central South University Changsha China Big Data Institution Central South University Changsha China

ISBN: (纸本)9798350368741

The past few years have witnessed the immense development of small object detection, which is aimed at detecting size-limited targets in high-resolution images. The prevailing methods focus on extracting fine-grained information by expanding the receptive fields and then generating the potential small object region. However, these solutions inevitably add sophisticated detectors and extra learning components, which incur time-consuming and computation-costing. Meanwhile, we observe that it's suboptimal to extract fine features in such a generic way. To alleviate the issues, we propose a multi-branch small object detection framework with a regular-scale detection branch and a small-scale detection branch. Specifically, we design and pre-train a reinforcement learning agent to control feature extractors in both branches according to the results of small object areas. Moreover, we present a region clipping algorithm to rebuild the small object to regular size, which can be input into a mature detector directly. The extensive experiments on COCO, VisDrone, SODA-D, and our collecting TVDS datasets demonstrate our method outperforms the state-of-the-art methods in several metrics. © 2025 IEEE.

关键词： multi-branch small object detection region clipping region discriminator reinforcement learning agent

来源：评论

学校读者我要写书评

暂无评论

Seer: Accelerating Block chain Transaction Execution by Fine-Grained Branch Prediction 51st

Seer: Accelerating Block chain Transaction Execution by Fine...

引用

51st International Conference on Very Large data Bases, VLDB 2025

作者： Zhang, Shijie Cheng, Ru Liu, Xinpeng Xiao, Jiang Jin, Hai Li, Bo National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Increasingly popular decentralized applications (dApps) with complex application logic incur significant overhead for executing smart contract transactions, which greatly limits public block chain performance. Pre-executing transactions off the critical path can mitigate substantial I/O and computation costs during execution. However, pre-execution does not yield any state transitions, rendering the system state inconsistent with actual execution. This inconsistency can lead to deviations in pre-execution paths when processing smart contracts with multiple state-related branches, thus diminishing pre-execution effectiveness. In this paper, we develop Seer, a novel public block chain execution engine that incorporates fine-grained branch prediction to fully exploit pre-execution effectiveness. Seerpredicts state-related branches using a two-level prediction approach, reducing inconsistent execution paths more efficiently than executing all possible branches. To enable effective reuse of pre execution results, Seer employs checkpoint-based fast-path execution, enhancing transaction execution for both successful and unsuccessful predictions. Evaluations with realistic block chain workloads demonstrate that Seer delivers an average of 27.7× transaction-level speedup and an overall 20.6× speedup in the execution phase over vanilla Ethereum, outperforming existing block chain execution acceleration solutions. © 2025, VLDB Endowment, All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：