scholarly journals Improvising Singular Value Decomposition by KNN for Use in Movie Recommender Systems

2019 ◽  
Vol 2 (1) ◽  
pp. 22-34
Author(s):  
Sukanya Patra ◽  
Boudhayan Ganguly
Keyword(s):  
Singular Value Decomposition ◽  
Comparative Study ◽  
Recommender Systems ◽  
Missing Values ◽  
Distance Measure ◽  
Study Data ◽  
Singular Value ◽  
Distance Measures ◽  
K Nearest Neighbors ◽  
Value Decomposition

Online recommender systems are an integral part of e-commerce. There are a plethora of algorithms following different approaches. However, most of the approaches except the singular value decomposition (SVD), do not provide any insight into the underlying patterns/concepts used in item rating. SVD used underlying features of movies but are computationally resource-heavy and performs poorly when there is data sparsity. In this article, we perform a comparative study among several pre-processing algorithms on SVD. In the experiments, we have used the MovieLens 1M dataset to compare the performance of these algorithms. KNN-based approach was used to find out K-nearest neighbors of users and their ratings were then used to impute the missing values. Experiments were conducted using different distance measures, such as Jaccard and Euclidian. We found that when the missing values were imputed using the mean of similar users and the distance measure was Euclidean, the KNN-based (K-Nearest Neighbour) approach of pre-processing the SVD was performing the best. Based on our comparative study, data managers can choose to employ the algorithm best suited for their business.

scholarly journals Introduction to Matrix Factorization for Recommender Systems

2021 ◽  
Author(s):  
Shalin Shah
Keyword(s):  
Singular Value Decomposition ◽  
Online Education ◽  
Recommender Systems ◽  
Matrix Factorization ◽  
Gradient Descent ◽  
Large Scale ◽  
Singular Value ◽  
Factorization Algorithms ◽  
Value Decomposition ◽  
Interaction History

Recommender systems aim to personalize the experience of user by suggesting items to the user based on the preferences of a user. The preferences are learned from the user’s interaction history or through explicit ratings that the user has given to the items. The system could be part of a retail website, an online bookstore, a movie rental service or an online education portal and so on. In this paper, I will focus on matrix factorization algorithms as applied to recommender systems and discuss the singular value decomposition, gradient descent-based matrix factorization and parallelizing matrix factorization for large scale applications.

scholarly journals A Hybrid Deep Collaborative Filtering Approach for Recommender Systems

2021 ◽  
Author(s):  
Kirubahari R ◽  
Miruna Joe Amali S
Keyword(s):  
Singular Value Decomposition ◽  
Collaborative Filtering ◽  
Recommender Systems ◽  
Cold Start ◽  
Singular Value ◽  
User Preferences ◽  
Boltzmann Machine ◽  
Latent Features ◽  
Value Decomposition ◽  
Cold Start Problem

Abstract Recommender Systems (RS) help the users by showing better products and relevant items efficiently based on their likings and historical interactions with other users and items. Collaborative filtering is one of the most powerful technique of recommender system and provides personalized recommendation for users by prediction rating approach. Many Recommender Systems generally model only based on user implicit feedback, though it is too challenging to build RS. Conventional Collaborative Filtering (CF) techniques such as matrix decomposition, which is a linear combination of user rating for an item with latent features of user preferences, but have limited learning capacity. Additionally, it has been suffering from data sparsity and cold start problem due to insufficient data. In order to overcome these problems, an integration of conventional collaborative filtering with deep neural networks is proposed. A Weighted Parallel Deep Hybrid Collaborative Filtering based on Singular Value Decomposition (SVD) and Restricted Boltzmann Machine (RBM) is proposed for significant improvement. In this approach a user-item relationship matrix with explicit ratings is constructed. The user - item matrix is integrated to Singular Value Decomposition (SVD) that decomposes the matrix into the best lower rank approximation of the original matrix. Secondly the user-item matrix is embedded into deep neural network model called Restricted Boltzmann Machine (RBM) for learning latent features of user- item matrix to predict user preferences. Thus, the Weighted Parallel Deep Hybrid RS uses additional attributes of user - item matrix to alleviate the cold start problem. The proposed method is verified using two different movie lens datasets namely, MovieLens 100K and MovieLens of 1M and evaluated using Root Mean Squared Error (RMSE) and Mean Absolute Error (MAE). The results indicate better prediction compared to other techniques in terms of accuracy.

scholarly journals Distribution-free multiple imputation in an interaction matrix through singular value decomposition

2008 ◽  
Vol 65 (4) ◽  
pp. 422-427 ◽  
Author(s):  
Genevile Carife Bergamo ◽  
Carlos Tadeu dos Santos Dias ◽  
Wojtek Janusz Krzanowski
Keyword(s):  
Singular Value Decomposition ◽  
Multiple Imputation ◽  
Missing Values ◽  
Eucalyptus Grandis ◽  
Singular Value ◽  
Data Matrix ◽  
Interaction Matrix ◽  
General Measure ◽  
Data Set ◽  
Value Decomposition

Some techniques of multivariate statistical analysis can only be conducted on a complete data matrix, but the process of data collection often misses some elements. Imputation is a technique by which the missing elements are replaced by plausible values, so that a valid analysis can be performed on the completed data set. A multiple imputation method is proposed based on a modification to the singular value decomposition (SVD) method for single imputation, developed by Krzanowski. The method was evaluated on a genotype × environment (G × E) interaction matrix obtained from a randomized blocks experiment on Eucalyptus grandis grown in multienvironments. Values of E. grandis heights in the G × E complete interaction matrix were deleted randomly at three different rates (5%, 10%, 30%) and were then imputed by the proposed methodology. The results were assessed by means of a general measure of performance (Tacc), and showed a small bias when compared to the original data. However, bias values were greater than the variability of imputations relative to their mean, indicating a smaller accuracy of the proposed method in relation to its precision. The proposed methodology uses the maximum amount of available information, does not have any restrictions regarding the pattern or mechanism of the missing values, and is free of assumptions on the data distribution or structure.

Sign in / Sign up

Export Citation Format

Share Document