An Efficient Collaborative Recommender System for Removing Sparsity Problem

Author(s):  
Avita Fuskele Jain ◽  
Santosh Kumar Vishwakarma ◽  
Prashant Jain
2014 ◽  
Vol 21 (9) ◽  
pp. 3541-3550 ◽  
Author(s):  
Ukrit Marung ◽  
Nipon Theera-Umpon ◽  
Sansanee Auephanwiriyakul

2013 ◽  
Vol 336-338 ◽  
pp. 2563-2566
Author(s):  
Dan Xiang Ai ◽  
Hui Zuo ◽  
Jun Yang

To solve the special recommendation problem in C2C e-commerce websites, a three-dimensional collaborative filtering recommendation method which can recommend seller and product combinations is proposed by extending the traditional two-dimensional collaborative filtering method. And a C2C e-commerce recommender system based on the proposed method is designed. The framework of the system and the key calculations in the recommendation process are discussed. The system firstly calculates seller similarities using seller features, and fills the rating set based on sales relations and seller similarities to solve the sparsity problem of the three-dimensional rating data. Then it calculates the buyer similarities using historical ratings, decides neighbors and predicts unknown ratings. Finally it recommends the seller and product combinations with the highest prediction ratings to the target buyer. A true data experiment proves the good recommendation performance of the system.


2021 ◽  
Vol 12 (1) ◽  
pp. 45
Author(s):  
Soo-Yeon Jeong ◽  
Young-Kuk Kim

A context-aware recommender system can make recommendations to users by considering contextual information such as time and place, not only the scores assigned to items by users. However, as a user preferences matrix is expanded in a multidimensional matrix, data sparsity is maximized. In this paper, we propose a deep learning-based context-aware recommender system that considers the contextual features. Based on existing deep learning models, we combine a neural network and autoencoder to extract characteristics and predict scores in the process of restoring input data. The newly proposed model is able to easily reflect various type of contextual information and predicts user preferences by considering the feature of user, item and context. The experimental results confirm that the proposed method is mostly superior to the existing method in all datasets. Also, for the dataset with data sparsity problem, it was confirmed that the performance of the proposed method is higher than that of existing methods. The proposed method has higher precision by 0.01–0.05 than other recommender systems in a dataset with many context dimensions. And it showed good performance with a high precision of 0.03 to 0.09 in a small dimensional dataset.


2019 ◽  
Vol 17 (3) ◽  
pp. 43-60
Author(s):  
A. V. Menkin

Music recommender systems (MRS) help users of music streaming services to find interesting music in the music catalogs. The sparsity problem is an essential problem of MRS research. It refers to the fact that user usually rates only a tiny part of items. As a result, MRS often has not enough data to make a recommendation. To solve the sparsity problem, in this paper, a new approach that uses related items’ ratings is proposed. Hybrid MRS based on this approach is described. It uses tracks, albums, artists, genres normalized ratings along with information about relations between items of different types in the music catalog. The proposed MRS is evaluated and compared to collaborative method for users’ preferences prediction.


Sign in / Sign up

Export Citation Format

Share Document