REVIEW 1 cited by
Shared MF: A privacy-preserving recommendation system
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Matrix factorization is one of the most commonly used technologies in recommendation system. With the promotion of recommendation system in e-commerce shopping, online video and other aspects, distributed recommendation system has been widely promoted, and the privacy problem of multi-source data becomes more and more important. Based on Federated learning technology, this paper proposes a shared matrix factorization scheme called SharedMF. Firstly, a distributed recommendation system is built, and then secret sharing technology is used to protect the privacy of local data. Experimental results show that compared with the existing homomorphic encryption methods, our method can have faster execution speed without privacy disclosure, and can better adapt to recommendation scenarios with large amount of data.
Forward citations
Cited by 1 Pith paper
-
Far From Sight, Far From Mind: Inverse Distance Weighting for Graph Federated Recommendation
Dist-FedAvg weights user-embedding updates by inverse Minkowski distance and interpolates with the anchor embedding, showing mixed gains over standard aggregation rules.
Discussion (0). Continue with ORCID to comment.