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

2021 International Conference on INnovations in Intelligent SysTems and Applications, INISTA 2021

作者： Mehrabi, Niloufar Pashaei, Elnaz Istanbul Aydin University Department of Artificial Intelligence and Data Science Istanbul Turkey Department of Software Engineering Istanbul Aydin University Istanbul Turkey

ISBN: (纸本)9781665436038

A vast impact concerning cancer research has been made by researchers analyzing the expression of thousands of genes at the same time and relating them to clinical phenotypes by DNA microarray technology. The large dimensions of gene expression microarray datasets, combined with a lack of samples and irrelevant or noisy genes, make classification tasks more difficult The purpose of gene selection is to identify the most informative genes in order to enhance prediction results. The Horse Herd Optimization Algorithm (HOA) is a novel swarm intelligence algorithm for solving continuous optimization problems, which simulate the behavior of a herd of horses. This study introduces a binary version of the Horse Herd Optimization Algorithm (BHOA) for solving discrete problems in biological data. Moreover, this paper introduces a novel hybrid gene selection framework that combines BHOA and a minimum Redundancy Maximum Relevance (mRMR) method. mRMR is applied as a filter approach to reduce noisy and irrelevant genes as well as to reduce the high computational cost that swarm intelligence algorithms generally suffer. The proposed approach's performance was examined using four well-known datasets: DLBCL, Colon, SRBCT, and Leukemia. According to the experimental results, the hybrid approach performed better than all the other methods regarding both accuracy and the number of selected genes. © 2021 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

data Clustering Using Chimp Optimization Algorithm 11

Data Clustering Using Chimp Optimization Algorithm

引用

11th International Conference on Computer engineering and Knowledge, ICCKE 2021

作者： Pedram Haeri Boroujeni, Sayed Pashaei, Elnaz Istanbul Aydin University Department of Artificial Intelligence and Data Science Istanbul Turkey Istanbul Aydin University Department of Software Engineering Istanbul Turkey

ISBN: (纸本)9781665402088

In recent decades, many successful meta-heuristic algorithms are widely applied to data clustering problems due to their powerful capabilities. The Chimp Optimization Algorithm (ChOA) is a recently proposed meta-heuristic search algorithm that is inspired by chimps' individual intelligence and sexual motivation in their group hunting. The good performance of ChOA in a variety of optimization problems, prove the superiority of this algorithm over other swarm-based intelligence. This study presents a novel approach according to ChOA for data clustering. ChOA, like other Swarm Intelligence-based Algorithms (SIAs), starts with a random population and then calculates an objective value for them. In data clustering problems the population of candidate solutions is the position vectors of the centroids, and the objective function is the sum of intra-cluster distances (SICDs) between each sample and its nearest centroid. Following that, ChOA attempts to optimize the population by finding the best position vectors of optimal centroids. There are four different kinds of chimps in this regard: driver, chaser, barrier, and attacker. Furthermore, four major hunting moves including driving, blocking, chasing, and attacking are considered to find the promising solution. In this research, four datasets of the UCI machine learning repository are used to evaluate the performance of the proposed new approach. Experimental results illustrate that the proposed work significantly outperforms other clustering algorithms regarding the objective value, Error Rate (ER), and some other statistical tests. © 2021 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Personalized Federated Learning with Multiple Classifier Aggregation

SSRN

引用

SSRN 2024年

作者： Zheng, Shaifeng Zhu, Qingling Lin, Qiuzhen Liu, Songbai Wong, Ka-Chun Li, Jianqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer Science City University of Hong Kong Hong Kong

