A federated recommendation algorithm based on user clustering and meta-learning

计算机科学 聚类分析 元学习(计算机科学) 联合学习 推荐系统 双聚类 人工智能 数据挖掘 机器学习 相关聚类 CURE数据聚类算法 管理 经济 任务(项目管理)
作者
Enqi Yu,Zhiwei Ye,Zhiqiang Zhang,Ling Qian,Meiyi Xie
出处
期刊:Applied Soft Computing [Elsevier BV]
卷期号:158: 111483-111483 被引量:19
标识
DOI:10.1016/j.asoc.2024.111483
摘要

Federated recommendation is a typical application of federated learning, which can protect the privacy of users by exchanging models between users' devices and central servers rather than users' raw data. Recently, although some research in federated recommendation has made remarkable progress, there are still two major issues need to be addressed further due to the non-independent and identical distribution (Non-IID) data which is very common in federal recommendation systems. First, the communication load of the user device during training is heavy. Second, the trained local model lacks personalization. Aiming at the above problems, a federated recommendation algorithm based on user clustering and meta-learning, ClusterFedMet, is proposed to improve communication efficiency and recommendation personalization simultaneously. In ClusterFedMet, users are clustered into different clusters according to their data distribution, and user sampling are performed based on the clustering result, thus reduce harmful interference among users with different data distribution. The model is trained with meta-learning, which can generate more personalized local models. During meta-learning, a controller which can dynamically tune the hyperparameters for users is designed to achieve better performance. According to weights, gradients, and losses of each step, the controller can find a learning rate suitable for each user's local data and model. We perform evaluations for the proposed algorithm on two public datasets, and the results demonstrate that our algorithm outperforms other advanced methods in terms of recommendation accuracy and communication efficiency.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
深情安青应助淡定的汉堡采纳,获得10
1秒前
1秒前
1秒前
1秒前
1秒前
字节完成签到,获得积分10
2秒前
2秒前
烂漫的洋葱完成签到,获得积分10
2秒前
巨大蟑螂觅食中完成签到,获得积分10
2秒前
悦耳的蜗牛完成签到 ,获得积分10
3秒前
NexusExplorer应助墨菲特采纳,获得10
3秒前
4秒前
今天只想看文献完成签到,获得积分10
4秒前
5秒前
lyb完成签到 ,获得积分10
5秒前
5秒前
6秒前
fangze发布了新的文献求助10
7秒前
木刻青、发布了新的文献求助10
7秒前
逆光发布了新的社区帖子
7秒前
完美世界应助王燕峰采纳,获得10
7秒前
Silence发布了新的文献求助200
8秒前
8秒前
碎觉觉应助字节采纳,获得10
8秒前
9秒前
orixero应助Carrey采纳,获得10
9秒前
Qin发布了新的文献求助10
10秒前
杭啊发布了新的文献求助10
10秒前
zz发布了新的文献求助10
11秒前
jojo发布了新的文献求助10
13秒前
14秒前
小蘑菇应助fangze采纳,获得10
14秒前
自由之丘完成签到,获得积分10
14秒前
行走的猫完成签到 ,获得积分10
15秒前
研友_LJGmvn完成签到,获得积分10
16秒前
王晓朋完成签到,获得积分10
16秒前
17秒前
17秒前
默岩1990发布了新的文献求助10
17秒前
王慧完成签到,获得积分10
18秒前
高分求助中
Signals, Systems, and Signal Processing 610
Annie Ernaux: De la perte au corps glorieux 600
Petrology and Plate Tectonics,2025 500
Circular Polar Constellations Providing Continuous Single or Multiple Coverage Above a Specified Latitude 400
Burger's Medicinal Chemistry and Drug Discovery 400
Probability and Stochastic Processes 333
New directions for experimental lessons in science teaching: Myth, Mystery, Necessity? by Emily K. da Silva Cunha Souto (Author), Flávia Lins Silva (Author) 333
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6744310
求助须知:如何正确求助?哪些是违规求助? 8475148
关于积分的说明 18077581
捐赠科研通 6015396
什么是DOI,文献DOI怎么找? 3004492
邀请新用户注册赠送积分活动 1981112
关于科研通互助平台的介绍 1946804