A Novel Overlapping Method to Alleviate the Cold-Start Problem in Recommendation Systems

Author(s):  
Ali M. Ahmed Al-Sabaawi ◽  
Hacer Karacan ◽  
Yusuf Erkan Yenice

Recommendation systems (RSs) are tools for interacting with large and complex information spaces. They provide a personalized view of such spaces, prioritizing items likely to be of interest to the user. The main objective of RSs is to tool up users with desired items that meet their preferences. A major problem in RSs is called: “cold-start”; it is a potential problem called so in computer-based information systems which comprises a degree of automated data modeling. Particularly, it concerns the issue in which the system cannot draw any inferences nor have it yet gathered sufficient information about users or items. Since RSs performance is substantially limited by cold-start users and cold-start items problems; this research study takes the route for a major aim to attenuate users’ cold-start problem. Still in the process of researching, sundry studies have been conducted to tackle this issue by using clustering techniques to group users according to their social relations, their ratings or both. However, a clustering technique disregards a variety of users’ tastes. In this case, the researcher has adopted the overlapping technique as a tool to deal with the clustering technique’s defects. The advantage of the overlapping technique excels over others by allowing users to belong to multi-clusters at the same time according to their behavior in the social network and ratings feedback. On that account, a novel overlapping method is presented and applied. This latter is executed by using the partitioning around medoids (PAM) algorithm to implement the clustering, which is achieved by means of exploiting social relations and confidence values. After acquiring users’ clusters, the average distances are computed in each cluster. Thereafter, a content comparison is made regarding the distances between every user and the computed distances of the clusters. If the comparison result is less than or equal to the average distance of a cluster, a new user is added to this cluster. The singular value decomposition plus (SVD[Formula: see text]) method is then applied to every cluster to compute predictions values. The outcome is calculated by computing the average of mean absolute error (MAE) and root mean square error (RMSE) for every cluster. The model is tested by two real world datasets: Ciao and FilmTrust. Ultimately, findings have exhibited a great deal of insights on how the proposed model outperformed a number of the state-of-the-art studies in terms of prediction accuracy.

Author(s):  
Salma Adel Elzeheiry ◽  
N. E. Mekky ◽  
A. Atwan ◽  
Noha A. Hikal

<p>Recommendation systems (RSs) are used to obtain advice regarding decision-making. RSs have the shortcoming that a system cannot draw inferences for users or items regarding which it has not yet gathered sufficient information. This issue is known as the cold start issue. Aiming to alleviate the user’s cold start issue, the proposed recommendation algorithm combined tag data and logistic regression classification to predict the probability of the movies for a new user. First using alternating least square to extract product feature, and then diminish the feature vector by combining principal component analysis with logistic regression to predict the probability of genres of the movies. Finally, combining the most relevant tags based on similarity score with probability and find top N movies with high scores to the user. The proposed model is assessed using the root mean square error (RMSE), the mean absolute error (MAE), recall@N and precision@N and it is applied to 1M, 10M and 20M MovieLens datasets, resulting in an accuracy of 0.8806, 0.8791 and 0.8739.</p>


Author(s):  
Sharon Moses J. ◽  
Dhinesh Babu L.D.

Most recommender systems are based on the familiar collaborative filtering algorithm to suggest items. Quite often, collaborative filtering algorithm fails in generating recommendations due to the lack of adequate user information resulting in new user cold start problem. The cold start problem is one among the prevailing issue in recommendation system where the system fails to render recommendations. To overcome the new user cold start issue, demographical information of the user is utilised as the user information source. Among the demographical information, the impact of the user gender is less explored when compared with other information like age, profession, region, etc. In this work, a genetic algorithm-influenced gender-based top-n recommender algorithm is proposed to address the new user cold start problem. The algorithm utilises the evolution concepts of the genetic algorithm to render top-n recommendations to a new user. The evaluation of the proposed algorithm using real world datasets proved that the algorithm has a better efficiency than the state of art approaches.


2020 ◽  
Vol 9 (05) ◽  
pp. 25047-25051
Author(s):  
Aniket Salunke ◽  
Ruchika Kukreja ◽  
Jayesh Kharche ◽  
Amit Nerurkar

With the advancement of technology there are millions of songs available on the internet and this creates problem for a person to choose from this vast pool of songs. So, there should be some middleman who must do this task on behalf of user and present most relevant songs that perfectly fits the user’s taste. This task is done by recommendation system. Music recommendation system predicts the user liking towards a particular song based on the listening history and profile. Most of the music recommendation system available today will give most recently played song or songs which have overall highest rating as suggestions to users but these suggestions are not personalized. The paper purposes how the recommendation systems can be used to give personalized suggestions to each and every user with the help of collaborative filtering which uses user similarity to give suggestions. The paper aims at implementing this idea and solving the cold start problem using content based filtering at the start.


Author(s):  
Huimin Sun ◽  
Jiajie Xu ◽  
Kai Zheng ◽  
Pengpeng Zhao ◽  
Pingfu Chao ◽  
...  

Next Point-of-Interest (POI) recommendation is of great value for location-based services. Existing solutions mainly rely on extensive observed data and are brittle to users with few interactions. Unfortunately, the problem of few-shot next POI recommendation has not been well studied yet. In this paper, we propose a novel meta-optimized model MFNP, which can rapidly adapt to users with few check-in records. Towards the cold-start problem, it seamlessly integrates carefully designed user-specific and region-specific tasks in meta-learning, such that region-aware user preferences can be captured via a rational fusion of region-independent personal preferences and region-dependent crowd preferences. In modelling region-dependent crowd preferences, a cluster-based adaptive network is adopted to capture shared preferences from similar users for knowledge transfer. Experimental results on two real-world datasets show that our model outperforms the state-of-the-art methods on next POI recommendation for cold-start users.


Information ◽  
2019 ◽  
Vol 10 (12) ◽  
pp. 379
Author(s):  
Yeonghun Lee ◽  
Yuchul Jung

As the size of the domestic and international gaming industry gradually grows, various games are undergoing rapid development cycles to compete in the current market. However, selecting and recommending suitable games for users continues to be a challenging problem. Although game recommendation systems based on the prior gaming experience of users exist, they are limited owing to the cold start problem. Unlike existing approaches, the current study addressed existing problems by identifying the personality of the user through a personality diagnostic test and mapping the personality to the player type. In addition, an Android app-based prototype was developed that recommends games by mapping tag information about the user’s personality and the game. A set of user experiments were conducted to verify the feasibility of the proposed mapping model and the recommendation prototype.


2021 ◽  
Vol 17 (3) ◽  
pp. 30-49
Author(s):  
Sharon Moses J. ◽  
Dhinesh Babu L. D.

The advancement of web services paved the way to the accumulation of a tremendous amount of information into the world wide web. The huge pile of information makes it hard for the user to get the required information at the right time. Therefore, to get the right item, recommender systems are emphasized. Recommender algorithms generally act on the user information to render recommendations. In this scenario, when a new user enters the system, it fails in rendering recommendation due to unavailability of user information, resulting in a new user problem. So, in this paper, a movie recommender algorithm is constructed to address the prevailing new user cold start problem by utilizing only movie genres. Unlike other techniques, in the proposed work, familiarity of each movie genre is considered to compute the genre significance value. Based on genre significance value, genre similarity is correlated to render recommendations to a new user. The evaluation of the proposed recommender algorithm on real-world datasets shows that the algorithm performs better than the other similar approaches.


Sign in / Sign up

Export Citation Format

Share Document