A PROJECT

ON

MOVIE RECOMMENDATION SYSTEM USING MACHINE

LEARNING WITH PYTHON

Literature Survey Report submitted in the partial

fulfilment of the requirementsfor the award of
the degree of
BACHELOR OF TECHNOLOGY
in
COMPUTER SCIENCE & ENGINEERING
By
P.Chanderrraju 19K91A05F2
P.Varshith 19K91A05F3
K.Abhinavkrsishna 19K91A05B5
M.Pranavswaroop 19K91A05D4

UNDER THE GUIDANCE OF

Mrs. laxmiprasanna

DEPARTMENT OF COMPUTER SCIENCE &ENGINEERING

TKR COLLEGE OF ENGINEERING & TECHNOLOGY

(AUTONOMOUS)

(Accredited by NBA and NAAC with ‘A’ Grade)

Medbowli, Meerpet, Saroornagar, Hyderabad-500097

CERTIFICATE
This is to certify that the Literature survey report entitled MOVIE RECOMMENDATION SYSTEM
USING MACHINE LEARNING WITH PYTHON, being submitted by Mr. P.Chanderraju, bearing
ROLL.NO:19K91A05F2, Mr. P.Varshith , bearing ROLL.NO:19K91A05F3, Mr. K.Abhinavkrishna,
bearing ROLL.NO:19K91A05B5, Mr. M.Pranavswaroop,bearing ROLL.NO:19K91A05D4 in partial
fulfilment of requirements for the award of the degree of Bachelor of Technology in Computer Science
and Engineering, to the TKR College of Engineering and Technology is a record of bonafidework carried
out by them under my guidance and supervision.

Name and Signature of the Guide Name and Signatureof the HOD

Mrs. Laxmiprassana Dr.A. Suresh Rao

Professor

CONTENTS
S.NO. Pg.no.
1 ABSTRACT
2 INTRODUCTION
3 LITERATURE SURVEY REPORT
 3.1 Collaborative Filtering for Movie Recommendation using RapidMine

3.2 Mining affective text to improve social media movies recommendation

3.3 A Three Way Hybrid Movie Recommendation

3.4 An intelligent movie recommendation system through group-level sentiment

analysis in microblogs

3.5 Movie Recommendation System Using Collaborative Filtering

3.6 Movie Recommendation System using Cosine Similarity and KNN

3.7 Content-Based Movie Recommendation System Using Genre Correlation

3.8 Movie recommendation system using machine learning algorithm

3.9 Movie Recommendation System

3.10 A Movie Recommender System: MOVREC

3.11 Machine Learning Model for Movie Recommendation System

3.12 Content Based Movie Recommendation System

3.13 Sentiment Analysis of Movie Review using Machine Learning Techniques

3.14 An Improved Collaborative Movie Recommendation System using

Computational Intelligence

3.15 Matrix Factorization Techniques for Recommender Systems

4 REFERENCES

1. ABSTRACT
A recommendation engine filters the information mistreatment totally different
algorithms and recommends the foremost relevant things to users. It 1st captures the past
behaviour of a client and supported that, recommends product that the users can be
seemingly to shop for. If a totally new user visits an e-commerce website, that website
won't have any past history of that user. Therefore, however will the positioning approach
advocating product to the user in such a scenario? One attainable answer might be to
recommend the popular product, i.e. the product that are high in demand. Another
attainable answer might be to advocate the product which might bring the most profit to the
business. 3 main approaches are used for our recommender systems. One is Demographic
Filtering i.e they provide generalized recommendations to each user, supported picture
show quality and/or genre. The System recommends identical movies to users with similar
demographic options. Since every user is totally different, this approach is taken into
account to be too straightforward. The basic plan behind this technique is that movies that
are a lot of common and critically acclaimed can have the next likelihood of being likeable
by the common audience. Second is content-based filtering, wherever we have a tendency
to try and profile the user’s interests mistreatment data collected, and advocate things
supported that profile. the opposite is cooperative filtering, wherever we have a tendency to
try and cluster similar users along and use data regarding the cluster to create
recommendations to the user.

2. INTRODUCTION
Recommender systems used in a various form of areas together with movies, music,
news, books, analysis articles, search queries, social tags, and merchandise normally.
Recommendation System is a filtration program whose prime goal is to predict the movie to a
user towards a domain-specific item. In our case, this domain-specific item is a movie, so the
most focus of our recommendation system is to filter and predict solely those movies that a user
would favor given some information concerning the user him or herself. There are many
alternative ways that to create movie recommendation system however we've selected the
content base recommender system in order that user will simply get the foremost similar movies
on the user's interest. As our recommender system recommends the top high five movies as like
movie that user is selected.

3.LITERATURE SURVEY REPORT

Literature survey:
 1. Collaborative Filtering for Movie Recommendation using RapidMine

Title: Collaborative Filtering for Movie Recommendation using RapidMine

Published by: Arpita Jain Santosh K. Vishwakarma

Related work:

Recommender System is a special type of information filtering system that

provides a prediction which helps the user to evaluate items from a huge collection
that the user is likely to find interesting or useful. Recommender System is used to
produce meaningful suggestions about new items for particular consumers. These
recommendations facilitate the users to make decisions in multiple contexts, such
as what items to buy, what online news to read or what music to listen to.
Recommender Systems have become important in information and decision
overloaded in the world. Recommender Systems helped their founders to increase
profits. This paper, presents a brief overview of collaborative filtering based movie
recommender system and their implementation using rapid miner.

Methodology:

Recommender engine in RapidMiner Extension has been prepared by e-LICO, an

e-Laboratory for Interdisciplinary Collaborative Research in Data –Intensive
Science and Data mining. In the Recommender extension there are essentially
three sorts of operators as Item Recommendation, Item Rating Prediction, and
Recommender Performance. We usage operators relating to Collaborative Filtering
in ‘Item Rating Prediction’. Collaborative grounded operators’ proceeds an
example set as input having training data however recurring a trained model and
unaffected training data. We also formed the Apply Model and the Performance
operators for every type. Apply Model Rating prediction operator retrieve a trained
model and a test as input. Output of the Apply Model is practice to compute
performance using the Performance operator. The Performance operator compute
the assessment of rating prediction error methods: Root Mean Square Error
(RMSE), Mean Absolute Error (MAE) and Normalized Mean Absolute Error
(NMAE). These error measure values are returned as a performance vector and an
example set. Here using the data set from Group Lens Research Project. Ratings
are on a gauge of 1 to 5 (whole-star ratings only). There are three files:
‘ratings.dat’,’users.dat’ and ‘movie.dat’. For prediction of user ratings using
collaborative filtering we requisite data with three fields: userid, movieid and
ratings. File 'ratings.dat‘ contains the user ratings in the format: UserID, MovieID,
Rating, Timestamp. Each user has at least 20 ratings and surely ratings by users are
sparse.

Conclusion:

This paper presented recommender systems and implementation of collaborative

movie recommendation using RapidMiner Recommender Extension. The benefit
of using a device like RapidMiner is that it permits persons innovative to the mode
an easy overview to the system and delivers a very well-organized means to
speedily experimentation with dissimilar algorithms until you discover the precise
arrangement that workings for your dataset. This paper measured the performance
of recommender system using a single model (i.e. item k-NN) and using multiple
models (i.e. item k-NN and Matrix Factorization).However using multiple models
for recommender system, give better performance than a single model. In future
using the knowledge gained from this paper in other recommendation problem
applications and business will help to getting quality and knowledgeable decision.

