Combining multiple metadata types in movies recommendation using ensemble algorithms

In this paper, we analyze the application of ensemble algorithms to improve the ranking recommendation problem with multiple metadata. We propose three generic ensemble strategies that do not require modification of the recommender algorithm. They combine predictions from a recommender trained with distinct metadata into a unified rank of recommended items. The proposed strategies are Most Pleasure, Best of All and Genetic Algorithm Weighting. The evaluation using the HetRec 2011 MovieLens 2k dataset with five different metadata (genres, tags, directors, actors and countries) shows that our proposed ensemble algorithms achieve a considerable 7% improvement in the Mean Average\ud Precision even with state-of-art collaborative filtering algorithms

Recommendations based on social links

The goal of this chapter is to give an overview of recent works on the development of social link-based recommender systems and to offer insights on related issues, as well as future directions for research. Among several kinds of social recommendations, this chapter focuses on recommendations, which are based on users’ self-defined (i.e., explicit) social links and suggest items, rather than people of interest. The chapter starts by reviewing the needs for social link-based recommendations and studies that explain the viability of social networks as useful information sources. Following that, the core part of the chapter dissects and examines modern research on social link-based recommendations along several dimensions. It concludes with a discussion of several important issues and future directions for social link-based recommendation research

Recommendation of Algorithm for Efficient Retrieval of Songs from Musical Dataset

Now-a-days, the research is more towards the entertainment like music, songs, movies, etc. There are many existing works that suggest good songs, movies to people depending on their mood, nature and time that has been savior for the society during the days of lockdown. The existing algorithms used in the literature for basic clustering  are K-means, TSNE (T- distributed Stochastic Neighborhood Embedding), PCA (Principal Component Analysis).In this paper, the music dataset considered, consists of songs with attributes as song name, genres, artists, mode, tempo, valence, year, liveness, loudness, popularity, acousticness, danceability, duration, energy, explicit, instrumentalness, key. The important feature is extracted from the other features with the support of literature survey i.e., number of music listeners, types of the songs and type of the music. Later, the dataset is divided into clusters using traditional technique that is k-means based on genre, an important attribute which is selected from the above attributes. The different classifier models like Random Forest, Extra Trees, LightGBM, XGBoost, CatBoost classifier are applied on the clustered dataset and the results have been evaluated on each individual algorithm. Thus the paper recommends not only the group of relevant songs but also suggests the best accurate classification algorithm that can be used for any mentioned musical dataset. The paper also compares all the said ensemble algorithms by calculating the precision, recall, f1-score and support. The accuracy is also calculated for all said ensemble algorithms and based on the accuracy the best suitable algorithm is suggested

Recommender systems in industrial contexts

This thesis consists of four parts: - An analysis of the core functions and the prerequisites for recommender systems in an industrial context: we identify four core functions for recommendation systems: Help do Decide, Help to Compare, Help to Explore, Help to Discover. The implementation of these functions has implications for the choices at the heart of algorithmic recommender systems. - A state of the art, which deals with the main techniques used in automated recommendation system: the two most commonly used algorithmic methods, the K-Nearest-Neighbor methods (KNN) and the fast factorization methods are detailed. The state of the art presents also purely content-based methods, hybridization techniques, and the classical performance metrics used to evaluate the recommender systems. This state of the art then gives an overview of several systems, both from academia and industry (Amazon, Google ...). - An analysis of the performances and implications of a recommendation system developed during this thesis: this system, Reperio, is a hybrid recommender engine using KNN methods. We study the performance of the KNN methods, including the impact of similarity functions used. Then we study the performance of the KNN method in critical uses cases in cold start situation. - A methodology for analyzing the performance of recommender systems in industrial context: this methodology assesses the added value of algorithmic strategies and recommendation systems according to its core functions.Comment: version 3.30, May 201