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

Multiobjective Many-Tasking Evolutionary Optimization using Diversified Gaussian-Based Knowledge Transfer

IEEE Transactions on Evolutionary Computation 2024年

作者： Lin, Qiuzhen Wang, Qianhui Chen, Baihao Ye, Yulong Ma, Lijia Tan, Kay Chen Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The Hong Kong Polytechnic University Department of Data Science and Artificial Intelligence Hong Kong Hong Kong

Multiobjective multitasking evolutionary algorithms have shown promising performance for tackling a set of multiobjective optimization tasks simultaneously, as the optimization experience gained within one task can be transferred to accelerate the solving of others. However, most studies only select similar transfer tasks based on their designed metrics, which become less efficient when tackling a large number of optimization tasks, as their transferred knowledge may be insufficiently diversified. To alleviate this issue, this article proposes a Multiobjective Many-Tasking Evolutionary Algorithm using Diversified Gaussian-based knowledge Transfer, named MMaTEA-DGT. In this algorithm, a diversified transfer selection strategy is presented to choose a number of similar and complementary source tasks for knowledge transfer. Then, based on the above diversified source tasks, a Gaussian-based transfer strategy is designed to transfer their various optimization knowledge. In this way, MMaTEA-DGT is more effective in transferring optimization knowledge to speed up the solving of many tasks. Experimental studies on both the benchmark suites and a real-world dynamic vaccine prioritization problem have indicated the superiority of MMaTEA-DGT over some recently proposed multiobjective many-tasking evolutionary algorithms. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Deduplication Scheme Supporting Pre-verification of Label Consistency 17th

Fuzzy Deduplication Scheme Supporting Pre-verification of L...

引用

17th International Conference on Provable and Practical Security, ProvSec 2023

作者： Tang, Zehui Zeng, Shengke Li, Tao Cheng, Shuai Zheng, Haoyu School of Computer and Software Engineering Xihua University Chengdu610039 China State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China School of Computer Science Qufu Normal University Rizhao276825 China

ISBN: (纸本)9783031455124

Efficiently and securely removing encrypted redundant data with cross-user in the cloud is challenging. Convergent Encryption (CE) is difficult to resist dictionary attacks for its deterministic tag. Server-aided mechanism is against such attacks while it may exist collusion. Focus on multimedia data, this paper proposes an efficient and secure fuzzy deduplication system without any additional servers. We also propose a notion of pre-verification of label consistency to compensate for the irreparable post-verification loss. Compared with other fuzzy deduplication schemes, our work has apparent advantages in deduplication efficiency and security based on a natural data set. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Life Expectancy Prediction Based on Particle Swarm Optimization Support Vector Machine Regression

Life Expectancy Prediction Based on Particle Swarm Optimizat...

引用

Electrical engineering, Big data and Algorithms (EEBDA), IEEE International Conference on

作者： Zhaodong Guo Yuanxi Que Xiang Li College of Artificial Intelligence and Data Science Hebei University of Technology Tianjin China College of Computer Science & Software Engineering Shenzhen University Shenzhen China College of Computer Science Nankai University Tianjin China

This study delves into the application of Particle Swarm Optimization (PSO) algorithms in the parameter optimization of Support Vector Regression (SVR) models to enhance the accuracy of predicted average life expectancy. An adaptive PSO algorithm augmented with random perturbations is introduced. Through a fitness-function-guided dynamic adjustment mechanism, this method circumvents the premature convergence issue typical of conventional PSO, locating the optimal penalty parameter C and kernel parameter for the SVR model. These parameters are then incorporated into the SVR model for training and regression prediction, achieving optimal data fitting and generalization effects. Comparative analysis reveals that the PSO-enhanced SVR model outperforms the traditional SVR across various performance metrics. Notably, there is a marked improvement in the coefficient of determination, a significant re-duction in root mean square error, and mean absolute percentage error, affirming the advancements of the improved PSO-SVR model in prediction accuracy and reliability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Neural Network Sliding-Mode Control with Actor-Critic for a Class of Robot Systems 10

Fuzzy Neural Network Sliding-Mode Control with Actor-Critic ...

引用

10th International Conference on Orange Technology, ICOT 2022

作者： Hung, Lon-Chen Wei, Chun-Cheng Chen, Hung-Jen Yang, Chih-Fu Cheng, Wei-Min Lunghwa University of Science and Technology Department of Electronic Engineering Taiwan School of Software and Big Data Changzhou College of Information Technology China Lunghwa University of Science and Technology Department of Computer Information and Network Engineering China

ISBN: (纸本)9781665454193

In this article, a robust fuzzy RBF neural network sliding-mode control with actor-critic for a class of robot systems. Trajectory tracking control of robotic systems has favorable performance for tracking control. The fuzzy RBF neural network sliding-mode and actor-critic method is handled to compensate the uncertainty and disturbance of system. The stability analysis is based on for the proposed adaptive and robust control method. The simulation results show the effectiveness under the uncertainties. © 2022 IEEE.

