scholarly journals A Movie Recommendation System Based on Differential Privacy Protection

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Min Li ◽  
Yingming Zeng ◽  
Yue Guo ◽  
Yun Guo

In the past decades, the ever-increasing popularity of the Internet has led to an explosive growth of information, which has consequently led to the emergence of recommendation systems. A series of cloud-based encryption measures have been adopted in the current recommendation systems to protect users’ privacy. However, there are still many other privacy attacks on the local devices. Therefore, this paper studies the encryption interference of applying a differential privacy protection scheme on the data in the user’s local devices under the assumption of an untrusted server. A dynamic privacy budget allocation method is proposed based on a localized differential privacy protection scheme while taking the specific application scene of movie recommendation into consideration. What is more, an improved user-based collaborative filtering algorithm, which adopts a matrix-based similarity calculation method instead of the traditional vector-based method when computing the user similarity, is proposed. Finally, it was proved by experimental results that the differential privacy-based movie recommendation system (DP-MRE) proposed in this paper could not only protect the privacy of users but also ensure the accuracy of recommendations.

2019 ◽  
Vol 8 (4) ◽  
pp. 10544-10551

Recommender System is the effective tools that are accomplished of recommending the future preference of a set of products to the consumer and to predict the most likelihood items. Today, customers has the ability to purchase or sell different items with advancement of e-commerce website, nevertheless it made complicate to investigate the majority of appropriate items suitable for the interest of the consumer from many items. Due to this scenario, recommender systems that can recommend items appropriate for user's interest and likings have become mandatory. In recent days, various recommendation methods are applied to resolve the data abundance setback in numerous application areas like movie recommendation, e-commerce, news recommendation, song recommendation and social media. Even if all the available current recommender systems are successful in generating reasonable predictions, these recommendation system still facing the issues like accuracy, cold-start, sparsity and scalability problem. Deep learning, the recently developed sub domain of machine learning technique is utilized in recommendation systems to enhance the feature of predicted output. Deep Learning is used to generate recommendations and the research challenges specific to recommendation systems when using Deep Learning are also presented. In this research, the basic terminologies, the fundamental concepts of Recommendation engine and a wide-ranging review of deep learning models utilized in Recommender Systems are presented.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Zhenning Yuan ◽  
Jong Han Lee ◽  
Sai Zhang

Aiming at the problem that the single model of the traditional recommendation system cannot accurately capture user preferences, this paper proposes a hybrid movie recommendation system and optimization method based on weighted classification and user collaborative filtering algorithm. The sparse linear model is used as the basic recommendation model, and the local recommendation model is trained based on user clustering, and the top-N personalized recommendation of movies is realized by fusion with the weighted classification model. According to the item category preference, the scoring matrix is converted into a low-dimensional, dense item category preference matrix, multiple cluster centers are obtained, the distance between the target user and each cluster center is calculated, and the target user is classified into the closest cluster. Finally, the collaborative filtering algorithm is used to predict the scores for the unrated items of the target user to form a recommendation list. The items are clustered through the item category preference, and the high-dimensional rating matrix is converted into a low-dimensional item category preference matrix, which further reduces the sparsity of the data. Experiments based on the Douban movie dataset verify that the recommendation algorithm proposed in this article solves the shortcomings of a single algorithm model to a certain extent and improves the recommendation effect.


2021 ◽  
Vol 17 (3) ◽  
pp. 85-100
Author(s):  
Jayaraman Parthasarathy ◽  
Ramesh Babu Kalivaradhan

Online collaborative movie recommendation systems attempt to help customers accessing their favourable movies by gathering exactly comparable neighbors between the movies from their chronological identical ratings. Collaborative filtering-based movie recommendation systems require viewer-specific data, and the need for collecting viewer-specific data diminishes the effectiveness of the recommendation. To solve this problem, the authors employ an effective multi-armed bandit called upper confidence bound, which is applied to automatically recommend the movies for the users. In addition, the concept of time decay is provided in a mathematical definition that redefines the dynamic item-to-item similarity. Then, two patterns of time decay are analyzed, namely concave and convex functions, for simulation. The experiment test the MovieLens 100K dataset. The proposed method attains a maximum F-measure of 98.45 whereas the existing method reaches a minimum F-measure of only 95.60. The presented model adaptively responds to new users, can provide a better service, and generate more user engagement.


2016 ◽  
Vol 71 (9-10) ◽  
pp. 465-475 ◽  
Author(s):  
Chi Lin ◽  
Pengyu Wang ◽  
Houbing Song ◽  
Yanhong Zhou ◽  
Qing Liu ◽  
...  

Author(s):  
A.Y. Zhubatkhan ◽  
Z.A. Buribayev ◽  
S.S. Aubakirov ◽  
M.D. Dilmagambetova ◽  
S.A. Ryskulbek

The trend of the Internet makes the presentation of the right content for the right user inevitable. To this end, recommendation systems are used in areas such as music, books, movies, travel planning, e-commerce, education, and more. One of the most popular recommendation systems in the world is Netflix, which generated record profits during quarantine in the first quartile of 2020. The systematic approach of recommendations is based on the history of user selections, likes and reviews, each of which is interpreted to predict future user selections. This article provides a meaningful analysis of various recommendation systems, such as content-based, collaborative filtering and popularity. We reviewed 7 articles published from 2005 to 2019 to discuss issues related to existing models. The purpose of this article is to compare machine learning algorithms in the Surprise library for a recommendation system. Recommendation system has been implemented and quality has been evaluated using the MAE and RMSE metrics.


2017 ◽  
Vol 44 (3) ◽  
pp. 331-344 ◽  
Author(s):  
Youdong Yun ◽  
Danial Hooshyar ◽  
Jaechoon Jo ◽  
Heuiseok Lim

The most commonly used algorithm in recommendation systems is collaborative filtering. However, despite its wide use, the prediction accuracy of this algorithm is unexceptional. Furthermore, whether quantitative data such as product rating or purchase history reflect users’ actual taste is questionable. In this article, we propose a method to utilise user review data extracted with opinion mining for product recommendation systems. To evaluate the proposed method, we perform product recommendation test on Amazon product data, with and without the additional opinion mining result on Amazon purchase review data. The performances of these two variants are compared by means of precision, recall, true positive recommendation (TPR) and false positive recommendation (FPR). In this comparison, a large improvement in prediction accuracy was observed when the opinion mining data were taken into account. Based on these results, we answer two main questions: ‘Why is collaborative filtering algorithm not effective?’ and ‘Do quantitative data such as product rating or purchase history reflect users’ actual tastes?’


Sign in / Sign up

Export Citation Format

Share Document