KEYWORDS: Data modeling, Stochastic processes, Mathematical optimization, Data centers, Projection systems, Machine learning, Education and training, Deep learning, Data privacy, Data communications
Currently, recommender systems are widely applied in various fields. However, due to the limited needs and special circumstances of users to be recommended, it is difficult for a recommender system to cover all users' interest lists at the same time. In this work, we present a kind of optimized federated clustering scheme (OP-Fed-Clustering) for users' private tendency data. The scheme starts by coding the initial data objects to protect privacy and then optimizes the assignment of data points based on object similarity. We also validates the algorithm's effectiveness on the FoodRecipe dataset and compares the algorithm to initial K-FED. Our tentative data show that the effectiveness of the proposed OP-Fed-Clustering algorithm, demonstrating universally superior performance while preserving user data confidentiality.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.