Federated Rough C-Means Clustering and Its Application to Collaborative Filtering
In clustering-based collaborative filtering (CF), clusters of users with similar preference patterns are extracted, and contents with high preference within the cluster are recommended. In rough clustering-based CF, improved recommendation performance can be expected by considering cluster overlap. However, in the conventional framework, learning is performed by aggregating data from all users on a server, which is undesirable from a privacy protection perspective. In this study, from the viewpoint of privacy protection, we propose federated RCM (F-RCM) clustering by introducing federated learning to rough C-means (RCM) clustering, a type of rough clustering. Furthermore, as an application to CF, we propose F-RCM-CF and verify its recommendation performance through numerical experiments using real-world datasets.
Authors
- Shuichiro Yamashita (ORCID: https://orcid.org/0000-0003-3259-4782)
- Katsuhiro Honda (ORCID: https://orcid.org/0000-0001-9080-5942)
- Seiki Ubukata (ORCID: https://orcid.org/0000-0002-5736-808X)
Institutions
- Osaka Metropolitan University (JP)
Publication Details
- Published
- 2024-09-20
- DOI
- https://doi.org/10.1109/icmlc63072.2024.10935097
- Primary Topic
- Data Mining Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00