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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Federated Rough C-Means Clustering and Its Application to Collaborative Filtering

Shuichiro Yamashita, Katsuhiro Honda, Seiki Ubukata
Data Mining Algorithms and Applications
article

Federated Rough C-Means Clustering and Its Application to Collaborative Filtering

Shuichiro Yamashita, Katsuhiro Honda, Seiki Ubukata
article en

Abstract

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.

Osaka Metropolitan University (JP)
Openalex Percentile: Top 54%
Data Mining Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.