A Hybrid Document Recommender Algorithm Based on Random Walk

2013 ◽  
Vol 336-338 ◽  
pp. 2270-2276
Author(s):  
Zhi Ping Zhang ◽  
Lin Na Li ◽  
Hai Yan Yu
Keyword(s):  
Random Walk ◽  
Collaborative Filtering ◽  
Digital Library ◽  
Recommender System ◽  
Target Item ◽  
The Other ◽  
National Science ◽  
Recommender Algorithm ◽  
Valuable Service ◽  
Cold Start Problem

Research shows that recommendations comprise a valuable service for users of a digital library. We proposed a hybrid document recommender system based on random walk. It builds correlation network among users based on the conditional probability in order to solve the sparsity of collaborative filtering. On the other hand, it computes the rating of source user for target item not only based on the neighborhoods’ ratings for target item but also based on the neighborhoods’ ratings for item which is most similar to target item. This can solve the cold start problem of recommender systems. We performed an evaluation on the dataset of National Science and Technology Library. Experimental results illustrate the superiority of the proposed method.

Genetic Algorithm Influenced Top-N Recommender System to Alleviate New User Cold Start Problem

2021 ◽  
pp. 1492-1512
Author(s):  
Sharon Moses J. ◽  
Dhinesh Babu L.D.
Keyword(s):  
Genetic Algorithm ◽  
Collaborative Filtering ◽  
Cold Start ◽  
Filtering Algorithm ◽  
Other Information ◽  
Collaborative Filtering Algorithm ◽  
Real World Datasets ◽  
Gender Based ◽  
Recommender Algorithm ◽  
Cold Start Problem

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.

Genre Familiarity Correlation-Based Recommender Algorithm for New User Cold Start Problem

2021 ◽  
Vol 17 (3) ◽  
pp. 30-49
Author(s):  
Sharon Moses J. ◽  
Dhinesh Babu L. D.
Keyword(s):  
World Wide ◽  
Cold Start ◽  
The Other ◽  
The World ◽  
Tremendous Amount ◽  
Real World Datasets ◽  
Recommender Algorithm ◽  
The Right ◽  
Cold Start Problem ◽  
Better Than

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.

Genetic Algorithm-Influenced Top-N Recommender System to Alleviate the New User Cold Start Problem

2020 ◽  
pp. 195-216
Author(s):  
Sharon Moses J. ◽  
Dhinesh Babu L. D. ◽  
Santhoshkumar Srinivasan ◽  
Nirmala M.
Keyword(s):  
Genetic Algorithm ◽  
Collaborative Filtering ◽  
Cold Start ◽  
Filtering Algorithm ◽  
Other Information ◽  
Collaborative Filtering Algorithm ◽  
Real World Datasets ◽  
Gender Based ◽  
Recommender Algorithm ◽  
Cold Start Problem

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. Cold start problem is one of the prevailing issues in recommendation system where the system fails to render recommendation. 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 user gender is less explored when compared with other information like age, profession, region, etc. In this chapter, 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 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.

Genetic Algorithm-Influenced Top-N Recommender System to Alleviate the New User Cold Start Problem

2021 ◽  
pp. 829-850
Author(s):  
Sharon Moses J. ◽  
Dhinesh Babu L. D. ◽  
Santhoshkumar Srinivasan ◽  
Nirmala M.
Keyword(s):  
Genetic Algorithm ◽  
Collaborative Filtering ◽  
Cold Start ◽  
Filtering Algorithm ◽  
Other Information ◽  
Collaborative Filtering Algorithm ◽  
Real World Datasets ◽  
Gender Based ◽  
Recommender Algorithm ◽  
Cold Start Problem

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. Cold start problem is one of the prevailing issues in recommendation system where the system fails to render recommendation. 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 user gender is less explored when compared with other information like age, profession, region, etc. In this chapter, 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 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.

scholarly journals A Movie Recommendation System Based on A Convolutional Neural Network