2. Mining affective text to improve social media movies recommendation

Title: Mining affective text to improve social media movies recommendation

Published by: J. Sun, G. Wang, X. Cheng, and Y. Fu

Related work:

Social media websites, such as YouTube and Flicker, are currently gaining in
popularity. A large volume of information is generated by online users and how to
appropriately provide personalized content is becoming more challenging.
Traditional recommendation models are overly dependent on preference ratings
and often suffer from the problem of “data sparsity”. Recent research has
attempted to integrate sentiment analysis results of online affective texts into
recommendation models; however, these studies are still limited. The one class
collaborative filtering (OCCF) method is more applicable in the social media
scenario yet it is insufficient for item recommendation. In this study, we develop a
novel sentiment-aware social media recommendation framework, referred to as
SA_OCCF, in order to tackle the above challenges. We leverage inferred sentiment
feedback information and OCCF models to improve recommendation performance.
We conduct comprehensive experiments on a real social media web site to verify
the effectiveness of the proposed framework and methods. The results show that
the proposed methods are effective in improving the performance of the baseline
OCCF methods.

Methodology:

Lately, social media websites (e.g., YouTube1 and Flicker2) are increasingly
receiving attention. A rapid convergence of online content sharing network
websites has been observed in recent years. A large volume of content can be
generated and diffused by users in these social media websites. For example, it was
reported in 2012 that YouTube received 60 h of uploads per minute and 4 billion
views per day3. In such an environment, there is an urgent requirement for an
intelligent tool to effectively recommend social media items. Great challenges on
traditional recommendation techniques to provide personalized content to users are
seen, due to the dynamic behavior of users in social media websites and the
volume of content they generate. Traditional recommendation models assume user
preference ratings are available and often suffer from the problem of “data
sparsity”. In the real-world social media websites, it is hard to obtain rating
information which means that traditional models are limited in their functionality.
To address this issue, some researchers have explored rich user generated content
as a supplementary source to support personalized recommendation. Tag-aware
recommender systems were proposed to incorporate rich tagging information into
traditional recommendation models and achieved good performance. Furthermore,
a user’s online activity (searching and browsing) and his/her social connections
have also been explored and utilized to improve recommendation accuracy.
Recently, affective texts (such as reviews and comments) generated by online users
have been given more attention and fruitful sentiment analysis works has begun to
emerge rapidly. Some attempts have been made to integrate sentiment analysis
results into recommendation generations. The majority of existing work combines
sentiment analysis techniques with collaborative filtering techniques to conduct
movie rating predication. However, in relation to the social media context, item
recommendation is limited due to a lack of sentiment-awareness. To the best of the
author’s knowledge, there are only two studies relevant to sentiment-aware item
recommendation in social media websites. These studies only applied sentiment
analysis results into the basic neighborhood-based collaborative filtering models.
Advanced one-class collaborative filtering (OCCF) models were not explored.
Therefore, the combination of sentiment analysis with a recommender system is
limited and more extensive experimental work is required. In this paper, we
develop a sentiment-aware social media recommendation framework, referred to as
SA_OCCF, to tackle the key challenges highlighted above. Firstly, the affective
text from user comments is explored and mined by our proposed ensemble
learning-based sentiment classification (ELSC) method. Secondly, the derived
sentiment feedback information by ELSC is incorporated into the OCCF models
and we formalize our sentiment-aware recommendation models (SA_OCCF) to
improve social media item recommendation performance. The proposed methods
and models are evaluated through comprehensive experiments using the TED
dataset. The results show that the proposed SA_OCCF models outperform the
baseline methods using a variety of recommendation accuracy metrics.

Conclusion:

In this paper, we proposed a sentiment-aware recommender system for use in the

social media websites. The proposed method leveraged sentiment information from
user generated affective texts to improve OCCF performance. Comprehensive
experiments were conducted on a real social media website (TED dataset) in order
to evaluate the effectiveness of the proposed models.

3. A Three Way Hybrid Movie Recommendation

Title: A Three Way Hybrid Movie Recommendation

Published by: K. Soni, R. Goyal, B. Vadera, and S. More

Related work:

Recommendation Systems or Engines are found in many applications. These

systems or Engines offer the user or service subscriber with a list of suggestions or
recommendations that they might choose based on the user’s already known
preferences. In this paper, the focus is on combining a content-based algorithm, a
User-based collaborative filtering algorithm, and review based text mining
algorithm in the application of a tailored movie recommendation system. Here
movies are recommended based on ratings explicitly provided by the user and
according to the ratings and reviews of movies provided by other users as well.
Here the propose is to generate polarity ratings to Characteristics of a movie
instead of generating a wholesome rating to an available text based review to gain
better insights about preferences of users, thus refining Movie recommendation
systems further.

Methodology:

A recommendation system uses intelligent algorithms, which can provide

recommendations to users according to their needs. Recommendation systems can
be implemented in any domain from E-commerce to network security in the form
of personalized services. They provide benefits to both the user and the service
provider, by suggesting items to users on the basis of their known preferences [1]
Every recommender system consists of two entities, one is user and other is an
item. A user can be any consumer or a customer of any items or products or
services, who has an opinion of that item. The input to recommendation algorithm
can be a database of user and items and output will be the recommendations. As in
this case, inputs consist of a dataset of customer and database of movies and output
denotes the movie recommendations. algorithm [2] and review based text mining
algorithm [3] . The content-based algorithm consists of user’s information such as
their interest, favorites, priorities etc. This type of information cannot already be
available for a particular user; thus it is explicitly filled by the user. Content-based
algorithms provide recommendations or suggestions based on this type of inputs
from the user. Collaborative filtering is a technique that has been used in
recommendation systems which can predict and advise items that the user might
like based on his or her known preferences. CF-based movie recommendations
predict a list of top recommended movies for a given user based on ratings
(numerical scores) from many users & the available ratings that are explicitly
given by the user by rating a movie or movies [6] User ratings partially represent
user preferences. Thus, it is not easy to accurately identify similar users based on
the available ratings. On the other hand, online movie reviews have become a
common source for users to share and collect data about movies, but there have
been very few studies that accurately integrate text mining techniques with
traditional CF approaches to improve the suggestions based on user’s preferences.
Thus this paper proposes a combined approach of content based algorithm,
collaborative filtering and review based algorithm that integrates user text reviews
[3] and user numeric ratings [2] in order to model user’s preferences better and in
turn improve the performance of a movie recommendation systems.

Conclusion:

Present Movie recommendation systems lack efficiency because Movies are

recommended considering only factors such as Movie rated & reviewed by the
User and Users having similar viewing preferences, by using text mining and
suggesting movies on the basis of intersection of the three algorithms i.e. User
Based Collaborative filtering, Content-based algorithm & text mining due to which
the user will not only be suggested movies but this system will also provide the
user with more refined recommendations as movies with a low rating score in any
of the Movie characteristics generated on the basis of Text Mining will be filtered
out during the priority allocation stage of the proposed Three Way Hybrid Movie
Recommendation System.
 4. An intelligent movie recommendation system through group-level
sentiment analysis in microblogs

Title: An intelligent movie recommendation system through group-level sentiment

