Professional Documents
Culture Documents
ISSN No:-2456-2165
Travel Companion
Vishal Israni1, Raaj Raisinghani2, Varun Rathi3 Charusheela Nehete4
Student, Department of Information Technology Assistant Professor, Department of Information Technology
Vivekanand Education Society’s Institute of Technology, Vivekanand Education Society’s Institute of Technology,
Mumbai Mumbai
Abstract:- This paper presents a generalized and effective are trusted more than recommendations from others. This
methodology for recommending various entertainment information is used in the decision on which movie to see.[1]
parameters which can be very helpful while traveling The algorithm calculates the similarity between two users or
using various AI and ML algorithms. A product that items, and produces a prediction for the user by taking the
recommends the user books, movies, TV shows, songs and weighted average of all the ratings. Similarity computation
places to visit based on their past preferences and the between items or users is an important part of this approach.
time they have at their disposal. Use of content based, Multiple measures, such as Pearson correlation and vector
collaborative filtering, hybrid algorithms and cosine based similarity are used for this. The Pearson
demographic based recommender systems to filter the correlation similarity of two users x, y is defined as
results and recommend them to the user. An additional
feature of filtering results based on time constraint is also
implemented. Blockchain-based micropayments and
other features such as Proof of work and Proof of
authority are used for pay per use feature and OAuth will
ensure the user’s authentication. Equation 1.1 : Pearson Correlation Similarity
Keywords:- Blockchain, Machine Learning, Hybrid Filtering, where Ixy is the set of items rated by both user x and
Content-Based Filtering, Collaborative Filtering, user y.[2]
Demographic-Based Filtering, Proof of Work, Proof of
Authority. B. Content Based Filtering
Content-based filtering, also referred to as cognitive
I. INTRODUCTION filtering, recommends items based on a comparison between
the content of the items and a user profile. The content of
The current recommendation systems are quite specific each item is represented as a set of descriptors or terms,
in their usage and there is a lack of a good application that typically the words that occur in a document. The user profile
suffices all the user’s needs of a recommendation system all is represented with the same terms and built up by analyzing
integrated in one platform. the content of items which have been seen by the user. [3]
The algorithm makes use of cosine similarity and finds the
The portal is aimed at providing the user with relation between the user and the item in consideration.
entertainment which the user will tend to like. The time
constraint feature aids the user in selecting relevant content
without fussing over irrelevant recommendations. This
application will ensure the social well-being of an individual.
Various domains covered are Movies, TV shows, books, Equation 1.2 : User and Item Correlation
Songs and places to visit. The product intends to deliver the
user, the most relevant recommendations through a self- C. Hybrid Recommender Systems
explanatory and simplistic Graphical User Interface, along Both, content based and collaborative filtering have
with the liberty to pay only for what the user really wants, strengths and weaknesses. Four specific problems can be
secured by the robust blockchain. distinguished for collaborative filtering :
Cold start, Sparsity, First rater, popularity bias.
A. Collaborative Filtering
Collaborative filtering, also referred to as social Whereas, Content based filtering faces issues with :
filtering, filters information by using the recommendations of Content description, Over specialization, subjective
other people. It is based on the idea that people who agreed in problem domain [4].
their evaluation of certain items in the past are likely to agree
again in the future. A person who wants to see a movie for A system that combines content-based filtering and
example, might ask for recommendations from friends. The collaborative filtering could take advantage from both the
recommendations of some friends who have similar interests representation of the content as well as the similarities among
users. Although there are several ways in which to combine
where, v is the number of votes for the movie m is the C. Books Recommendation:-
minimum votes required to be listed in the chart R is the For recommending books, collaborative filtering is
average rating of the movie C is the mean vote across the being used where similar users are studies and
whole report. The algorithm works fine and suggests popular recommendations are made based on books liked by the
movies with high ratings and most likely to be liked by most group of those similar users amongst themselves.
of the users. And the algorithm also works great for genre-
specific popular movies. That is, when asked for popular
movies under a specific genre, it gives appropriate results for
an average user. But, the recommender we built in the
previous section suffers some severe limitations. For one, it Equation 2.3.1 : Formula for Similarity
gives the same recommendation to everyone, regardless of
the user's personal taste. And to have something which k-nearest neighbour method is used for clustering and
recommends based on user choices and more personalised forms the basis for user-based collaborative filtering
stuff, we used content based on collaborative filtering.
The function used for similarity between users is :
Content Based:-
For ‘The Dark Knight’, our system is able to identify it
as a Batman film and subsequently recommend other Batman
films as its top recommendations. But this is not of much use Equation 2.3.2 : Similarity between Users
to most people as it doesn't take into considerations very
important features such as cast, crew, director and genre, Where p(a,i) is the prediction for target user a for item
which determine the rating and the popularity of a movie. i, w(a,u) is the similarity between users a and u, and K is the
Someone who liked The Dark Knight probably likes it more neighbourhood of most similar users.
because of Nolan and would hate Batman Forever and every
other substandard movie in the Batman Franchise. Therefore, The other approach, i.e. item-based collaborative
more suggestive metadata like cast, crew, director filtering will use the following formula :
information etc was also considered When made different
considerations, the recommendation list changes towards
more relevant results.
IP Address Location:-
Fig 2:- Critic Review Plot Location is detected based on nearest Public IP Address
on a device (which can be a computer, the router it is
connected to, or the ISP the router uses). The location
depends on the IP information available, but in many cases
where the IP is hidden behind Internet Service Provider
NAT, the accuracy is only to the level of a city, region or
even country.
F. Surprise Element:-
Fig 3:- User Review Plot Many a times, when user is bored and psychologically
is not able to decide what to do - whether to watch a movie,
Based on these parameters, average ratings are or listen to some music or binge on a TV show. In such a
calculated and using similarity measures between similar case, the system simply pops up with some random
users and between user - TV shows, recommendation list is personalised element (can be a movie, a book, or any such
generated. thing) and recommends the user to go for the same.
REFERENCES