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

A survey on cross-user federated recommendation

science China(Information sciences) 2025年第4期68卷 7-32页

作者： Enyue YANG Yudi XIONG Wei YUAN Weike PAN Qiang YANG Zhong MING College of Computer Science and Software Engineering Shenzhen University School of Electrical Engineering and Computer Science The University of Queensland WeBank AI Lab WeBank Department of Computer Science and Engineering Hong Kong University of Science and Technology College of Big Data and Internet Shenzhen Technology University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ)

Recommender systems are effective in mitigating information overload, yet the centralized storage of user data raises significant privacy concerns. Cross-user federated recommendation(CUFR) provides a promising distributed paradigm to address these concerns by enabling privacy-preserving recommendations directly on user devices. In this survey, we review and categorize current progress in CUFR, focusing on four key aspects: privacy, security, accuracy, and efficiency. Firstly,we conduct an in-depth privacy analysis, discuss various cases of privacy leakage, and then review recent methods for privacy protection. Secondly, we analyze security concerns and review recent methods for untargeted and targeted *** untargeted attack methods, we categorize them into data poisoning attack methods and parameter poisoning attack methods. For targeted attack methods, we categorize them into user-based methods and item-based methods. Thirdly,we provide an overview of the federated variants of some representative methods, and then review the recent methods for improving accuracy from two categories: data heterogeneity and high-order information. Fourthly, we review recent methods for improving training efficiency from two categories: client sampling and model compression. Finally, we conclude this survey and explore some potential future research topics in CUFR.

关键词： cross-user federated recommendation federated recommendation federated learning recommender systems user privacy

来源：评论

学校读者我要写书评

暂无评论

A Length-Adaptive Non-Dominated Sorting Genetic Algorithm for Bi-Objective High-Dimensional Feature Selection

引用

IEEE/CAA Journal of Automatica Sinica 2023年第9期10卷 1834-1844页

作者： Yanlu Gong Junhai Zhou Quanwang Wu MengChu Zhou Junhao Wen College of Computer Science Chongqing UniversityChongqing 400044China IEEE Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA College of Big Data and Software Engineering Chongqing UniversityChongqing 400044China

As a crucial data preprocessing method in data mining,feature selection(FS)can be regarded as a bi-objective optimization problem that aims to maximize classification accuracy and minimize the number of selected *** computing(EC)is promising for FS owing to its powerful search ***,in traditional EC-based methods,feature subsets are represented via a length-fixed individual *** is ineffective for high-dimensional data,because it results in a huge search space and prohibitive training *** work proposes a length-adaptive non-dominated sorting genetic algorithm(LA-NSGA)with a length-variable individual encoding and a length-adaptive evolution mechanism for bi-objective highdimensional *** LA-NSGA,an initialization method based on correlation and redundancy is devised to initialize individuals of diverse lengths,and a Pareto dominance-based length change operator is introduced to guide individuals to explore in promising search space ***,a dominance-based local search method is employed for further *** experimental results based on 12 high-dimensional gene datasets show that the Pareto front of feature subsets produced by LA-NSGA is superior to those of existing algorithms.

关键词： Bi-objective optimization feature selection(FS) genetic algorithm high-dimensional data length-adaptive

来源：评论

学校读者我要写书评

暂无评论

BGNN: Behavior-aware graph neural network for heterogeneous session-based recommendation

引用

Frontiers of computer science 2023年第5期17卷 103-118页

作者： Jinwei LUO Mingkai HE Weike PAN Zhong MING College of Computer Science and Software Engineering Shenzhen UniversityShenzhen 518060China National Engineering Laboratory for Big Data System Computing Technology Shenzhen UniversityShenzhen 518060China

