See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/344633647

Various Techniques for Movie Recommendation System

Article · October 2020

CITATIONS READS

0 406

2 authors, including:

Naveen Kumari
Punjabi University, Patiala
26 PUBLICATIONS   28 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Comparison between artificial View project

Study of various multi keyword search in cloud computing View project

All content following this page was uploaded by Naveen Kumari on 13 October 2020.

The user has requested enhancement of the downloaded file.

Journal of Interdisciplinary Cycle Research
Movie Recommendation System
2 Author(s): Yogesh Kumar, Ms. Naveen Kumari
Guide Name: Ms. Naveen Kumari (Astt. Prof.)
yogi.peshlo@gmail.com
naveencse2k4@gmail.com
Punjabi University Regional Centre for IT & Management, Mohali
Abstract— The recommendation system plays an essential
role in the modern era and used by many prestigious
applications. The recommendation system has made the
collection of apps, creating a global village, and growth
for abundant information. This paper represents the
overview of Approaches and techniques generated in the
Collaborative Filtering based recommendation system [1].
The recommendation system derived into Collaborative
Filtering, Content-based, and hybrid-based approaches.
This paper classifies collaborative filtering using various
approaches like matrix factorization, user-based
recommendation, item-based recommendation. This
survey also tells the road map for research in this area. We
extract aspect-based specific ratings from reviews and also
recommend reviews to users depends on user similarity
and their rating patterns. Finally, validating the proposed
movie recommendation system for various evaluation
criteria, and also the proposed system shows better result
than conventional systems.
Keywords: kNN, Sentiment Analysis, Opinion Mining,
Product Review
I. RECOMMENDATION SYSTEM
Recommender systems are more popular and increase the
production costs for many service providers. Today the
world is an over-crowded so that the recommendations are
required for recommending products or services. However
recommender systems minimize the transaction costs and
improves the quality and decision making process to users
[1], [5], [6]. It is applied in various neighboring areas like
information retrieval or human computer interaction (HCI).
It gathers huge amount of information about user’s
preferences of several items like online shopping products,
movies, taxi, TV, tourism, restaurants, etc. It stores
information of different ways either positive or negative
manner. It captures users review for watched movies,
traveled places, and purchased products. When compare
demand from the shopping products, service providers
(travel, and restaurants), movie recommendation system
design a big problem since other recommendation systems
require fast computation and processing service from
service providers and product distributors. To recommend
movies, first collects the ratings for users and then
recommend the top list of items to the target user [2]. In
addition to this, users can check reviews of other users
Volume XII, Issue IX, September/2020
ISSN NO: 0022-1945
before watching movie. A different recommendation
schemes have been presented includes collaborative
filtering, content-based recommender system, and hybrid
recommender system. However, several issues are raised
with users posted reviews.
II. RELATED WORK
Zhang, R. et. al. [1] presented a new model family
termed Markovian factorization of matrix process (MFMP).
On one hand, MFMP models, such as timeSVD++, are
capable of capturing the temporal dynamics in the dataset,
and on the other hand, they also have clean probabilistic
formulations, allowing them to adapt to a wide spectrum of
collaborative filtering problems. Two simple example
models in this family are introduced for the prediction of
movie ratings using time-stamped rating data. The
experimental study using MovieLens dataset demonstrates
that the two models, although simple and primitive, already
have comparable or even better performance than
timeSVD++ and a standard tensor factorization model.
Zhang, J.; et al. [2] proposedhigh-efficient
recommendation algorithm, which exploits users’ profile
attributes to partition them into several clusters. For each
cluster, a virtual opinion leader is conceived to represent the
whole cluster, such that the dimension of the original
useritem matrix can be significantly reduced, then a
Weighted Slope One-VU method is designed and applied to
the virtual opinion leader-item matrix to obtain the
recommendation results. Compared to traditional
clusteringbased CF recommendation schemes, our method
can significantly reduce the time complexity, while
achieving comparable recommendation performance.
Furthermore, we have constructed a real personalized web-
based movie recommendation system, MovieWatch, opened
it to the public, collected user feedback on
recommendations, and evaluated the feasibility and
accuracy of our system based on this real-world data
Haruna, K. et. al. [3] derived an alternative method
based on the concept of co-occurrence from multi-soft sets
to handle conflict situations and first used an illustrative
example of a movie selection problem to demonstrate the
proposed approach and provide an extensive elaboration
using a publicly available dataset and provided a new
measure based on support, strength, certainty and coverage
of soft set on movie selection problem and findings have
Page No:847
Journal of Interdisciplinary Cycle Research
revealed that the proposed approach achieved less
computational time when compared with the rough set-
based approach of up to 8.05%.
Kalra, N.et al. [4] proposed a technique using trust
factor extracted with help of ratings given so that quality
can be improved and better predictions can be done. A
novel-technique has been proposed for recommender system
using film-trust dataset and its effectiveness has been
justified with the help of experiments. Traditional
recommender systems consider that all the users are
independent and identical, its an assumption which leads to
a total ignorance of social interactions and trust among user.
Trust relation among users ease the work of recommender
systems to produce better quality of recommendations.
Pavithra, M. et al. [5] designed and implement a movie
recommendation system. There are different genres, cultures
and languages to choose from in the world of movies. Such
a system can suggest a set of movies to users based on their
interest, or the popularities of the movies. On an average of
one year movie survey 600 movies are released in
Hollywood. For streaming movie services like Netflix,
recommendation systems are essential for helping users find
new movies to enjoy. So far, a decent number of works has
been done in this field. But there is always room for
renovation.
Nagamanjula, R. and Pethalakshmi, A. [6] proposed a
movie recommender system based on new user similarity
metric and opinion mining. The primary objective of this
paper is to find the type of opinions (positive, negative or
neutral) for movies and also suggest top-k recommendation
list for users and extract aspect-based specific ratings from
reviews and also recommend reviews to users depends on
user similarity and their rating patterns. Finally, validating
the proposed movie recommendation system for various
evaluation criteria, and also the proposed system shows
better result than conventional systems
Mhetre, R. et al. [7] focused on movie recommendation
and the technique currently present for this is the
collaborative filtering technique. Of the collaborative
filtering techniques, the matrix factorization algorithms
namely Alternative Least Square and Singular Value
Decomposition are implemented to predict or recommend
the movies. Further to improve the processing and time
computation for a large dataset we have used Apache Spark
along with Elastic search and the accuracy is compared
between the two algorithms for different values of testing
subsets.
Xi, W. et al. [8] proposed a novel recommendation
algorithm based on Back Propagation (BP) neural network
with Attention Mechanism (BPAM). In particular, the BP
neural network is utilized to learn the complex relationship
of the target users and their neighbors. Compared with deep
neural network, the shallow neural network, i.e., BP neural
network, can not only reduce the computational and storage
costs, but also prevent the model from over-fitting. In
addition, an attention mechanism is designed to capture the
global impact on all nearest target users for each user.
Volume XII, Issue IX, September/2020
ISSN NO: 0022-1945
Shaik, I. et al. [9] focused on K-means clustering
algorithm by analyzing the E-commerce big data. In this
research, geographical location and unique identification
number of the customer are considered as constraints for
clustering. Mining such data is a challenging task. One of
the important tasks of mining is to group similar objects or
similar data into cluster which is very much useful for
analysis and prediction. K-means clustering method is a
popular partition based approach for clustering data as it
leads to good quality of results.
Mehra, J.; and Thakur, R.S.; [10] defined that clustering
is one of the most important tasks in the active areas of Web
Usage Knowledge Discovery. It assures to handle the
difficulty of information overload on the Internet while
many users are connected on the social media. Clustering is
utilized for grouping information into comparative access
design for discovering client interest. There are two
drawbacks of FCM algorithm, firstly the requirements of no.
of clusters c and secondly assigning the primary relationship
matrix. Due to these two drawbacks the FCM algorithm is
hard to decide about the suitable no. of cluster and this
algorithm is insecure. The determination of desirable
preliminary cluster is an important problem, therefore a new
technique called PDFCM algorithm is described.
III. PROPOSED WORK
Start Input data set Pre-Process data set. i.e. remove
unnecessary data Extract features of input data set Use
preference region or input text Apply fitness function as
given in eq 1 Calculate best weight according to eq 1 Apply
improved kNN[15] classification
Apply proposed classification Generate and proposed results
End
Start
Input data set
Pre-Process data set. i.e. remove unnecessary data
Extract features of input data set
Use preference region or input text
Apply fitness function as given in eq 1
Calculate best weight according to eq 1
Apply improved kNN[25] classification
Apply proposed classification
Generate and proposed results
End
Page No:848
Journal of Interdisciplinary Cycle Research ISSN NO: 0022-1945