关键词： Sliding mode control

来源：评论

学校读者我要写书评

暂无评论

Tree Regularization for Visual Explanations of Cancer Cell Classification

Tree Regularization for Visual Explanations of Cancer Cell C...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Muhammad Umair Raza Jie Chen Li Wang Adil Nawaz Victor C.M. Leung Jianqiang Li College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The challenge of interpretability remains a significant barrier to adopting deep neural networks in healthcare domains. Although tree regularization aims to align a deep neural network’s decisions with a single axis-aligned decision tree, however, relying on one tree for all inputs often leads to sub-optimal performance and interoperability. To address this limitation, we propose an enhanced tree regularization method that integrates a post-hoc visual explainable model such as Grad-CAM. This approach guides the deep model to be well-approximated by decision trees tailored to the salient regions identified by Grad-CAM in the input space. We rigorously validate the effectiveness of this framework on two cancer cell datasets: CNMC, which focuses on acute lymphoblastic leukemia cells, and ISBI2016, which comprises benign and malignant skin lesions. The results demonstrate that the proposed method delivers simpler and more interpretable explanations without compromising accuracy, thereby advancing the interpretability of deep learning models in critical healthcare applications.

关键词： Visualization Accuracy Decision making Artificial neural networks Predictive models Skin Decision trees Lesions Biological cells Cancer

来源：评论

学校读者我要写书评

暂无评论

Diversified Sequential Recommendation via Evolutionary Multi-Objective Transfer Optimization

Diversified Sequential Recommendation via Evolutionary Multi...

引用

Artificial Intelligence (CAI), IEEE Conference on

作者： Wei Zhou Xiaolong Luo Hongyue Bao Zexuan Zhu National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China College of Computer Science and Software Engineering Shenzhen University China

ISBN: (数字)9798350354096

ISBN: (纸本)9798350354102

Sequential Recommendation (SR) intends to model user interests based on historical behavior sequences and suggest the next item. Most existing sequential models primarily focus on learning users’ preferences on the relevance objective of the target item. However, the investigation of personalized preferences on the diversity objective of SR results is usually ignored. Evolutionary algorithms have amply demonstrated effectiveness in solving multi-objective problems but encounter efficiency bottlenecks when applied to multi-objective recommendation tasks due to the limited scalability at the user level. To address the problem, this study proposes to facilitate diversified SR via a multi-objective transfer optimization algorithm, in which each optimization task corresponds to the recommendation for a target user. With the optimization knowledge of user preference transferred within and across tasks, the diversified SR of a set of users can synchronously proceed. The novelty of our proposed algorithm is fully utilizing the outstanding global search capability of evolutionary multi-objective optimization without hindering the efficiency of sequential models.

关键词： Scalability Evolutionary computation Task analysis Artificial intelligence Optimization

来源：评论

学校读者我要写书评

暂无评论

Sparse Aggregation-Based Channel Estimation For Massive Mimo Systems With Decentralized Baseband Processing 48

Sparse Aggregation-Based Channel Estimation For Massive Mimo...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Xu, Yanqing Song, Enbin Shi, Qingjiang Chang, Tsung-Hui The Chinese University of Hong Kong School of Science & Engineering Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Sichuan University College of Mathematics Chengdu610064 China Tongji University School of Software Engineering Shanghai201804 China

ISBN: (纸本)9781728163277

To cope with the bottlenecks of the high computational complexity and excessive inter-connection communication in the conventional centralized baseband processing architecture, the decentralized baseband processing (DBP) architecture has been proposed, where the antennas are partitioned into multiple clusters, each connected to a local baseband unit (BBU). In this paper, we are interested in the distributed channel estimation (DCE) method under such DBP architecture, which is rarely studied in the literature. Our goal is to devise a DCE algorithm that can perform as well as the centralized scheme but with a small inter-connection communication cost. Specifically, based on the low-complexity diagonal minimum mean square error channel estimator, we propose an aggregate-then-estimate based DCE algorithm. In contrast to the existing DCE algorithm which requires iterative information exchanges among BBUs, our algorithm only requires one round-trip communication between the nodes. Experiment results are presented to demonstrate the efficacy of the proposed DCE algorithm. © 2023 IEEE.

关键词： channel estimation decentralized baseband processing Massive MIMO

来源：评论

学校读者我要写书评

暂无评论

An Energy-Aware UAVs Path Coverage for Critical Infrastructure Inspections 12

An Energy-Aware UAVs Path Coverage for Critical Infrastructu...

引用

12th International Conference on Advanced Cloud and Big data, CBD 2024

作者： Wang, Yifan Zeng, Wei Li, Guanyu Xiong, Chenglong Wang, Zicheng Mao, Yingchi College of Computer Science and Software Engineering Hohai University Nanjing China Hohai University Key Laboratory of Water Big Data Technology of Ministry of Water Resources Nanjing China Huaneng Lancang River Hydropower Co. CHINA HUANENG Group Kunming China Power China Kunming Engineering Co. Yunnan China