Session-based recommendation(SBR)and multibehavior recommendation(MBR)are both important problems and have attracted the attention of many researchers and *** from SBR that solely uses one single type of behavior sequences and MBR that neglects sequential dynamics,heterogeneous SBR(HSBR)that exploits different types of behavioral information(e.g.,examinations like clicks or browses,purchases,adds-to-carts and adds-to-favorites)in sequences is more consistent with real-world recommendation scenarios,but it is rarely *** efforts towards HSBR focus on distinguishing different types of behaviors or exploiting homogeneous behavior transitions in a sequence with the same type of ***,all the existing solutions for HSBR do not exploit the rich heterogeneous behavior transitions in an explicit way and thus may fail to capture the semantic relations between different types of ***,all the existing solutions for HSBR do not model the rich heterogeneous behavior transitions in the form of graphs and thus may fail to capture the semantic relations between different types of *** limitation hinders the development of HSBR and results in unsatisfactory *** a response,we propose a novel behavior-aware graph neural network(BGNN)for *** BGNN adopts a dual-channel learning strategy for differentiated modeling of two different types of behavior sequences in a ***,our BGNN integrates the information of both homogeneous behavior transitions and heterogeneous behavior transitions in a unified *** then conduct extensive empirical studies on three real-world datasets,and find that our BGNN outperforms the best baseline by 21.87%,18.49%,and 37.16%on average correspondingly.A series of further experiments and visualization studies demonstrate the rationality and effectiveness of our *** exploratory study on extending our BGNN to handle more than two types of behaviors show that our BGNN can e

关键词： session-based recommendation graph neural network heterogeneous behaviors

来源：评论

学校读者我要写书评

暂无评论

Physical information-enhanced graph neural network for predicting phase separation

引用

Chinese Physics B 2024年第7期33卷 278-283页

作者：张亚强王煦文王雅楠郑文 Institute of Public-Safety and Big Data College of Computer Science and Technology(College of Data Science)Taiyuan University of TechnologyJinzhong 030600China Shanxi Engineering Research Centre for Intelligent Data Assisted Treatment Changzhi Medical CollegeChangzhi 046000China Innovation Academy for Microsatellites of Chinese Academy of Sciences Shanghai 200050China

Although phase separation is a ubiquitous phenomenon, the interactions between multiple components make it difficult to accurately model and predict. In recent years, machine learning has been widely used in physics simulations. Here,we present a physical information-enhanced graph neural network(PIENet) to simulate and predict the evolution of phase separation. The accuracy of our model in predicting particle positions is improved by 40.3% and 51.77% compared with CNN and SVM respectively. Moreover, we design an order parameter based on local density to measure the evolution of phase separation and analyze the systematic changes with different repulsion coefficients and different Schmidt *** results demonstrate that our model can achieve long-term accurate predictions of order parameters without requiring complex handcrafted features. These results prove that graph neural networks can become new tools and methods for predicting the structure and properties of complex physical systems.

关键词： graph neural network phase separation machine learning dissipative particle dynamics

来源：评论

学校读者我要写书评

暂无评论

Dual-Enhanced High-Order Self-Learning Tensor Singular Value Decomposition for Robust Principal Component Analysis

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3564-3578页

作者： Xu, Honghui Fang, Chuangjie Wang, Renfang Chen, Shengyong Zheng, Jianwei Zhejiang University of Technology College of Computer Science and Technology Hangzhou310023 China Zhejiang Wanli University College of Big Data and Software Engineering Ningbo315200 China Tianjin University of Technology College of Computer Sciences and Engineering Tianjin300384 China

Recently, tensor singular value decomposition (TSVD) within high-order (Ho) algebra framework has shed new light on tensor robust principal component analysis (TRPCA) problem. However, HoTSVD lacks flexibility in handling the hidden correlations along different modes of large-scale multidimensional data. Moreover, the utilization of fixed or data-independent transformations in HoTSVD may result in suboptimality. For a relief, we propose a dual-enhanced self-learning TSVD along all modes to address computational flaws and learn a lossless transformation that induces a lower average-rank tensor. Specifically, we multiply the learnable semiorthogonal matrices obtained through Tucker compression with the original tensor along all modes, thus obtaining a core tensor with more inherent low rankness. Building upon this foundation, a new TNN is introduced by generalizing HoTSVD to Mode-k TSVD, followed by the facilitation to the core tensor, achieving dual-enhancement. Moreover, a reweighting scheme is imposed on the Mode-k HoTSVD to learn the global low-rank correlation and provide an efficient numerical solution. Finally, an alternating direction method of multipliers (ADMM)-based algorithm is developed as a solver. Experimental results on several types of multidimensional visual data, including light field images (LFI) and color videos, demonstrate the superiority of the proposal over previous state-of-the-art methods. © 2020 IEEE.