analysis in microblogs

Published by: H. Li, J. Cui, B. Shen, and J. Ma

Related work:

The emergence of the online media sharing sites (e.g. Youtube, Youku, and Hulu)
have introduced new challenges in program recommendation in online networks.
However, there is a bottleneck that the amount of available viewing logs and user
friendship networks are too limited to design effective recommendation
algorithms. Thus, carrying out an intelligent program recommendation system is
important for these sites. In this work, we propose a novel model which turns to the
social networks and mine user preferences information expressed in microblogs for
evaluating the similarity between online movies and TV episodes. To the best of
our knowledge, it is the first effort to bridge the gap between movie and TV
watchers domain with social network activities. Moreover, it is the first approach
that can solve the “cold-start” problem in movie and TV recommendation system.
Series of data mining approaches and social computing models have been adopted
in this work. Similar programs found from the social network are further used to
suggest programs in other media devices. This work can be easily applied in online
media streaming sites in order that intelligent recommendations of programs can be
made to the customers through mining microblogs.

Methodology:
In this paper, we turn to some other knowledge base such as Social Networks (i.e.,
Twitter and Youtube) where people form different communities, each one of which
represents a group of fans for a specific program. Hence, it is possible to identify
and evaluate the communication and distance between such communities. In this
way, the relationship between different programs in social network domain can be
found, based on which we may further make recommendations in movie/TV
programs domain. For instance, we may suggest John to watch Sports News during
the break. KBridge explores the in-depth connection among contents, thus can be
used in the following usage scenarios:

• From a specific program, find other similar program according to the program-
wise association rules.

• For specific user group, find the best program to recommend.

To the best of our knowledge, this is the first approach that matches the user
communication in social network domain with that in online movie streaming
system domain, and utilizes social network information and social computing
models in movie/TV program recommendation task.

• We propose a model to identify discussion groups in microblog that are

correlated with a given topic (i.e., a specific TV episode or movie).

• By investigating the correlation between groups of users in microblog, we

propose a novel sentiment-aware association rule mining algorithm, which utilizes
the sentiments expressed in microblogs to identify frequent program patterns and
deduce the association rule of movie/TV programs. Through this way, we can
overcome the second limitation, namely “cold-start” problem. To the best of our
knowledge, this is the first effort that bridges the gap between user activity in
program watching domain and social network domain.

• Moreover, our proposed model is generic in the aspect that, not only plain text,
but also other unstructured information within social networks can be utilized.

• We propose a prediction model utilizing a series of prior information, such as

program view logs, program metadata similarity, and social-aware frequent
program patterns, to predict the future view logs for an arbitrary program.

Conclusion:

In this work, we proposed a novel program recommendation system, namely,

KBridge. In this system, multiple data mining techniques and information theories
are applied in order to extract valuable knowledge about user activities towards
program watching in social network domain. Empirical results over real-world
dataset justify that social network knowledge make great contributions in
prediction of the viewing behaviors in program watching domain.

5. Movie Recommendation System Using Collaborative Filtering

Title: Movie Recommendation System Using Collaborative Filtering

Published by: Ching-Seh (Mike) Wu, Deepti Garg

Related work:

As the business needs are accelerating, there is an increased dependence on

extracting meaningful information from humongous amount of raw data to drive
business solutions. The same is true for digital recommendation systems which are
becoming a norm for consumer industries such as books, music, clothing, movies,
news articles, places, utilities, etc. These systems collect information from the
users to improve the future suggestions. This paper aims to describe the
implementation of a movie recommender system via two collaborative filtering
algorithms using Apache Mahout. Furthermore, this paper will also focus on
analyzing the data to gain insights into the movie dataset using Matplotlib libraries
in Python.

Methodology:

A recommendation system or recommendation engine is a model used for

information filtering where it tries to predict the preferences of a user and provide
suggests based on these preferences. These systems have become increasingly
popular nowadays and are widely used today in areas such as movies, music,
books, videos, clothing, restaurants, food, places and other utilities. These systems
collect information about a user's preferences and behavior, and then use this
information to improve their suggestions in the future. A large number of
companies are making use of recommendation systems to increase user interaction
and enrich a user's shopping experience. Recommendation systems have several
benefits, the most important being customer satisfaction and revenue. Many a
times, customers tend to look at the recommendations provided based on their
previous transaction because they think that they will find better options. If these
recommendations are fine tuned to the user's needs, the customer will be satisfied
with their purchase. Thus, the customer would use this application once again.
With customers using these applications frequently, a huge amount of revenue is
generated, which is why many e-commerce compames are turning to Improve their
recommendation engines. Although recommendation systems are common,
developing systems that provide good and appropriate suggestions is a challenge.
Each user has different preferences and likes. Additionally, a user's preference
depends on many aspects such as their mood, the occasion, the reason for their
purchase etc. If a website or app is not able to predict and provide suitable
recommendations as per the liking of the user, then the user is likely to stop using
that website or app. Thus, there is always a need for companies to improve their
recommendation systems. One goal of this paper IS to design a mOVIe
recommendation system that considers the past movie ratings given by various
users to provide suggestions to the user. We implemented this system usmg
collaborative filtering algorithms and Apache Mahout framework The second goal
is to compare the performance and efficiency of user-based recommender system
and item-based recommender system. This paper is organized as follows: First, a
brief overview of a few relevant, recent research done in the space of recommender
system will be discussed. Second, we will present the understanding on the
technique of collaborative filtering. Third, the data preparation and data analysis
approach using Mahout will be discussed. Finally, a qualitative evaluation on the
techniques used will be presented.

Conclusion:

In this paper we have implemented a movie recommendation system using

collaborative filtering. This system is developed using Apache Mahout and takes
the ratings given to movies into consideration to provide movie suggestions. For
future work, the recommender system could be developed using hybrid filtering
approach instead of collaborative. Recent research indicates that hybrid systems
are found to be more effective and provide more accurate recommendations.
Hence, hybrid systems would be an improvement. Our system considers the user
ratings to recommend movies. In the future, more features such as the genre of the
movie, the directors, the actors and so on could be considered as well to provide
suggestions. In addition, a new framework called Apache Prediction 10 could be
looked into to develop the system instead of Mahout. The Apache Prediction 10 is
a machine learning server that uses the technology stack of Apache Hadoop,
Apache spark, Elastic Search and Apache Hbase to build Universal Recommender
System.

6. Movie Recommendation System using Cosine Similarity and KNN

Title: Movie Recommendation System using Cosine Similarity and KNN

Published by: Gaurav Srivastav

Related work:

Over the past years, the internet has broadened the horizon of various domains to
interact and share meaningful information. As it is said that everything has its pros
and cons therefore, along with the expansion of domain comes information
overload and difficulty in extraction of data. To overcome this problem the
recommendation system plays a vital role. It is used to enhance the user experience
by giving fast and coherent suggestions. This paper describes an approach which
offers generalized recommendations to every user, based on movie popularity
and/or genre. Content-Based Recommender System is implemented using various
deep learning approaches. This paper also gives an insight into problems which are
faced in content-based recommendation system and we have made an effort to
rectify them.

Methodology:

Advancement in technology is reaching new heights every day and due to which
we can see enormous growth in information. To deal with such large data we use
machine learning that automates analytical model building. The early classification
of machine learning is divided into three broad categories: Supervised learning,
Unsupervised learning and Reinforcement learning. We use computers to make
predictions to help us achieve better results using various computational statistics.
Tasks can be performed without being explicitly programmed to do so. It becomes
a tedious task to extract the relevant information. Search engines solve the problem
to some extent but it does not solve the personalization problem. Recommendation
System framework plays a vital role in today‟s internet surfing, be it buying a
product from an e-commerce site or watching a movie on some video-on-demand
service. In our everyday life, we depend on recommendations given by other
people either by word of mouth or reviews of general surveys. People often use
recommender systems over the web to make decisions for the items related to their
choice. Recommendation systems are software tools and techniques whose goal is
to make useful and sensible recommendations to a collection of users for items or
products that might interest them. In other words, the recommender system or
recommendation systems belongs to a class of information filtering system that
aims at predicting the „preference‟ or „rating‟ given to an item. Revised
Manuscript Received on May 29.2020. Gaurav Srivastav, Inderprastha Engineering
College, AKTU Ramni Harbir Singh, Inderprastha Engineering College, AKTU
Sargam Maurya, Inderprastha Engineering College, AKTU Tanisha Tripathi,
Inderprastha Engineering College, AKTU Tushar Narula, Inderprastha Engineering
College, AKTU Recommendation systems are primarily using three approaches. In
content-based filtering, we do profiling based on what type of content any user is
interested in and using the collected information, it recommends items. Another
one is collaborative filtering, where we make clusters of similar users and use that
information to make recommendations. Hybrid systems are the one which takes
into account both above stated approaches to deal with operational data more
concisely. Our goal is to provide accurate recommendations with less
computational complexity.

Conclusion:

We have illustrated the modelling of a movie recommendation system by making

the use of content-based filtering in the movie recommendation system. The KNN
algorithm is implemented in this model along with the principle of cosine
similarity as it gives more accuracy than the other distance metrics and the
complexity is comparatively low too Recommendations systems have become the
most essential fount of a relevant and reliable source of information in the world of
internet. Simple ones consider one or a few parameters while the more complex
ones make use of more parameters to filter the results and make it more user
friendly. With the inclusion of advanced deep learning and other filtering
techniques like collaborative filtering and hybrid filtering a strong movie
recommendation system can be built. This can be a major step towards the further
development of this model as it will not only become more efficient to use but also
increase the business value even further.

7. Content-Based Movie Recommendation System Using Genre

Correlation

Title: Content-Based Movie Recommendation System Using Genre Correlation

Published by: Shaili Sen1, Prof. Pradeep Tripathi

Related work:

It is a data-driven recommendation system that delivers recommendations to

customers, such as books, films, etc. Most movie recommendation systems
normally base user preferences on similar films. Effort recommendation systems
are particularly useful for large customer database collecting organisations. A lot
of things could go into a movie recommendation design like the director of the
movie, the film genre, or the actors appearing in it. There are two or three
characteristics that the systems use to make a recommendation. It has been based
on types of content that the user prefers to watch. The distribution method adopted
to implement this is focused on genrebased filtering. In this case, the dataset that
was used for the project is Movie Lens. Python is the research software used.

Methodology:

The quantity of data transactions has grown in this era of the Internet
exponentially. Massive numbers of users on the Internet have multiplied the
volume of data. Some data is accessible on the Internet, but not all of it is
meaningful or sufficient for use by the public. Excessive data turns out to be
inconsistent, and uncreative. Users must conduct several searches before they
eventually locate what they were searching for. Most importantly, they have come
up with recommendation systems to solve this problem. A recommendation
framework takes into account users' previous interests to include relevant
information. We strive to filter and configure the data according to each user's
requirements. Thanks to the growth of the Internet, recommendation systems
havebecome better and better That has gained momentum because it provides
details in a limited period of time. Recommender programmes have been put in
place in various media such as books, videos, news, and goods, and they have
proven effective there as well. Recommender schemes are used for almost all
organizations today. Indeed, LinkedIn, Amazon, and Netflix are good examples of
this trend. LinkedIn tells the user which colleagues she may be connected to,
among the millions who are on the network, which ones they should subscribe to.
By automating the database, this means the user would not have to do a lot of
manual research. Since the Amazon recommendations are based on what
consumers have already bought together, they recommend products that go
together. You can find something that is new and noteworthy in a category you've
selected on the home page by following the recommendations from your
favourites, as long as you're still on the Amazon website. The same principle
applies to Netflix as well; they will determine what type of show a consumer
would like and then recommend similar shows. According to the ways of
recommendation algorithms, three methods can be used: content-based,
collaborative, and hybrid. A behavioural recommendation framework looks at a
user's past behaviours and deduces things about which they may be interested in.
This type of search technique involves taking previous user reviews and ratings
and combines them with other user profiles to form an assessment of what is
trending or more common Comparisons are rendered using those that have the
most resemblance. On the other hand, while content-based and collaborative
filtering have their strengths, there are also some important differences.
Researchers came up with a solution which would blend the strengths of both
approaches. this paper proposes a method that makes use of genre correlation This
dataset was intended for this reason, which has 9126 movies sorted into a
genrebased classification scheme. There are eleven genres in all. They have been
reviewed by over a thousand six hundred and seventy six-hundred users and
seventy-one people. recommending movies close to those that have earned good
reviews by taking into account

Conclusion:

The recommendation system implemented in this paper aims at providing movie

recommendation based on the genres of the movies. If a user highly rates a movie
of a particular genre, movies containing similar genres will be recommended to
him. Recommendation systems are widely used in today’s era of Web 2.0 for
searching for reliable and relevant information. While simple recommendation
systems recommend users based on a few parameters, complex ones take many
parameters into consideration. By implementing machine learning in recommender
systems, intelligent recommendations can be made for customers. Given the
potential of such systems, they have a huge commercial value. Several MNCs have
been exploiting the potential of recommendation system to lure customers into
using their products. This also impacts greatly on the field of data mining and web
mining. Mobile cloud computing (mcc) is able to save energy, improve application
and experience of the users. All frameworks mentioned above have their own
benefits and issues but still not up to level to address all issues related to security,
energy and user experience. Security issues are key problem in mcc, they need to
be focused more compare to other issues.

8. Movie recommendation system using machine learning algorithm

Title: Movie recommendation system using machine learning algorithm

Published by: Manjunath Reddy R*1,Ms.LathaR

Related work:

Recommendation systems have changed the method of searching things that we are
interested in. This is a data filtering approach that is used to predict the preferences
in a variety of things. Some of the areas where recommendation engines/systems
are books, shopping, articles, movies, music etc. In this paper I have proposed a
movie recommendation system which uses a machine learning algorithm to predict
the preferred movies. It is based on the content based filtering process that makes
use of the preferential data provided by users. It analyzes the user data and
recommends the best movie at the given time. The movies are suggested according
the similar content which is present the input movie given by user. System uses
vectorization machine learning algorithm to recommend the movies. This system is
developed in jupyter notebook and django framework. It preprocesses the data sets
and build the algorithm on those data sets. The data consists of thousands of
movies of various genres. The recommendation system takes one movie as input
from the given data set and outputs 5 movies as a recommendation result. A web
based platform is built in python programming language using django framework.
These systems which are based on content recommendation are mannered to
people, these systems do not recommend anything to the user, it limits to your
choice.

Methodology:

