Matrix Factorization Meets Cosine Similarity: Addressing Sparsity Problem in Collaborative Filtering Recommender System

Author(s):  
Hailong Wen ◽  
Guiguang Ding ◽  
Cong Liu ◽  
Jianming Wang
2013 ◽  
Vol 411-414 ◽  
pp. 2223-2228
Author(s):  
Dong Liang Su ◽  
Zhi Ming Cui ◽  
Jian Wu ◽  
Peng Peng Zhao

Nowadays personalized recommendation algorithm of e-commerce can hardly meet the needs of users as an ever-increasing number of users and items in personalized recommender system has brought about sparsity of user-item rating matrix and the emergence of more and more new users has threatened recommender system quality. This paper puts forward a pre-filled collaborative filtering recommendation algorithm based on matrix factorization, pre-filling user-item matrixes by matrix factorization and building nearest-neighbor models according to new user profile information, thus mitigating the influence of matrix sparsity and new users and improving the accuracy of recommender system. The experimental results suggest that this algorithm is more precise and effective than the traditional one under the condition of extremely sparse user-item rating matrix.


2013 ◽  
Vol 2 (1) ◽  
pp. 9
Author(s):  
Kirana Nuryunita ◽  
Yani Nurhadryani

<p>Penelitian ini bertujuan menambahkan modul rekomendasi pada content management system Opencart. Salah satu pendekatan dalam rekomendasi adalah item-based collaborative filtering. Metode item-based collaborative filtering dapat mengurangi waktu eksekusi perhitungan. Metode item-based collaborative filtering pada penelitian ini menggunakan perhitungan adjusted cosine similarity untuk menghitung nilai kemiripan antarbuku dan weighted sum untuk menghitung nilai prediksi rate buku. Untuk mendapatkan rekomendasi, pengguna harus melakukan login dan memberikan rate pada buku. Berdasarkan rate pengguna, nilai kemiripan dihitung menggunakan adjusted cosine similarity. Berdasarkan kemiripan antarbuku, nilai prediksi rate buku dicari menggunakan weighted sum. Sebelum buku direkomendasikan kepada pengguna, kategori prediksi buku dicocokkan dengan kategori buku yang telah diberi rate oleh pengguna. Penelitian ini menggunakan 300 buku dan 30 pengguna sebagai data. Dari hasil penelitian, hanya 17 pengguna yang mendapatkan rekomendasi. Pengujian dilakukan dengan menganalisis waktu eksekusi dan keakuratan rekomendasi. Waktu eksekusi dalam pengujian ini adalah 1.60 detik. Untuk menghitung keakuratan rekomendasi, penelitian ini menggunakan mean absolute error dengan hasil perhitungan 0.15.</p><p>Kata kunci: e-commerce, item-based collaborative filtering, recommender system.</p>


Author(s):  
K. Venkata Ruchitha

In recent years, recommender systems became more and more common and area unit applied to a various vary of applications, thanks to development of things and its numerous varieties accessible, that leaves the users to settle on from bumper provided choices. Recommendations generally speed up searches and create it easier for users to access content that they're curious about, and conjointly surprise them with offers they'd haven't sought for. By victimisation filtering strategies for pre-processing the information, recommendations area unit provided either through collaborative filtering or through content-based Filtering. This recommender system recommends books supported the description and features. It identifies the similarity between the books supported its description. It conjointly considers the user previous history so as to advocate the identical book.


Author(s):  
Dr. C. K. Gomathy

Abstract: Here we are building an collaborative filtering matrix factorization based hybrid recommender system to recommend movies to users based on the sentiment generated from twitter tweets and other vectors generated by the user in their previous activities. To calculate sentiment data has been collected from twitter using developer APIs and scrapping techniques later these are cleaned, stemming, lemetized and generated sentiment values. These values are merged with the movie data taken and create the main data frame.The traditional approaches like collaborative filtering and content-based filtering have limitations like it requires previous user activities for performing recommendations. To reduce this dependency hybrid is used which combines both collaborative and content based filtering techniques with the sentiment generated above. Keywords: machine learning, natural language processing, movie lens data, root mean square equation, matrix factorization, recommenders system, sentiment analysis


Author(s):  
Quangui Zhang ◽  
Longbing Cao ◽  
Chengzhang Zhu ◽  
Zhiqiang Li ◽  
Jinguang Sun

Non-IID recommender system discloses the nature of recommendation and has shown its potential in improving recommendation quality and addressing issues such as sparsity and cold start. It leverages existing work that usually treats users/items as in- dependent while ignoring the rich couplings within and between users and items, leading to limited performance improvement. In reality, users/items are related with various couplings existing within and between users and items, which may better ex- plain how and why a user has personalized pref- erence on an item. This work builds on non- IID learning to propose a neural user-item cou- pling learning for collaborative filtering, called CoupledCF. CoupledCF jointly learns explicit and implicit couplings within/between users and items w.r.t. user/item attributes and deep features for deep CF recommendation. Empirical results on two real-world large datasets show that CoupledCF significantly outperforms two latest neural recom- menders: neural matrix factorization and Google’s Wide&Deep network.


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.


Author(s):  
Jyoti Kumari

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.


Author(s):  
Vipul Agarwal ◽  
Vijayalakshmi A

Accumulation of the stock had been a major concern for retail shop owners. Surplus stock could be minimized if the system could continuously monitor the accumulated stock and recommend the stock which requires clearance. Recommender Systems computes the data, shadowing the manual work and give efficient recommendations to overcome stock accumulation, creating space for new stock for sale to enhance the profit in business. An intelligent recommender system was built that could work with the data and help the shop owners to overcome the issue of surplus stock in a remarkable way. An item-item collaborative filtering technique with Pearson similarity metric was used to draw the similarity between the items and accordingly give recommendations. The results obtained on the dataset highlighted the top-N items using the Pearson similarity and the Cosine similarity. The items having the highest rank had the highest accumulation and required attention to be cleared. The comparison is drawn for the precision and recall obtained by the similarity metrics used. The evaluation of the existing work was done using precision and recall, where the precision obtained was remarkable, while the recall has the scope of increment but in turn, it would reduce the value of precision. Thus, there lies a scope of reducing the stock accumulation with the help of a recommender system and overcome losses to maximize profit


Sign in / Sign up

Export Citation Format

Share Document