关键词： Discrete Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Group Signature with Time-Bound Keys for Secure E-health Record Sharing

Group Signature with Time-Bound Keys for Secure E-health Rec...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Lu, Junze Hu, Chunqiang Ruan, Conghao Cai, Bin Xiang, Tao Chongqing University School of Big Data & Software Engineering China Chongqing University College of Computer Science China

ISBN: (纸本)9798350386226

With the advent of various mobile IoT devices, a large amount of e-health record (EHR) data has been generated. This data has great potential to improve medical research. However, there are many challenges regarding the sharing of medical data. Firstly, users are more inclined to interact anonymously. Secondly, verifying the validity of certificates in the case of anonymous interactions is challenging. In addition, it is necessary to uncover the identities of the actual interacting parties in the event of malicious behavior. Therefore, we address the above challenges and propose group signatures with time constraints to support anonymous and traceable EHR data sharing. First, we propose a group signature scheme that supports traceability. Second, to address the issue of validating anonymous certificates, we propose group signatures with time constraints that enable dynamic updates to validity. Through this, we can dynamically revoke group members. Lastly, security proofs and efficiency analyses demonstrate that our scheme is both secure and efficient. © 2024 IEEE.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

A sharding blockchain-based UAV system for search and rescue missions

引用

Frontiers of computer science 2025年第3期19卷 103-118页

作者： Xihan ZHANG Jiashuo ZHANG Jianbo GAO Libin XIA Zhi GUAN Hao HU Zhong CHEN School of Computer Science Peking UniversityBeijing 100871China Peking University Chongqing Research Institute of Big Data Chongqing 401329China National Engineering Research Center for Software Engineering Peking UniversityBeijing 100871China State Key Lab for Novel Software Technology Nanjing UniversityNanjing 210023China

Sharding is a promising technique to tackle the critical weakness of scalability in blockchain-based unmanned aerial vehicle(UAV)search and rescue(SAR)*** breaking up the blockchain network into smaller partitions called shards that run independently and in parallel,shardingbased UAV systems can support a large number of search and rescue UAVs with improved scalability,thereby enhancing the rescue ***,the lack of adaptability and interoperability still hinder the application of sharded blockchain in UAV SAR *** refers to making adjustments to the blockchain towards real-time surrounding situations,while interoperability refers to making cross-shard interactions at the mission *** address the above challenges,we propose a blockchain UAV system for SAR missions based on dynamic sharding *** from the benefits in scalability brought by sharding,our system improves adaptability by dynamically creating configurable and mission-exclusive shards,and improves interoperability by supporting calls between smart contracts that are deployed on different *** implement a prototype of our system based on Quorum,give an analysis of the improved adaptability and interoperability,and conduct experiments to evaluate the *** results show our system can achieve the above goals and overcome the weakness of blockchain-based UAV systems in SAR scenarios.

关键词： blockchain sharding unmanned aerial vehicle search and rescue blockchain interoperability

来源：评论

学校读者我要写书评

暂无评论

Monte Carlo Simulation-Based Robust Workflow Scheduling for Spot Instances in Cloud Environments

引用

Tsinghua science and Technology 2024年第1期29卷 112-126页