Fig 2: Flow Chart of positive outcomes that ought to have been returned. The
Step1. Initialization: run pre-determined generations kNN F1 score can be deciphered as a weighted normal of the
to generate initial population; exactness and review, where a F1 score achieves its best an
Step2. Parameter input: ask the DM to input his/her incentive even from a pessimistic standpoint at 0
preference information; F = 1/((a)(1/P) + (1-a)(1/R))
Step3. Determining reference region: Performance Evaluation on the basis of parameters for
Step4. Updating: update the population in the preference an Existing Technique
region by MOEA/D-DE until the stopping criterion is meet; TP FP Precisio Recall F- ROC
Step5. Interaction: If the DM is not satisfied with Rate Rate n Measure Area
reference information, go to Step2 to reset the reference
information; If the DM wants to get better results in this 0.45 0.009 0.902 0.45 0.621 0.888
reference region, go to Step4; otherwise, output the results.
1 0.55 9.11 1 0.954 0.888
(eq.
1) 0.917 0.467 9.25 0.917 0.904 0.888
Where N is the population size in the reference region,
and f i t denotes the objective value of individual i at the tth
generation. In this case, the function f is one with the
minimum value of the individual i. Further, δ means the Performance Evaluation on the basis of parameters for
average improvement degree of function value that the an Proposed Technique
current individuals are compared with their parent TP FP Precisio Recall F- ROC
individuals. The precision of the solutions presented to the Rate Rate n Measure Area
DM can be controlled by setting the value of δ. In other
words, the parameter δ is determined by the DM, when the
condition of derta ≤ δ is satisfied, the interaction happens. 0.5 0.007 0.923 0.5 0.649 0.904
Evaluation Metrics
Accuracy: it's an outline of systematic errors, a live of
applied mathematics bias; as these cause a distinction 0.993 0.5 0.921 0.993 0.966 0.904
between a result and a "true" worth, ISO calls this
exactitude.
Accuracy = (TP+TN)/(TP+TN+FP+FN)
Precision: it's an outline of random errors, a live of 0.921 0.428 0.921 0.921 0.911 0.904
applied mathematics variability.
Precision(P) = TP / (TP + FP)
Recall: Recall (also called sensitivity) is that the fraction
of relevant instances that are retrieved over total relevant
instances within the image. each exactness Associate in
Nursingd recall {are|ar|area unit|square live} thus supported
an understanding and measure of relevancy.
Recall (R) = TP / (TP + FN)
True positive (TP) = the amount of cases properly known
as true
False positive (FP) = the amount of cases incorrectly
known as true
True negative (TN) = the amount of cases properly
known as false
False negative (FN) = the amount of cases incorrectly
known as false