It provides relatable content according to the collection of items to the user. These
systems aims to recommend movies to users based on movie ratings. Ex. “Which
movie will you like” given that you have seen Ironman, Doctor Strange, Captain
America users who saw these movies also liked “The Avengers”?.
Recommendation systems imitates social processes to enable quick filtering of the
information on the web. Many of companies try to offer services that involve
recommendations to address the right user groups.Each user represented by a
unique id.

Content Based Filtering:

Content-based filtering is based on the user's profile Description of preferences and

items. Explain in cosine similarity Items to tag with keywords next to the user
profile Likes and dislikes of users' tastes. In other words, cosine similarity
Algorithm recommends this article or similar article A person who has fallen in the
past. Examine previously rated items We recommend the best article. There are
different approaches proposed in different research papers The papers listed below.
These approaches are often combined With a hybrid recommender system.
Machine learning is used for recommending a moviehad the following specific
drawbacks B., please series The number of questions to the user was time
consuming. The other On the other hand, it wasn't user-friendly due to the fact that
it turned out to be such. I get some stress. Please consider these Defects
recommendation system we developed Recommender system that recommends
movies to users It is based on the information you provide yourself. In In the
current study, users are their own Actor, director, Genre, year,rating, etc. User
choices are predicted based on: About selecting the history of previously visited
users. Or The system was developed in PHP and is now A simple console-based
interface.

Cosine Similarity:

Cosine similarity measures the similarity between two vectors in the inner product
space.It is measured by the sine and cosine of the angle between the two vectors
and determines if the two vectors point in approximately the same direction.It is
typically used in text analysis to measure document similarity.

Recommendation System:

The system takes a movie as input to recommend other similar movies based on
the cosine similarity machine learning algorithm.Recommendation System is a
web application that uses API call from The Movie Data base to fetch movie
library to get the recommended movie to user.
Conclusion:

This document introduced Movie recommendation system. A system for movie

recommendations. Allow users to choose. Make a selection from the given set of
attributes and recommend it. He has a list of movies based on the cumulative
weight of various Attributes and usage of the cosine similarity algorithm. By our
nature Evaluating performance has not been an easy task since the system. There
are no correct or incorrect recommendations. That's just one thing Of opinion.
Based on informal assessments we have conducted. Received positive feedback
from a small group of users she. I need a larger dataset to make this possible. More
meaningful results in our system. Besides us I want to integrate various machine
learning methods Examine the clustering algorithm and comparison results.
Finally, implement a web-based user Interface with user database and learning
model To suit each user.

9. Movie Recommendation System

Title: Movie Recommendation System

Published by: Ananya Agarwal1, S. Srinivasan

Related work:

Filtering systems are often used to remove unnecessary information from a large
amount of data. Recommender systems are used to seek and predict meaningful
and informative items that a user might put into the data. The system emphasizes
on reusing the information and preferences of the users that can be used in the
calculation of future recommendations. This paper proposes a recommender
system which provides recommendation based on the information given by the
users. It is done by using analysis of user’s psychological profile, their watching
history and movie scores from other websites. It is actually based on aggregate
similarity conditions. This system uses both content and collaborative filtering.
Both can be explained as follows: Collaborative filtering means building systems
from user’s past behavior (ie. Items that have already been selected or rated)
Afterwards the model is used to predict outcomes that the user might be interested
in. Content based filtering uses a series of distinct and discrete characteristics of an
item in order to recommend more items with same properties. Both of these
systems combine to make a hybrid recommender system. This system which is a
hybrid of both filtering systems is capable of recommending movies using analysis
of the profiles.

Methodology:

Qualitative evaluation: The movie recommender system built in this paper

facilitates the understanding of how a recommender system works. To evaluate the
accuracy and relevancy of the results produced by our system, we analyse both the
approaches differently. We compare the Item based similarity coefficient results as
given in the above figure by mapping the Movie ID of Movie 1 and Movie 2 to
their titles. As evident from the table, movies which are similar are given a higher
similarity metric. For user-based recommender system, we evaluate the model
using the Average Absolute Difference Recommender Evaluator. We divide the
training data into test and train samples. Next, we evaluate the rating predictions on
test data against the actual ratings as specified in the training data. The figure
below shows the raw output from the user based filtering technique. The system
recommends 10 movies to user and returns the nearest neighbours which have
most similar taste preference as him. For each movie recommended, it also predicts
the ratings by that user. We get an average absolute difference of 0 which proves
that the predictions made on the ratings of the recommended items are 100%
accurate.

Conclusion:

In this paper we have implemented a movie recommendation system using

collaborative filtering. It is implemented using Apache Mahout and takes the
ratings given to movies to provide movie suggestions. Our system considers the
user ratings to recommend movies. In the future, more features such as the genre of
the movie, the directors, the actors and soon could be considered as well to provide
suggestions. In addition, a new framework called Apache Prediction 10 could be
looked into to develop the system instead of Mahout.

10.A Movie Recommender System: MOVREC

Title: A Movie Recommender System: MOVREC

Published by: Manoj Kumar, D.K. Yadav, Ankur Singh and Vijay Kr. Gupta

Related work:

Now a day’s recommendation system has changed the style of searching the
things of our interest. This is information filtering approach that is used to
predict the preference of that user. The most popular areas where recommender
system is applied are books, news, articles, music, videos, movies etc. In this
paper we have proposed a movie recommendation system named MOVREC.
It is based on collaborative filtering approach that makes use of the information
provided by users, analyzes them and then recommends the movies that is best
suited to the user at that time. The recommended movie list is sorted according to
the ratings given to these movies by previous users and it uses K-means
algorithm for this purpose. MOVREC also help users to find the movies of their
choices based on the movie experience of other users in efficient and effective
manner without wasting much time in useless browsing. This system has
been developed in PHP using Dreamweaver 6.0 and Apache Server 2.0. The
presented recommender system generates recommendations using various types
of knowledge and data about users, the available items, and previous transactions
stored in customized databases. The user can then browse the
recommendations easily and find a movie of their choice.

Methodology:

In today’s world where internet has become an important part of human life,
users often face the problem of too much choice. Right from looking for a
motel to looking for good investment options, there is too much information
available. To help the users cope with this information explosion, companies
have deployed recommendation systems to guide their users. The research in
the area of recommendation systems has been going on for several decades
now, but the interest still remains high because of the abundance of practical
applications and the problem rich domain. A number of such online
recommendation systems implemented and used are the recommendation
system for books at Amazon.com , for movies at MovieLens.org, CDs at
CDNow.com (from Amazon.com), etc. Recommender Systems have added to
the economy of the some of the e-commerce websites (like Amazon.com)
and Netflix which have made these systems a salient parts of their websites.

Recommender Systems generate recommendations; the user may accept them

according to their choice and may also provide, immediately or at a next stage,
an implicit or explicit feedback. The actions of the users and their feedbacks can be
stored in the recommender database and may be used for generating new
recommendations in the next user-system interactions. The economic potential
of theses recommender systems have led some of the biggest e-commerce
websites (like Amazon.com, snapdeal.com) and the online movie rental company
Netflix to make these systems a salient part of their websites. High quality
personalized recommendations add another dimension to user experience. The
web personalized recommendation systems are recently applied to provide
different types of customized information to their respective users. These
systems can be applied in various types of applications and are very common
now a day.