作者： Quanwang Wu Jianzhao Fang Jie Zeng Junhao Wen Fengji Luo College of Computer Science Chongqing UniversityChongqing 400044China National Experimental Teaching Demonstration Center Chongqing UniversityChongqing 400044China College of Big Data and Software Engineering Chongqing UniversityChongqing 400044China School of Civil Engineering The University of SydneySydney 2006Australia

When deploying workflows in cloud environments,the use of Spot Instances(SIs)is intriguing as they are much cheaper than on-demand ***,Sls are volatile and may be revoked at any time,which results in a more challenging scheduling problem involving execution interruption and hence hinders the successful handling of conventional cloud workflow scheduling *** some scheduling methods for Sls have been proposed,most of them are no more applicable to the latest Sls,as they have evolved by eliminating bidding and simplifying the pricing *** study focuses on how to minimize the execution cost with a deadline constraint when deploying a workflow on volatile Sls in cloud *** on Monte Carlo simulation and list scheduling,a stochastic scheduling method called MCLS is devised to optimize a utility function introduced for this *** the Monte Carlo simulation framework,MCLS employs sampled task execution time to build solutions via deadline distribution and list scheduling,and then returns the most robust solution from all the candidates with a specific evaluation mechanism and selection *** results show that the performance of MCLS is more competitive comparedwithtraditionalalgorithms.

关键词： constrained optimization Monte Carlo simulation robustness Spot Instances(Sls) workflow scheduling

来源：评论

学校读者我要写书评

暂无评论

Efficiency-optimized 6G:A virtual network resource orchestration strategy by enhanced particle swarm optimization

引用

Digital Communications and Networks 2024年第5期10卷 1221-1233页

作者： Sai Zou Junrui Wu Haisheng Yu Wenyong Wang Lisheng Huang Wei Ni Yan Liu College of Big Data and Information Engineering Guizhou UniversityGuiyangChina Prospective Technology Lab of the China Future Internet Engineering Center BeijingChina College of Computer Science and Engineering University of Electronic Science and TechnologyChengduChina International Institute for Next Generation Internet Macao University of Science and TechnologyMacaoChina Data61 Business Unit CSIROAustralia

The future Sixth-Generation (6G) wireless systems are expected to encounter emerging services with diverserequirements. In this paper, 6G network resource orchestration is optimized to support customized networkslicing of services, and place network functions generated by heterogeneous devices into available *** is a combinatorial optimization problem that is solved by developing a Particle Swarm Optimization (PSO)based scheduling strategy with enhanced inertia weight, particle variation, and nonlinear learning factor, therebybalancing the local and global solutions and improving the convergence speed to globally near-optimal *** show that the method improves the convergence speed and the utilization of network resourcescompared with other variants of PSO.

关键词： Virtualization Network function orchestration Network resource virtualized orchestration (NRVO) Particle swarm optimization(PSO)

来源：评论

学校读者我要写书评

暂无评论

A Reduced State Space Generation Method for Concurrent Systems Based on CPN-PR Model

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2024年第6期44卷 2328-2342页

作者： Zhong, Wenjie Sun, Tao Zhou, Jian-Tao Wang, Zhuowei Song, Xiaoyu Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Hohhot010000 China Guangdong University of Technology School of Computer Science and Technology Guangzhou China Portland State University Department of Electrical and Computer Engineering PortlandOR97207 United States

Colored Petri Nets (CPNs) provide descriptions of the concurrent behaviors for software and hardware. Model checking based on CPNs is an effective method to simulate and verify the concurrent behavior in system design. However, the model checking method traverses the full state space, which suffers from the state space explosion problem. A reduced state space generation method related to the property of concurrent systems is proposed. Specifically, we extend CPNs to define a property-related model (CPN-PR) and give a property-related analysis method whose results can be used to generate the CPN-PR model. A reduced state space generation method is developed based on enabled binding element filtering rules. The stutter trace equivalence between the state spaces of CPN and CPN-PR has been proven by showing that the reduced state space may not change the model checking result. A comparison experiment is conducted to demonstrate the effectiveness of our method. © 1982-2012 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：