Personalized federated learning (PFL) has garnered attention due to its capability to address statistical heterogeneity among clients. Typically, prevailing PFL methods aggregate a single global model for personalization, which may be inadequate for clients with diverse data distributions. Furthermore, in the local update, each private dataset is used to optimize the model independently, which increases the risk of overfitting the current data distribution and losing previously acquired knowledge, resulting in knowledge forgetting. In this study, personalized federated learning with multiple classifier aggregation is proposed. The method involves splitting the client model into its head and base, then optimizing them respectively using an alternating optimization strategy that first optimizes the head and then the base. Initially, to address the suboptimal model problem, the proposed approach aggregates multiple classifiers using data distribution and employs knowledge distillation to impart positive and negative classifier knowledge for learning the most suitable personalized model head. Additionally, to mitigate knowledge forgetting, a learnable personalization layer is introduced, and hidden loss is utilized to learn the knowledge of the global base and prevent overfitting of the model base. Empirical results demonstrate that the proposed method achieves competitive performance across various benchmarks, outperforming the majority of state-of-the-art PFL algorithms. The source code is publicly available at \href{https://***/xiaye-maker/FedMCA}{https://***/xiaye-maker/FedMCA} © 2024, The Authors. All rights reserved.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

Federated Causally Invariant Feature Learning 39

Federated Causally Invariant Feature Learning

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Guo, Xianjie Yu, Kui Cui, Lizhen Yu, Han Li, Xiaoxiao School of Computer Science and Information Engineering Hefei University of Technology China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education China School of Software Shandong University China College of Computing and Data Science Nanyang Technological University Singapore Department of Electrical and Computer Engineering The University of British Columbia Canada Vector Institute Canada

ISBN: (纸本)157735897X

Federated feature selection (FFS) is a promising field for selecting informative features while preserving data privacy in federated learning (FL) settings. Existing FFS methods focus on capturing the correlations between features and labels. They struggle to achieve satisfactory performance in the face of data distribution heterogeneity among FL clients, and cannot address the out-of-distribution (OOD) problem that arises when a significant portion of clients do not actively participate in FL training. To address these limitations, we propose Federated Causally Invariant Feature Learning (FedCIFL), a novel approach for learning causally invariant features in a privacy-preserving manner. We design a sample reweighting strategy to eliminate spurious correlations introduced by selection bias and iteratively estimate the federated causal effect between each feature and the labels (with the remaining features initially treated as confounders). By iteratively refining the confounding feature set to identify the true confounders, FedCIFL mitigates the impact of limited local data on the accuracy of federated causal effect estimation. Theoretical analysis proves the correctness of FedCIFL under reasonable assumptions. Extensive experiments on synthetic and real-world datasets demonstrate the superiority of FedCIFL against eight state-of-the-art baselines, beating the best-performing approach by 3.19%, 9.07% and 2.65% in terms of average test Accuracy, RMSE and F1 score, respectively. It is a first-of-its-kind FFS approach capable of handling Non-IID and OOD data simultaneously. The source code is available at https://***/Xianjie-Guo/FedCIFL. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Competitive and Cooperative Computation Offloading for Intensive Heterogeneous Tasks in Vehicular Edge Computing Networks

Competitive and Cooperative Computation Offloading for Inten...

引用

IEEE International Conference on Communications (ICC)

作者： Yuan Chen Xiuhua Li Guozeng Xu Ling Liu Xiaofei Wang Victor C. M. Leung School of Big Data & Software Engineering Chongqing University Chongqing China TKLAN College of Intelligence & Computing Tianjin University Tianjin China College of Computer Science & Software Engineering Shenzhen University Shenzhen China Department of Electrical & Computer Engineering The University of British Columbia Vancouver Canada

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Computation offloading is widely used in vehicular edge computing (VEC) networks to satisfy the computational intensity and latency sensitivity requirements. However, many existing offloading algorithms do not comprehensively consider the dynamically changing characteristics of heterogeneous tasks within a roadside unit (RSU), resulting in tasks timeout and being dropped. In this paper, we design a competitive and cooperative computation offloading (C3O) model to reduce task execution latency. Specifically, when intensive heterogeneous tasks are generated, these vehicles jointly compete for the computing resource of a RSU, or they can also offload tasks to the task vehicle (TaV) with free computing resource. Meanwhile, We analyze the latency model of local execution and offloading to RSU or TaV execution and formulate a sequential task offloading decision problem, NP-hard. To address it, we propose a multi-agent reinforcement learning algorithm based on C3O (MARC3O) to intelligently determine the computation offloading policy for each vehicle according to the state of VEC networks. Simulation results demonstrate that the proposed algorithm can significantly reduce task execution latency and improve task completion rates compared with baseline schemes.

关键词： Analytical models Sensitivity Costs Computational modeling Simulation Heuristic algorithms Collaboration

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Deep Reinforcement Learning for Computation Offloading in Multi-IRS Assisted Mobile Edge Computing Networks

Multi-Agent Deep Reinforcement Learning for Computation Offl...

引用

IEEE Conference on Wireless Communications and Networking

作者： Lingxiao Chen Xiuhua Li Chuan Sun Qilin Fan Xiaofei Wang Victor C. M. Leung School of Big Data & Software Engineering Chongqing University Chongqing China TKLAN College of Intelligence & Computing Tianjin University Tianjin China College of Computer Science & Software Engineering Shenzhen University Shenzhen China Department of Electrical & Computer Engineering The University of British Columbia Vancouver Canada

ISBN: (数字)9798350303582

ISBN: (纸本)9798350303599

Mobile edge computing (MEC) as a potential technology can offload tasks from user devices (UDs) to network edges to alleviate network congestion and reduce task execution delay. However, computation offloading faces two challenges: 1) Poor wireless channel quality causes high transmission delay; 2) Computing tasks may be obtained by eavesdroppers (Eves) during task offloading. Therefore, we consider deploying intel-ligent reflecting surface (IRS) in MEC networks to increase data transmission rate and ensure data transmission security. This paper investigates the issue of joint computation offloading and resource allocation in a multi-IRS assisted MEC network. Our goal is to minimize task execution delay. To address this problem, we propose a multi-agent deep deterministic policy gradient algorithm to determine the optimal offloading strategy for each UD. Simulation results show that the proposed algorithm can significantly reduce task execution delay and ensure data transmission security.