Conclusion:

In this paper we have introduced MovieREC, a recommender system for movie

recommendation. It allows a user to select his choices from a given set of
attributes and then recommend him a movie list based on the cumulative weight of
different attributes and using K-means algorithm. By the nature of our system, it is
not an easy task to evaluate the performance since there is no right or wrong
recommendation; it is just a matter of opinions. Based on informal evaluations that
we carried out over a small set of users we got a positive response from them.
We would like to have a larger data set that will enable more meaningful results
using our system. Additionally we would like to incorporate different machine
learning and clustering algorithms and study the comparative results.
Eventually we would like to implement a web based user interface that has a
user database, and has the learning model tailored to each user.

11.Machine Learning Model for Movie Recommendation System

Title: Machine Learning Model for Movie Recommendation System

Published by: M. Chenna Keshava, S. Srinivasulu

Related work:

The primary aim of recommendation systems is to recommend applicable objects

to a consumer-based totally on ancient data. If a movie is rated excessive by means
of a consumer who also watched the movie you are watching now, it's miles
possibly to show up inside the recommendations. The films with the highest
overall scores are in all likelihood to be enjoyed by way of nearly everyone. The
algorithm which does all these features is called CineMatch. For personal users, it
also learns from the conduct of the person to higher expect a movie the consumer
is anticipated to be fascinated in. Here we have to increase our CineMatch
algorithm 10% by using fashionable collaborative filtering techniques.

Methodology:

A. User-Item Sparse Matrix

In the User-Item matrix, each row represents a person and every column represents
an object and every cell represents rating given with the id of a user to an item.

B. User-User Similarity Matrices

Here, two customers could be similar to the premise of the comparable ratings
given with the id of each of them. If any two users are similar then it means both of
them have given very comparable scores to the items due to the fact here the
consumer vector is nothing however the row of a matrix which in flip contains
rankings given through user to the items. Now considering cosine similarity can
variety from ‘0’ to ‘1’ and ‘1’ means the highest similarity, so consequently, all the
diagonal elements could be ‘1’ because the similarity of the consumer with
him/herself is the highest. But there's one hassle with user-user similarity. User
alternatives and tastes change over time. If any consumer favored some item one
year in the past then it isn't important that he/she will like the identical object even
today.

C. Item-Item Similarity Matrix

Here, two items can be comparable to the idea of the comparable rankings given to
each of the items via all of the users. If any two gadgets are comparable then it
means both of them had been given very comparable ratings by means of all of the
users due to the fact here the item vector is nothing however the column of the
matrix which in flip contains scores given with the aid of consumer to the objects.
Now due to the fact cosine similarity can variety from ‘0’ to ‘1’ and ‘1’ means the
highest similarity, so consequently, all of the diagonal elements might be ‘1’ due to
the fact the similarity of an item with the identical item is the highest.

D. Cold Start Problem

The cold start problem concerns the personalized guidelines for users without a
few past histories (new users). Providing suggestions to users with small beyond
history turns into tough trouble for CF models due to the fact their studying and
predictive ability is limited.

Conclusion:

So, far our best model is SVDpp with Test RMSE of 1.0675.Here we are not much
worried about our RMSE because we haven’t trained it on the whole data . Our
main intention here is to learn more about Recommendation Systems .If we taken
whole data we would definitely get better RMSE . Tune hyper parameters of all the
Xgboost models above to improve the RMSE. Here we used 10K users and 1K
movies to train the above models due to my pc ram issues. In the future, I am going
to run on the entire information set using cloud resources.

12.Content Based Movie Recommendation System

Title: Content Based Movie Recommendation System

Published by: N. Pradeep *, K. K. Rao Mangalore, B. Rajpal, N. Prasad, R. Shastri

Related work:

Recommendation based systems can be used for recommending different web

page, books, restaurants, tv shows, movies etc. The aim of movie recommendation
system is to recommend movies to different users based on their interests. This
helps the user to save time browsing the internet looking for movies from the
thousand already existing ones. Content-based recommendation system describes
the items that may be recommended to the user. Based on a data set, it predicts
what movies a user will like considering the attributes present in the previously
liked movies. Recommendation systems can recommend movies based on one or a
combination of two or more attributes. While designing a movie recommendation
system various factors are considered such as the genre of the movie, the director
or the actors present in it. In this paper, the recommendation system has been built
on cast, keywords, crew, and genres. A single column is created which will be the
sum of all the 4 attributes, and it acts as a dominant factor for this movie
recommender system.

Methodology:
The enhancement of science and technology leads to make the life more
comfortable than older days. The emerging technologies like neutrosophic shortest
path, transportation problem, uncertainty problem, fuzzy shortest path, powershell,
wireless sensor network, computer language, neural network, routing, image
processing making the products more intelligent and self-healing based. The smart
city applications like smart water, smart grid, smart parking, smart resource
management, etc. are based on IoT and IoE technologies. In this manuscript, the
recommendation system has been built on cast, keywords, crew, & genres. The
recommendation system aims to predict or take users’ interests and recommend
related items that quite likely are interesting for them. The growth in the amount of
information that is available online and the increase in the number of Internet users
has created an overload of information which makes it difficult to find the correct
information at the right time. The recommender system solves this problem by
filtering the required data from a large amount of information that is generated
based on the user’s interest or preferences. Recommender systems are used for
recommending products, generating playlists, matchmaking, and a lot more.
Recommender systems function with characteristic information and user-item
interactions. Characteristic information is the information about the user and the
items whereas user-item interaction is the information regarding ratings, the
number of purchases, likes of the users, and many more. Based on this, the
recommendation system can be developed using collaborative filtering, content-
based filtering, or hybrid filtering.

Collaborative Filtering:

This system identifies users with similar tastes and uses their opinion to
recommend the same to another user with similar interest. It generates
recommendations using information about rating profiles for different users or
items. It has been implemented in different applications such as YouTube, Netflix,
and Spotify. It is a widely used approach and is used as a part of the hybrid system.

Content-Based Filtering:

Content-based filtering methods are done based on user characteristics. This

method is used in situations where data is known on an item such as name,
location, or description and not on the user. It predicts the items based on user’s
information and completely ignores contributions from other users as with the case
of collaborative techniques. It uses the data that is provided by the user either
explicitly or implicitly. When the user provides more content-based filtering
mechanisms actions on the recommendations such as content-based recommender
the engine becomes more and more accurate.

Hybrid Approach:

A hybrid approach is a combination of collaborative filtering content-based

filtering, or any other approaches. Hybrid approaches can be implemented by
making predictions separately on content-based and collaborative-based approach
and later combining them. It increases the accuracy and performance of the
recommender systems..

Conclusion:

Information retrieval has become very difficult nowadays because of the

overloading of data and this issue has restricted the users from accessing the items
that best match their preferences. This is where the recommendation system comes
into use. It helps to retrieve personalized information for different users. Also,
movies have become a popular medium of entertainment but also the concern of
what to watch is also rising along. The content-based recommendation approach
does not consider other user profiles while making recommendations. This will
help the user get personalized suggestions for their input.

13.Sentiment Analysis of Movie Review using Machine Learning

Techniques

Title: Sentiment Analysis of Movie Review using Machine Learning Techniques

Published by: Thirupathi Rao Komati

Related work:

Today's online world was fully filled up with blogs, views, comments, posts
through various websites and social-surfs. People were habituated with posting
every incident into blogs, messed with comments like text and emotions, which are
a mixed bag of sad, happy, worry, cry etc. Analysing such data was called as
Sentimental Analysis. To analysis, these unordered data we use new emerged
technology algorithms. Machine learning a transpire technology which is engaged
with almost all the fields, where its algorithms are more powerful that give with
better faultless results. In this paper, we are analyzing tweets based on movie
reviews using the Multinomial Logistic Regression, Naïve Bayes, and SVM
algorithms to compare score value to show the best text analysis algorithm.

Methodology:

A model is proposed to analyze the data using tweet dataset. There are few steps
that process the tweets

a. Data Preparation from Twitter

b. Pre-processing
c. Creating dataset

d. Applying Algorithms

Data Preparation from Twitter:

Firstly, to get data for sentiment, we need to retrieve data from Twitter. We need to
access them through Twitter API. Steps as follows,

• Register with Twitter application developer’s portal to get authentication for

getting data from Twitter.

• After the application is created with your twitter account, we need to access the
Access Tokens and Keys, they provided. consumer_secret: < Your Twitter
Consumer Secret Key> consumer_key: <Your Twitter Consumer Key>
access_token: < Your Twitter Access Token Key > access_secret: < Your Twitter
Access Secret Key >

• Now run the code to fetch the data from Twitter.

• It creates a TEXT file into the same directory.

Pre-processing of datasets:

A tweet is combination different opinions. It might be structured or unstructured or

uses some different own languages to express the feelings in a Tweet form. For
processing these tweets, we need to first classify them positive and negative tweets
by pre-processing steps that are to be followed as follows,

• Eliminate all URLs, hashtags, targets.

• Correct the spellings and repeated characters.

• Substitute all emotag with their respective sentiments like happy sad, fear etc.

• Eliminate stop words

• Remove Non-Negative Tweets

Creating Datasets:

To process data and extract the file as .csv into your directory,

• For data, pre-processing, extract the data from a text file to process it.

• It follows the all the previous steps to change the data.

• Finally, it automatically creates the .csv file into the same directory.

Conclusion:

Sentiment Analysis is just a part of social media monitoring platform which will be
beneficial for a business to improve the productivity. It shows the ones feeling or
opinion over an object. We conclude by that Multinomial Naïve Bayes with
Machine Learning algorithm that produces an improvised result when compared to
the other classifier algorithms for language processing like Multinomial Logistic
Regression and Support Vector Machine (SVM).

14.An Improved Collaborative Movie Recommendation System using

Computational Intelligence

Title: An Improved Collaborative Movie Recommendation System using

Computational Intelligence

Published by: Zan Wang, Xue Yu* , Nan Feng, Zhenhua Wang
Related work:

Recommendation systems have become prevalent in recent years as they dealing

with the information overload problem by suggesting users the most relevant
products from a massive amount of data. For media product, online collaborative
movie recommendations make attempts to assist users to access their preferred
movies by capturing precisely similar neighbors among users or movies from their
historical common ratings. However, due to the data sparsely, neighbor selecting is
getting more difficult with the fast increasing of movies and users. In this paper, a
hybrid model-based movie recommendation system which utilizes the improved K-
means clustering coupled with genetic algorithms (GA) to partition transformed
user space is proposed. It employs principal component analysis (PCA) data
reduction technique to dense the movie population space which could reduce the
computation complexity in intelligent movie recommendation as well. The
experiment results on Movielens dataset indicate that the proposed approach can
provide high performance in terms of accuracy, and generate more reliable and
personalized movie recommendations when compared with the existing methods.

Methodology:

Fast development of internet technology has resulted in explosive growth of

available information over the last decade. Recommendation systems (RS), as one
of the most successful information filtering applications, have become an efficient
way to solve the information overload problem. The aim of Recommendation
systems is to automatically generate suggested items (movies, books, news, music,
CDs, DVDs, webpages) for users according to their historical preferences and save
their searching time online by exacting useful data. Movie recommendation is the
most widely used application coupled with online multimedia platforms which
aims to help customers to access preferred movies intelligently from a huge movie
library. A lot of work has been done both in the academic and industry area in
developing new movie recommendation algorithms and extensions. The majority
of existing recommendation systems is based on collaborative filtering (CF)
mechanism which has been successfully developed in the past few years. It first
collects ratings of movies given by individuals and then recommends promising
movies to target customer based on the “like-minded” individuals with similar
tastes and preferences in the past. There have been many famous online
multimedia platforms (e.g., youtube.com, Netflix.com, and douban.com)
incorporated with CF technique to suggest media products to their customers.
However, traditional recommendation systems always suffer from some inherent
limitations: poor scalability, data sparsity and cold start problems. A number of
works have developed model-based approaches to deal with these problems and
proved the benefits on prediction accuracy in RS. Model-based CF uses the user-
item ratings to learn a model which is then used to generate online prediction.
Clustering and dimensionality reduction techniques are often employed in model-
based approaches to address the data sparse problem. The sparsity issues arise due
to the insufficiency of user’s history rating data and it is made even more severe in
terms of the dramatically growth of users and items. Moreover, high-dimensional
rating data may cause it difficult to extract common interesting users by similarity
computation, which results in poor recommendations. In the literature, there have
been many model-based recommendation systems developed by partitioning
algorithms coupled, such as Kmeans and self-organizing maps (SOM). The aim of
clustering is to divide users into different groups to form “like-minded” (nearest)
neighbors instead of searching the whole user space, which could dramatically
improve the system scalability. It has been proved that clustering-based
recommendation systems outperform the pure CF-based ones in terms of efficiency
and prediction quality. In many works, the clustering methods are conducted with
the entire dimensions of data which might lead to somewhat inaccuracy and
consume more computation time. In general, making high quality movie
recommendations is still a challenge, and exploring an appropriate and efficiency
clustering method is a crucial problem in this situation.

Conclusion:

In this paper we develop a hybrid model-based CF approach to generate movie

recommendations which combines dimensional reduction technique with clustering
algorithm. In the sparse data environment, selection of “like-minded”
neighborhood on the basis of common ratings is a vital function to generate high
quality movie recommendations. In our proposed approach, feature selection based
on PCA was first performed on whole data space, and then the clusters were
generated from relatively low dimension vector space transformed by the first step.
In this way, the original user space becomes much denser and reliable, and used for
neighborhood selection instead of searching in the whole user space. In addition, to
result in best neighborhood, we apply genetic algorithms to optimize K-means
process to cluster similar users. Based on the Movielens dataset, the experimental
evaluation of the proposed approach proved that it is capable of providing high
prediction accuracy and more reliable movie recommendations for users’
preference comparing to the existing clustering-based CFs. As for cold-start issue,
the experiment also demonstrated that our proposed approach is capable of
generating effective estimation of movie ratings for new users via traditional movie
recommendation systems. As for future work, we will continue to improve our
approach to deal with higher dimensionality and sparsity issues in practical
environment, and will explore more effective data reduction algorithms to couple
with clustering-based CF. Furthermore, we will study how the variation number of
clusters may influence the movie recommendation scalability and reliability. To
generate high personalized movie recommendations, other features of users, such
as tags, context, and web of trust should be considered in our future studies.

15.Matrix Factorization Techniques for Recommender Systems