F-Measure: In statistical examination of parallel

arrangement, the F1 score (likewise F-score or F-measure)
is a measure of a test's precision. It considers both the
accuracy p and the review r of the test to process the score:
p is the quantity of right positive outcomes partitioned by
the quantity of every single positive outcome, and r is the
quantity of right positive outcomes isolated by the quantity

Volume XII, Issue IX, September/2020 Page No:849

Journal of Interdisciplinary Cycle Research
Proposed approach delineated a way to adapt discriminative
re ranking to boost the performance of the generative
models for grounded learning. Specifically, we have a
tendency to dig into the matter of steering instruction
following mentioned in last chapter and aid 2 PCFG models
delineated earlier with the framework of discriminative re-
ranking. standard ways of discriminative re-ranking need
gold-standard references so as to guage candidates and
update the model parameters within the coaching part of re-
ranking. However, grounded learning issues don't have
gold-standard references naturally available; so, direct
application of standard re-ranking approaches don't work.
Instead, we have a tendency to show however the weak
superintendence of response feedback (e.g., roaring task
completion within the steering task) will be used as another,
through an experiment demonstrating that its performance is
comparable and even more practical compared to coaching
on gold-standard take apart trees. changed Re-ranking
algorithmic rule for Grounded learning. In re-ranking, a
baseline generative model is 1st trained and it generates a
collection of candidate outputs for every coaching example.
IV. CONCLUSION
In this paper, we intend to present a movie recommendation
system based on the combination of opinion mining and
user similarity analysis. This system helps to recommend
top-k movies for target user. In this work, we collect
reviews of users for movies and pre-process data with
certain major pre-processing steps. The pre-processed are
given for explicit and implicit aspect extraction. The aspect
Volume XII, Issue IX, September/2020
ISSN NO: 0022-1945
of a word is further classified according to the classes.
Finally, top-k movies are recommended for target user. The
results suggested by our proposed system are leading and
block buster movies and the system is helpful for millions
and billions of users around the globe. Here the accuracy of
classification is improved using NbSVM classifier and also
meet the requirement of the users. We have tested our
proposed system on Movie Lens Dataset and also our work
shows better performance than ALS and SEHRS.
V. REFERENCES
[1]. Zhang, J.; Wang, Y.; Yuan, Z.; Jin, Q.; “Personalized
Real-Time Movie Recommendation System: Practical
Prototype and Evaluation”, Tsinghua Science And
Technology, vol: 25, 2020, pp: 180-191
[2]. Zhang, R.; Mao, Y.; “Movie Recommendation via
Markovian Factorization of Matrix Processes”, IEEE,
vol: 7, 2019, pp: 13189-13199
[3]. Haruna, K.; Ismail, M.A.; Suyanto, M; Gabralla, L.A.;
Bichi, A.B.; Danjuma, S.; Kakudi, H.A.; Haruna, M.S.;
Zerdoumi, S.; Abawajy, J.H.; Herawan, T.; “A Soft Set
Approach for Handling Conflict Situation on Movie
Selection”, IEEE, vol: 7, 2019, pp: 116179-116194
[4]. Kalra, N.; Yadav, D.; Bathla, G.; “SynRec: A
Prediction Technique using Collaborative Filtering and
Synergy Score”, International Journal of Engineering
and Advanced Technology, vol: 8, 2019, pp: 457-463
[5]. Pavithra, M.; Sowmiya, S.; Tamilmalar, A.; Raguvaran,
S.; “Searching an Optimal Algorithm for Movie
Recommendation System”, International Research
Journal of Engineering and Technology, vol: 6, 2019,
pp: 216-221
[6]. Nagamanjula. R.; Pethalakshmi, A.; “A Novel Scheme
for Movie Recommendation System using User
Similarity and Opinion Mining”, International Journal
of Innovative Technology and Exploring Engineering,
vol: 8, 2019, pp: 316-322
[7]. Mhetre, R.; Priya, G.; “Movie Recommendation Engine
using Collaborative Filtering with Alternative Least
Square and Singular Value Decomposition
Algorithms”, International Journal of Advanced
Research in Computer and Communication
Engineering, vol: 8, 2019, pp: 88-92
[8]. Xi, W.; Huang, L.; Wang, C.; Zheng, Y.; Lai, J.;
“BPAM: Recommendation Based on BP Neural
Network with Attention Mechanism”, Proceedings of
the Twenty-Eighth International Joint Conference on
Artificial Intelligence, 2019, pp: 3905-3911
[9]. Shaik, I.; Nittela, S.S.; Hiwarkar, T.; Nalla, S.; “K-
means Clustering Algorithm Based on E-Commerce
Big Data”, International Journal of Innovative
Technology and Exploring Engineering, vol: 8, 2019,
pp: 1910-1914
[10]. Mehra, J.; Thakur, R.S.; “Probability Density Based
Fuzzy C Means Clustering for Web Usage Mining”,
International Journal of Innovative Technology and
Exploring Engineering, vol: 8, 2019, pp: 169-173
Page No:850
Journal of Interdisciplinary Cycle Research ISSN NO: 0022-1945

[11]. M. Govindarajan”Sentiment Analysis of Movie

Reviews using Hybrid Method of Naive Bayes and
Genetic Algorithm “International Journal of Advanced
Computer Research, Vol.3, Issue-13, December-2013..
[12]. Dhanashri Chafale, Amit Pimpalkar” Sentiment
Analysis on Product Reviews Using Plutchik’s Wheel
of Emotions with Fuzzy Logic ” An International
Journal of Engineering & Technology , Vol. 1, Issue
No. 2, December, 2014.
[13]. G. Vaitheeswaran , L. Arockiam “Hybrid Based
Approach to Enhance the Accuracy of Sentiment
Analysis on Tweets ” IJCSET ,Vol 6, Issue 6, June ,
2016.
[14]. Pravin Keshav Patil, K. P. Adhiya “ Automatic
Sentiment Analysis of Twitter Messages Using Lexicon
Based Approach and Naive Bayes Classifier with
Interpretation of Sentiment Variation ” International
Journal of Innovative Research in Science, Engineering
and Technology, Vol. 4, Issue 9, September 2015.

Volume XII, Issue IX, September/2020 Page No:851

View publication stats