关键词： Wireless communication Multi-access edge computing Simulation Delays data communication Security Resource management

来源：评论

学校读者我要写书评

暂无评论

Digital Evidence and Forensic Tools in Cyber Law: A Comprehensive Analysis

Digital Evidence and Forensic Tools in Cyber Law: A Comprehe...

引用

Information Technology (ACIT)

作者： Ala’A Saeb Al-Sherideh Samah Suleiman Al-Zou’Bi Fuad Alshraiedeh Esraa Abu Elsoud Suha Afaneh Mohammad Rasmi Al-Mousa Raed Alazaidah Mohammed Khouj Ghassan Samara Department of Cybersecurity Zarqa University Zarqa Jordan Department of Software Engineering Zarqa University Zarqa Jordan Department of Computer Science Zarqa University Zarqa Jordan Department of Data Science and AI Zarqa University Zarqa Jordan Department of Electrical Engineering University of Business and Technology Jeddah Saudi Arabia

ISBN: (数字)9798331540012

ISBN: (纸本)9798331540029

The exponential rise in hacking, phishing, information theft, and electronic crime has become an actual concern with the increased use of digital devices and technology. By 2023 the number of IoT devices expectation will be 32.1 billion devices, leading to a significant increase in cybercrimes. These illegal behaviors are specifically connected to computers and communication technology. Consequently, there has been an urgent need for the development of cyber law which is a legal system closely related to digital evidence. This paper aim to provides delve into the significance and multifaceted applications of digital evidence within the context of cyber law, shedding light on the complexities and nuances inherent in its acceptance and reliability. The paper explores the importance and numerous uses of digital evidence in the context of cyber law, highlighting the challenges associated with its legitimacy and acceptance. Additionally, it focuses on the challenges that prevent digital evidence from being seamlessly incorporated into court processes and offers solutions and strategic advice to overcome these challenges.

关键词： Computers Phishing Digital forensics Personal digital devices Communications technology Reliability Internet of Things Computer crime Information technology Faces

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Client Sampling for Federated Learning in Heterogeneous Mobile Edge Computing Networks

Energy-Efficient Client Sampling for Federated Learning in H...

引用

IEEE International Conference on Communications (ICC)

作者： Jian Tang Xiuhua Li Hui Li Min Xiong Xiaofei Wang Victor C. M. Leung School of Big Data & Software Engineering Chongqing University Chongqing China TKLAN College of Intelligence & Computing Tianjin University Tianjin China College of Computer Science & Software Engineering Shenzhen University Shenzhen China Department of Electrical & Computer Engineering The University of British Columbia Vancouver Canada

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

To address network congestion and data privacy concerns, federated learning (FL) that combines multiple clients and a parameter server has been widely used in mobile edge computing (MEC) networks to process the abundant data generated by mobile clients. However, the existing client sampling methods do not adequately consider the data heterogeneity and system heterogeneity. Parameter server selects inappropriate clients to participate in the FL training process. This inevitably leads to slower convergence of the global model and higher energy consumption. In this paper, we design a client sampling model with the goal of selecting suitable clients to improve the energy efficiency of FL in heterogeneous MEC networks. Then we propose an energy-efficient client sampling strategy by quantifying the communication capability, computation capability and data quality of clients. Based on the quantization results, clients are assigned with a corresponding sampled probability. Simulation results show that our proposed strategy can effectively accelerate the convergence of the global model and reduce the energy consumption compared with the baseline schemes.

关键词： Training Energy consumption Multi-access edge computing Federated learning Computational modeling Simulation Sampling methods

来源：评论

学校读者我要写书评

暂无评论

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning 24

Towards High-resolution 3D Anomaly Detection via Group-Level...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (纸本)9798400706868

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3D-AD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Kaijun Deng Dezhi Zheng Jindong Xie Jinbao Wang Weicheng Xie Linlin Shen Siyang Song Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Department of Computer Science University of Exeter

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code is available at https://***/CVI-SZU/DEGSTalk.

关键词： Hair Training Three-dimensional displays Dynamics Signal processing Rendering (computer graphics) Noise measurement Speech processing Faces Videos

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：