2023
DOI: 10.1109/tbdata.2021.3139125
|View full text |Cite
|
Sign up to set email alerts
|

A Lightweight Matrix Factorization for Recommendation With Local Differential Privacy in Big Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…The technique involves decomposing a matrix of user-item interactions into lower-dimensional matrices, and then using those matrices to predict missing entries and recommend new items. For example, in [104], the authors propose a lightweight matrix factorisation algorithm that reduces the number of parameters required for training, while maintaining the accuracy of the recommendations.…”
Section: Ai Techniques For the Ux Of Recommender Systemsmentioning
confidence: 99%
“…The technique involves decomposing a matrix of user-item interactions into lower-dimensional matrices, and then using those matrices to predict missing entries and recommend new items. For example, in [104], the authors propose a lightweight matrix factorisation algorithm that reduces the number of parameters required for training, while maintaining the accuracy of the recommendations.…”
Section: Ai Techniques For the Ux Of Recommender Systemsmentioning
confidence: 99%
“…In addition, data present in the health care database increases endlessly and intruders have high chance in extracting the information. In recent era, differential privacy (DP) [18] has attracted the researchers a lot by introducing k-anonymity and l-diversity and providing high data securing in data mining.…”
Section: Introductionmentioning
confidence: 99%