2021 ◽  
Vol 9 (12) ◽  
pp. 1445-1455
Author(s):  
Jyoti Kumari
Keyword(s):  
Neural Network ◽  
Convolutional Neural Network ◽  
Collaborative Filtering ◽  
Recommender System ◽  
Recommendation System ◽  
Cosine Similarity ◽  
The Other ◽  
Human Effort ◽  
Movie Recommendation ◽  
Content Based Filtering

Abstract: Due to its vast applications in several sectors, the recommender system has gotten a lot of interest and has been investigated by academics in recent years. The ability to comprehend and apply the context of recommendation requests is critical to the success of any current recommender system. Nowadays, the suggestion system makes it simple to locate the items we require. Movie recommendation systems are intended to assist movie fans by advising which movie to see without needing users to go through the time-consuming and complicated method of selecting a film from a large number of thousands or millions of options. The goal of this research is to reduce human effort by recommending movies based on the user's preferences. This paper introduces a method for a movie recommendation system based on a convolutional neural network with individual features layers of users and movies performed by analyzing user activity and proposing higher-rated films to them. The proposed CNN approach on the MovieLens-1m dataset outperforms the other conventional approaches and gives accurate recommendation results. Keywords: Recommender system, convolutional neural network, movielens-1m, cosine similarity, Collaborative filtering, content-based filtering.

Resolving data sparsity and cold start problem in collaborative filtering recommender system using Linked Open Data

2020 ◽  
Vol 149 ◽  
pp. 113248 ◽  
Author(s):  
Senthilselvan Natarajan ◽  
Subramaniyaswamy Vairavasundaram ◽  
Sivaramakrishnan Natarajan ◽  
Amir H. Gandomi
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Open Data ◽  
Cold Start ◽  
Linked Open Data ◽  
Data Sparsity ◽  
Cold Start Problem

scholarly journals Addressing Complete New Item Cold-Start Recommendation: A Niche Item-Based Collaborative Filtering via Interrelationship Mining

2019 ◽  
Vol 9 (9) ◽  
pp. 1894 ◽  
Author(s):  
Zhi-Peng Zhang ◽  
Yasuo Kudo ◽  
Tetsuya Murai ◽  
Yong-Gong Ren
Keyword(s):  
Collaborative Filtering ◽  
Recommender System ◽  
Cold Start ◽  
Binary Relations ◽  
Excellent Performance ◽  
Satisfactory Accuracy ◽  
Available Information ◽  
Item Attributes ◽  
New Item ◽  
Cold Start Problem

Recommender system (RS) can be used to provide personalized recommendations based on the different tastes of users. Item-based collaborative filtering (IBCF) has been successfully applied to modern RSs because of its excellent performance, but it is susceptible to the new item cold-start problem, especially when a new item has no rating records (complete new item cold-start). Motivated by this, we propose a niche approach which applies interrelationship mining into IBCF in this paper. The proposed approach utilizes interrelationship mining to extract new binary relations between each pair of item attributes, and constructs interrelated attributes to rich the available information on a new item. Further, similarity, computed using interrelated attributes, can reflect characteristics between new items and others more accurately. Some significant properties, as well as the usage of interrelated attributes, are provided in detail. Experimental results obtained suggest that the proposed approach can effectively solve the complete new item cold-start problem of IBCF and can be used to provide new item recommendations with satisfactory accuracy and diversity in modern RSs.

scholarly journals An Item–Item Collaborative Filtering Recommender System Using Trust and Genre to Address the Cold-Start Problem

2019 ◽  
Vol 3 (3) ◽  
pp. 39 ◽  
Author(s):  
Mahamudul Hasan ◽  
Falguni Roy
Keyword(s):  
Collaborative Filtering ◽  
Similarity Measure ◽  
Recommender System ◽  
Similarity Measures ◽  
Cold Start ◽  
Absolute Error ◽  
Prediction Algorithm ◽  
Rating Data ◽  
Asymmetric Correlation ◽  
Cold Start Problem