Title: Matrix Factorization Techniques for Recommender Systems

Published by: Y. Koren, R. Bell and C. Volinsky

Related work:

As the Netflix Prize competition has demonstrated, matrix factorization models are
superior to classic nearest neighbor techniques for producing product
recommendations, allowing the incorporation of additional information such as
implicit feedback, temporal effects, and confidence levels.

Modern consumers are inundated with choices. Electronic retailers and content
providers offer a huge selection of products, with unprecedented opportunities to
meet a variety of special needs and tastes. Matching consumers with the most
appropriate products is key to enhancing user satisfaction and loyalty. Therefore,
more retailers have become interested in recommender systems, which analyze
patterns of user interest in products to provide personalized recommendations that
suit a user’s taste. Because good personalized recommendations can add another
dimension to the user experience, e-commerce leaders like Amazon.com and
Netflix have made recommender systems a salient part of their websites. Such
systems are particularly useful for entertainment products such as movies, music,
and TV shows. Many customers will view the same movie, and each customer is
likely to view numerous different movies. Customers have proven willing to
indicate their level of satisfaction with particular movies, so a huge volume of data
is available about which movies appeal to which customers. Companies can
analyze this data to recommend movies to particular customers.

Methodology:

Matrix factorization methods:

Some of the most successful realizations of latent factor models are based on
matrix factorization. In its basic form, matrix factorization characterizes both items
and users by vectors of factors inferred from item rating patterns. High
correspondence between item and user factors leads to a recommendation. These
methods have become popular in recent years by combining good scalability with
predictive accuracy. In addition, they offer much flexibility for modeling various
real-life situations. Recommender systems rely on different types of input data,
which are often placed in a matrix with one dimension representing users and the
other dimension representing items of interest. The most convenient data is high-
quality explicit feedback, which includes explicit input by users regarding their
interest in products. For example, Netflix collects star ratings for movies, and TiVo
users indicate their preferences for TV shows by pressing thumbs-up and thumbs-
down buttons. We refer to explicit user feedback as ratings. Usually, explicit
feedback comprises a sparse matrix, since any single user is likely to have rated
only a small percentage of possible items. One strength of matrix factorization is
that it allows incorporation of additional information. When explicit feedback is
not available, recommender systems can infer user preferences using implicit
feedback, which indirectly reflects opinion by observing user behavior, including
purchase history, browsing history, search patterns, or even mouse movements.
Implicit feedback usually denotes the presence or absence of an event, so it is
typically represented by a densely filled matrix.
Conclusion:

Matrix factorization techniques have become a dominant methodology within

collaborative filtering recommenders. Experience with datasets such as the Netflix
Prize data has shown that they deliver accuracy superior to classical nearest-
neighbor techniques. At the same time, they offer a compact memory-efficient
model that systems can learn relatively easily. What makes these techniques even
more convenient is that models can integrate naturally many crucial aspects of the
data, such as multiple forms of feedback, temporal dynamics, and confidence
levels.

REFERENCES:

[1] G. Popescu, Group recommender systems as a voting problem, in Online

Communities and Social Computing, ser. Lecture Notes in Computer Science,
A.Ozok and P. Zaphiris, Eds. Springer Berlin Heidelberg, vol. 8029, pp. 412–421,
2013.

[2] Jain, A., & Vishwakarma, S. K., Collaborative Filtering for Movie
Recommendation using RapidMiner International Journal of Computer
Applications (0975 - 8887) Vol. 169 - No. 6, 2017.

[3] J. Sun, G. Wang, X. Cheng, and Y. Fu, Mining affective text to improve social
media movies recommendation, Information Processing & Management, vol. 51,
no. 4, pp. 444–457, 2015.

[4] K. Soni, R. Goyal, B. Vadera, and S. More, A Three Way Hybrid Movie
Recommendation System, International Journal of Computer Applications, vol.
160, no. 9, pp. 29–32, 2017.
[5] Wu, C.-S. M., Garg, D., & Bhandary, U. (2018). Movie Recommendation
System Using Collaborative Filtering. 2018 IEEE 9th International Conference on
Software Engineering and Service Science (ICSESS).
doi:10.1109/icsess.2018.8663822.

[6] International Journal of Engineering and Advanced Technology (IJEAT) ISSN:

2249 – 8958 (Online), Volume-9 Issue-5, June 2020 556 DOI:
10.35940/ijeat.E9666.069520 Movie Recommendation System using Cosine
Similarity and KNN Ramni Harbir Singh, Sargam Maurya, Tanisha Tripathi,
Tushar Narula, Gaurav Srivastav.

[7] Reddy, S., Nalluri, S., Kunisetti, S., Ashok, S., & Venkatesh, B. (2018).
Content-Based Movie Recommendation System Using Genre Correlation. Smart
Innovation, Systems and Technologies, 391–397. doi:10.1007/978-981-13-1927-
3_42.

[8] MOVIE RECOMMENDATION SYSTEM USING MACHINE LEARNING

ALGORITHM Manjunath Reddy R*1,Ms.LathaR, International Research and
Development Journal in Engineering & Science

[9] Movie Recommendation System Ananya Agarwal1, S. Srinivasan nternational

Research Journal of Engineering and Technology (IRJET).

[10] Mohamed Sarwat, Justin J Levandoski, Ahmed Eldawy, and Mohamed F

Mokbel. Lars An efficient and scalable location-aware recommender system. IEEE
Transactions on Knowledge and Data Engineering, 26(6):1384–1399, 2014.

[11] Machine Learning Model for Movie Recommendation System May

2020International Journal of Engineering and Technical Research V9(04)
DOI:10.17577/IJERTV9IS040741.
[12] Content Based Movie Recommendation System N. Pradeep * , K. K. Rao
Mangalore, B. Rajpal, N. Prasad, R. Shastri International Journal of Research in
Industrial Engineering.

[13] Uma Ramya, V., & Thirupathi Rao, K. (2018). Sentiment Analysis of Movie
Review using Machine Learning Techniques. International Journal of Engineering
& Technology, 7(2.7), 676. doi:10.14419/ijet.v7i2.7.10921.

[14] Wang, Z., Yu, X., Feng, N., & Wang, Z. (2014). An improved collaborative
movie recommendation system using computational intelligence. Journal of Visual
Languages & Computing, 25(6), 667–675. doi:10.1016/j.jvlc.2014.09.011.

[15] Y. Zhang, D. Zhang, M. M. Hassan, A. Alamri, and L. Peng, CADRE: Cloud-

Assisted Drug Recommendation Service for Online Pharmacies, Mobile Networks
and Applications, vol. 20, no. 3, pp. 348–355, 2015.

[16] J. R. Priester and R. E. Petty, The Gradual Threshold Model of Ambivalence:

Relating the Positive and Negative Bases of Attitudes to Subjective Ambivalence,
Journal of Personality and Social Psychology, vol. 71, no. 3, pp. 431–449, 1996.

[17] J. Sun, W. Xu, J. Ma, and J. Sun, Leverage RAF to find domain experts on
research social network services: A big data analytics methodology with
MapReduce framework, International Journal of Production Economics, vol. 165,
pp. 185–193, 2015.

[18] Y. Koren, R. Bell and C. Volinsky. Matrix Factorization Techniques for

Recommender Systems, Computer, vol. 42, n. 8, p. 30-37, 2009.