Clustering Techniques for Recommendation of Movies

A recommendation system employs a variety of algorithms to provide users with recommendations of any kind. The most well-known technique, collaborative filtering, involves users with similar preferences although it is not always as effective when dealing with large amounts of data. Improvements to this approach are required as the dataset size increases. Here, in our suggested method, we combine a hierarchical clustering methodology with a collaborative filtering algorithm for making recommendations. Additionally, the Principle Component Analysis (PCA) method is used to condense the dimensions of the data to improve the accuracy of the outcomes. The dataset will receive additional benefits from the clustering technique when using hierarchical clustering, and the PCA will help redefine the dataset by reducing its dimensionality as needed. The primary elements utilized for recommendations can be enhanced by applying the key elements of these two strategies to the conventional collaborative filtering recommendation algorithm. The suggested method will unquestionably improve the precision of the findings received from the conventional CFRA and significantly increase the effectiveness of the recommendation system. The total findings will be applied to the combined dataset of TMDB and Movie Lens, which is utilized to suggest movies to the user in accordance with the rating patterns that each individual user has generated

Recommendation system using the k-nearest neighbors and singular value decomposition algorithms

Nowadays, recommendation systems are used successfully to provide items (example: movies, music, books, news, images) tailored to user preferences. Amongst the approaches existing to recommend adequate content, we use the collaborative filtering approach of finding the information that satisfies the user by using the reviews of other users. These reviews are stored in matrices that their sizes increase exponentially to predict whether an item is relevant or not. The evaluation shows that these systems provide unsatisfactory recommendations because of what we call the cold start factor. Our objective is to apply a hybrid approach to improve the quality of our recommendation system. The benefit of this approach is the fact that it does not require a new algorithm for calculating the predictions. We are going to apply two algorithms: k-nearest neighbours (KNN) and the matrix factorization algorithm of collaborative filtering which are based on the method of (singular-value-decomposition). Our combined model has a very high precision and the experiments show that our method can achieve better results

Building a Course Recommender System for The College of Wooster

The goal of this project is to investigate the approaches for building recommender systems and to apply them to implement a course recommender system for the College of Wooster. There are three main objectives of this project. The first is to understand the mathematics and computer science aspects behind it. The mathematic concepts built into this project include probability, statistics and linear algebra. The final product is consist of two components: a collection of Python scripts containing the implementation code of the course recommender system, and a simple user interface allowing people to use the recommender system without typing commands. The second goal is to analyze the pros and cons of different approaches by comparing their performance on the same training data set which have information about students and courses at the college in the last seven years. The final goal is to apply the best model to build the course recommender system that can provide helpful and personalized course recommendations to students

Content Based Cross-Domain Recommendation Using Linked Open Data

A recommender system, irrespective of theapproach that has been used to implement it suffers fromthe cold-start situation. Not being able to predict items to anew user due to not having access to his previouspreferences, and not being able to recommend a new item tousers due to not having any prior ratings on theparticular item is the two cold-start problems. Even thoughcontent-based recommender systems are immune to itemcold-start problem, they are comparatively less used due tolack of up-to-date data sources that provide item featuresand also due to the high amount of pre-processing requiredwhen using existing data sources for retrieving meta-data.In this paper we present a content-based cross domainrecommendation system using Linked Open Data toaddress the issue of cold-start situation. The evaluationproves that this approach can be used as a solution to a coldstartsituation and also the prevailing issue of content-basedrecommender systems which forced them to take thebackseat will no longer be applicable when Linked OpenData is used

A new curve fitting based rating prediction algorithm for recommender systems

summary:The most algorithms for Recommender Systems (RSs) are based on a Collaborative Filtering (CF) approach, in particular on the Probabilistic Matrix Factorization (PMF) method. It is known that the PMF method is quite successful for the rating prediction. In this study, we consider the problem of rating prediction in RSs. We propose a new algorithm which is also in the CF framework; however, it is completely different from the PMF-based algorithms. There are studies in the literature that can increase the accuracy of rating prediction by using additional information. However, we seek the answer to the question that if the input data does not contain additional information, how we can increase the accuracy of rating prediction. In the proposed algorithm, we construct a curve (a low-degree polynomial) for each user using the sparse input data and by this curve, we predict the unknown ratings of items. The proposed algorithm is easy to implement. The main advantage of the algorithm is that the running time is polynomial, namely it is $\theta(n^2)$, for sparse matrices. Moreover, in the experiments we get slightly more accurate results compared to the known rating prediction algorithms

A methodology for contextual recommendation using artificial neural networks

“A thesis submitted to the University of Bedfordshire, in partial fulfilment of the requirements for the degree of Doctor of Philosophy”.Recommender systems are an advanced form of software applications, more specifically decision-support systems, that efficiently assist the users in finding items of their interest. Recommender systems have been applied to many domains from music to e-commerce, movies to software services delivery and tourism to news by exploiting available information to predict and provide recommendations to end user. The suggestions generated by recommender systems tend to narrow down the list of items which a user may overlook due to the huge variety of similar items or users’ lack of experience in the particular domain of interest. While the performance of traditional recommender systems, which rely on relatively simpler information such as content and users’ filters, is widely accepted, their predictive capability perfomrs poorly when local context of the user and situated actions have significant role in the final decision. Therefore, acceptance and incorporation of context of the user as a significant feature and development of recommender systems utilising the premise becomes an active area of research requiring further investigation of the underlying algorithms and methodology. This thesis focuses on categorisation of contextual and non-contextual features within the domain of context-aware recommender system and their respective evaluation. Further, application of the Multilayer Perceptron Model (MLP) for generating predictions and ratings from the contextual and non-contextual features for contextual recommendations is presented with support from relevant literature and empirical evaluation. An evaluation of specifically employing artificial neural networks (ANNs) in the proposed methodology is also presented. The work emphasizes on both algorithms and methodology with three points of consideration:\ud contextual features and ratings of particular items/movies are exploited in several representations to improve the accuracy of recommendation process using artificial neural networks (ANNs), context features are combined with user-features to further improve the accuracy of a context-aware recommender system and lastly, a combination of the item/movie features are investigated within the recommendation process. The proposed approach is evaluated on the LDOS-CoMoDa dataset and the results are compared with state-of-the-art approaches from relevant published literature

Towards a social and context-aware mobile recommendation system for tourism

[EN] Loyalty in tourism is one of the main concerns for tourist organizations and researchers alike. Recently, technology in general and CRM and social networks in particular have been identified as important enablers for loyalty in tourism. This paper presents POST-VIA 360, a platform devoted to support the whole life-cycle of tourism loyalty after the first visit. The system is designed to collect data from the initial visit by means of pervasive approaches. Once data is analysed, POST-VIA 360 produces accurate after visit data and, once returned, is able to offer relevant recommendations based on positioning and bio-inspired recommender systems. To validate the system, a case study comparing recommendations from the POST-VIA 360 and a group of experts was conducted. Results show that the accuracy of system’s recommendations is remarkable compared to previous efforts in the field