scholarly journals Recommendation system using the k-nearest neighbors and singular value decomposition algorithms

2021 ◽  
Vol 11 (6) ◽  
pp. 5541
Author(s):  
Badr Hssina ◽  
Abdelkader Grota ◽  
Mohammed Erritali
Keyword(s):  
Singular Value Decomposition ◽  
Collaborative Filtering ◽  
Recommendation System ◽  
Hybrid Approach ◽  
Singular Value ◽  
User Preferences ◽  
Decomposition Algorithms ◽  
K Nearest Neighbors ◽  
The Matrix ◽  
Value Decomposition

<span>Nowadays, recommendation systems are used successfully to provide items (example: movies, music, books, news, images) tailored to user preferences. Amongst the approaches existing to recommend adequate content, we use the collaborative filtering approach of finding the information that satisfies the user by using the reviews of other users. These reviews are stored in matrices that their sizes increase exponentially to predict whether an item is relevant or not. The evaluation shows that these systems provide unsatisfactory recommendations because of what we call the cold start factor. Our objective is to apply a hybrid approach to improve the quality of our recommendation system. The benefit of this approach is the fact that it does not require a new algorithm for calculating the predictions. We are going to apply two algorithms: k-nearest neighbours (KNN) and the matrix factorization algorithm of collaborative filtering which are based on the method of (singular-value-decomposition). Our combined model has a very high precision and the experiments show that our method can achieve better results.</span>

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 Building Recommendation Systems Using the Algorithms KNN and SVD

2021 ◽  
Vol 9 (1) ◽  
pp. 71
Author(s):  
Mohammed Erritali ◽  
Badr Hssina ◽  
Abdelkader Grota
Keyword(s):  
Collaborative Filtering ◽  
Matrix Factorization ◽  
Hybrid Approach ◽  
Recommendation Systems ◽  
Singular Value ◽  
User Preferences ◽  
Factorization Algorithm ◽  
The Matrix ◽  
Filtering Approach

<p>Recommendation systems are used successfully to provide items (example:<br />movies, music, books, news, images) tailored to user preferences.<br />Among the approaches proposed, we use the collaborative filtering approach<br />of finding the information that satisfies the user by using the<br />reviews of other users. These ratings are stored in matrices that their<br />sizes increase exponentially to predict whether an item is interesting<br />or not. The problem is that these systems overlook that an assessment<br />may have been influenced by other factors which we call the cold start<br />factor. Our objective is to apply a hybrid approach of recommendation<br />systems to improve the quality of the recommendation. The advantage<br />of this approach is the fact that it does not require a new algorithm<br />for calculating the predictions. We we are going to apply the two Kclosest<br />neighbor algorithms and the matrix factorization algorithm of<br />collaborative filtering which are based on the method of (singular value<br />decomposition).</p>

Rec-CFSVD++: Implementing Recommendation System Using Collaborative Filtering and Singular Value Decomposition (SVD)++

2021 ◽  
pp. 1-19
Author(s):  
Taushif Anwar ◽  
V. Uma ◽  
Gautam Srivastava
Keyword(s):  
Singular Value Decomposition ◽  
Collaborative Filtering ◽  
Error Rate ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Matrix Decomposition ◽  
Cold Start ◽  
Singular Value ◽  
Decomposition Approach ◽  
Value Decomposition

In recommender systems, Collaborative Filtering (CF) plays an essential role in promoting recommendation services. The conventional CF approach has limitations, namely data sparsity and cold-start. The matrix decomposition approach is demonstrated to be one of the effective approaches used in developing recommendation systems. This paper presents a new approach that uses CF and Singular Value Decomposition (SVD)[Formula: see text] for implementing a recommendation system. Therefore, this work is an attempt to extend the existing recommendation systems by (i) finding similarity between user and item from rating matrices using cosine similarity; (ii) predicting missing ratings using a matrix decomposition approach, and (iii) recommending top-N user-preferred items. The recommender system’s performance is evaluated considering Root Mean Square Error (RMSE) and Mean Absolute Error (MAE). Performance evaluation is accomplished by comparing the systems developed using CF in combination with six different algorithms, namely SVD, SVD[Formula: see text], Co-Clustering, KNNBasic, KNNBaseline, and KNNWithMeans. We have experimented using MovieLens 100[Formula: see text]K, MovieLens 1[Formula: see text]M, and BookCrossing datasets. The results prove that the proposed approach gives a lesser error rate when cross-validation ([Formula: see text]) is performed. The experimental results show that the lowest error rate is achieved with MovieLens 100[Formula: see text]K dataset ([Formula: see text], [Formula: see text]). The proposed approach also alleviates the sparsity and cold-start problems and recommends the relevant items.

scholarly journals A Note on Full-Rank Factorization of Matrix

2019 ◽  
Vol 15 (2) ◽  
pp. 152-154
Author(s):  
Gyan Bahadur Thapa ◽  
J. López-Bonilla ◽  
R. López-Vázquez
Keyword(s):  
Singular Value Decomposition ◽  
Full Rank ◽  
Singular Value ◽  
The Matrix ◽  
Rank Factorization ◽  
Value Decomposition

We exhibit that the Singular Value Decomposition of a matrix Anxm implies a natural full-rank factorization of the matrix.

Fault feature extraction and classification based on WPT and SVD: Application to element bearings with artificially created faults under variable conditions

2016 ◽  
Vol 231 (22) ◽  
pp. 4186-4196 ◽  
Author(s):  
Mourad Kedadouche ◽  
Zhaoheng Liu
Keyword(s):  
Support Vector Machine ◽  
Singular Value Decomposition ◽  
Wavelet Packet ◽  
Rolling Bearing ◽  
Wavelet Packet Transform ◽  
Singular Value ◽  
Support Vector ◽  
Rolling Bearings ◽  
The Matrix ◽  
Value Decomposition

Achieving a precise fault diagnosis for rolling bearings under variable conditions is a problematic challenge. In order to enhance the classification and achieves a higher precision for diagnosing rolling bearing degradation, a hybrid method is proposed. The method combines wavelet packet transform, singular value decomposition and support vector machine. The first step of the method is the decomposition of the signal using wavelet packet transform and then instantaneous amplitudes and energy are computed for each component. The Second step is to apply the singular value decomposition to the matrix constructed by the instantaneous amplitudes and energy in order to reduce the matrix dimension and obtaining the fault feature unaffected by the operating condition. The features extracted by singular value decomposition are then used as an input to the support vector machine in order to recognize the fault mode of rolling bearings. The method is applied to a bearing with faults created using electro-discharge machining under laboratory conditions. Test results show that the proposed methodology is effective to classify rolling bearing faults with high accuracy.

Sign in / Sign up

Export Citation Format

Share Document