Item-based collaborative filtering is one of the most popular techniques in the recommender system to retrieve useful items for the users by finding the correlation among the items. Traditional item-based collaborative filtering works well when there exists sufficient rating data but cannot calculate similarity for new items, known as a cold-start problem. Usually, for the lack of rating data, the identification of the similarity among the cold-start items is difficult. As a result, existing techniques fail to predict accurate recommendations for cold-start items which also affects the recommender system’s performance. In this paper, two item-based similarity measures have been designed to overcome this problem by incorporating items’ genre data. An item might be uniform to other items as they might belong to more than one common genre. Thus, one of the similarity measures is defined by determining the degree of direct asymmetric correlation between items by considering their association of common genres. However, the similarity is determined between a couple of items where one of the items could be cold-start and another could be any highly rated item. Thus, the proposed similarity measure is accounted for as asymmetric by taking consideration of the item’s rating data. Another similarity measure is defined as the relative interconnection between items based on transitive inference. In addition, an enhanced prediction algorithm has been proposed so that it can calculate a better prediction for the recommendation. The proposed approach has experimented with two popular datasets that is Movielens and MovieTweets. In addition, it is found that the proposed technique performs better in comparison with the traditional techniques in a collaborative filtering recommender system. The proposed approach improved prediction accuracy for Movielens and MovieTweets approximately in terms of 3.42% & 8.58% mean absolute error, 7.25% & 3.29% precision, 7.20% & 7.55% recall, 8.76% & 5.15% f-measure and 49.3% and 16.49% mean reciprocal rank, respectively.

Axiomatic Analysis of Language Modelling of Recommender Systems

2017 ◽  
Vol 25 (Suppl. 2) ◽  
pp. 113-127 ◽  
Author(s):  
Daniel Valcarce ◽  
Javier Parapar ◽  
Álvaro Barreiro
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Recommender System ◽  
Cosine Similarity ◽  
The Other ◽  
Language Models ◽  
Axiomatic Analysis ◽  
Likelihood Model ◽  
Language Modelling ◽  
Neighbourhood Algorithm

Language Models constitute an effective framework for text retrieval tasks. Recently, it has been extended to various collaborative filtering tasks. In particular, relevance-based language models can be used for generating highly accurate recommendations using a memory-based approach. On the other hand, the query likelihood model has proven to be a successful strategy for neighbourhood computation. Since relevance-based language models rely on user neighbourhoods for producing recommendations, we propose to use the query likelihood model for computing those neighbourhoods instead of cosine similarity. The combination of both techniques results in a formal probabilistic recommender system which has not been used before in collaborative filtering. A thorough evaluation on three datasets shows that the query likelihood model provides better results than cosine similarity. To understand this improvement, we devise two properties that a good neighbourhood algorithm should satisfy. Our axiomatic analysis shows that the query likelihood model always enforces those constraints while cosine similarity does not.

P2PCF: A collaborative filtering based recommender system for peer to peer social networks

2021 ◽  
pp. 1-19
Author(s):  
Lyes Badis ◽  
Mourad Amad ◽  
Djamil Aïssani ◽  
Sofiane Abbar
Keyword(s):  
Social Networks ◽  
Information Retrieval ◽  
Social Network ◽  
Collaborative Filtering ◽  
Recommender System ◽  
Cold Start ◽  
Peer To Peer ◽  
Public Concerns ◽  
Cold Start Problem ◽  
Filtering Approach

The recent privacy incidents reported in major media about global social networks raised real public concerns about centralized architectures. P2P social networks constitute an interesting paradigm to give back users control over their data and relations. While basic social network functionalities such as commenting, following, sharing, and publishing content are widely available, more advanced features related to information retrieval and recommendation are still challenging. This is due to the absence of a central server that has a complete view of the network. In this paper, we propose a new recommender system called P2PCF. We use collaborative filtering approach to recommend content in P2P social networks. P2PCF enables privacy preserving and tackles the cold start problem for both users and content. Our proposed approach assumes that the rating matrix is distributed within peers, in such a way that each peer only sees interactions made by her friends on her timeline. Recommendations are then computed locally within each peer before they are sent back to the requester. Our evaluations prove the effectiveness of our proposal compared to a centralized scheme in terms of recall and coverage.

Sign in / Sign up

Export Citation Format

Share Document