ISBN: (纸本)9798331511074

Critical infrastructures increasingly rely on unmanned aerial vehicles (UAVs) for inspection tasks. The significance of different components within these infrastructures is subject to variability and can be influenced by external factors. The principal aim of routine UAV inspections is to ensure differentiated coverage of pivotal sections with minimal energy consumption. However, extant research on UAV path coverage fails to fully account for the variability and dynamic shifts in regional significance and their impact on coverage efficacy. This paper presents an energy-aware collaborative coverage policy for UAVs, designated as ***-MATD3 employs a dynamic weight region partitioning method tailored to real-world environments and addresses the action selection challenge for UAVs using a discrete Partially Observable Markov Decision Process (Dec-POMDP). By amalgamating MATD3 with stacked LSTM, this approach mitigates redundant path overlaps and unnecessary action replication across multiple agents, thus optimizing coverage and diminishing energy usage. Simulation outcomes demonstrate that EA-MATD3 reduces energy consumption by an average of 9.65% relative to the Greedy, MADDPG, and MATD3 algorithms while sustaining a superior coverage rate. © 2024 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Model LEGO: Creating Models Like Disassembling and Assembling Building Blocks 38

Model LEGO: Creating Models Like Disassembling and Assemblin...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Hu, Jiacong Gao, Jing Ye, Jingwen Gao, Yang Wang, Xingen Feng, Zunlei Song, Mingli College of Computer Science and Technology Zhejiang University China Robotics Institute School of Computer Science Carnegie Mellon University United States Electrical and Computer Engineering National University of Singapore Singapore School of Software Technology Zhejiang University China State Key Laboratory of Blockchain and Data Security Zhejiang University China Institute of Blockchain and Data Security China Bangsheng Technology Co. Ltd. China

With the rapid development of deep learning, the increasing complexity and scale of parameters make training a new model increasingly resource-intensive. In this paper, we start from the classic convolutional neural network (CNN) and explore a paradigm that does not require training to obtain new models. Similar to the birth of CNN inspired by receptive fields in the biological visual system, we draw inspiration from the information subsystem pathways in the biological visual system and propose Model Disassembling and Assembling (MDA). During model disassembling, we introduce the concept of relative contribution and propose a component locating technique to extract task-aware components from trained CNN classifiers. For model assembling, we present the alignment padding strategy and parameter scaling strategy to construct a new model tailored for a specific task, utilizing the disassembled task-aware components. The entire process is akin to playing with LEGO bricks, enabling arbitrary assembly of new models, and providing a novel perspective for model creation and reuse. Extensive experiments showcase that task-aware components disassembled from CNN classifiers or new models assembled using these components closely match or even surpass the performance of the baseline, demonstrating its promising results for model reuse. Furthermore, MDA exhibits diverse potential applications, with comprehensive experiments exploring model decision route analysis, model compression, knowledge distillation, and more. For more information, please visit https://***/. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Crowdsourcing for data Labeling with Heterogeneous Crowd 39

Hierarchical Crowdsourcing for Data Labeling with Heterogene...

引用

39th IEEE International Conference on data engineering, ICDE 2023

作者： Zhang, Haodi Huang, Wenxi Su, Zhenhan Chen, Junyang Jiang, Di Fan, Lixin Zhang, Chen Lian, Defu Wu, Kaishun Shenzhen University College of Computer Science and Software Engineering China Shenzhen University WeBank Institute of Financial Technology China Webank Co. Ltd. China Hong Kong Polytechnic University Department of Computing Hong Kong University of Science and Technology of China School of Data Science China

ISBN: (纸本)9798350322279

With the rapid and continuous development of data-driven technologies such as supervised learning, high-quality labeled data sets are commonly required by many applications. Due to the easiness of crowdsourcing small tasks with low cost, a straightforward solution for label quality improvement is to collect multiple labels from a crowd, and then aggregate the answers. The aggregation strategies include majority voting and its many variants, EM-based approaches, Graph Neural Nets and so on. However, due to the uncertainty information loss and commonly existing task correlations, the aggregated labels usually contain errors and may damnify the downstream model *** address the above problem, we propose a hierarchical crowdsourcing framework1 for data labeling with noisy answers about correlated data. We make use of the heterogeneity of the labeling crowd and form an initialization-checking-update loop to improve the quality of labeled data. We formalize and successfully solve the core optimization problem, namely, selecting a proper set of checking tasks for each round. We prove that maximizing the expected quality improvement is equivalent to minimizing the conditional entropy of the observations given the crowdsourced answer families for the selected task set, which is NP-hard to solve. Therefore, we design an efficient approximation algorithm and conduct a series of experiments on real data. The experimental results show that the proposed method effectively improves the quality of the labeled data sets as well as the SOTA performance, yet without extra human labor costs. © 2023 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：