Recommender Systems Clustering Using Bayesian Non Negative Matrix Factorization
Recommender Systems present a high-level of sparsity in their ratings matrices. The collaborative filtering sparse data makes it difficult to: 1) compare elements using memory-based solutions; 2) obtain precise models using model-based solutions; 3) get accurate predictions; and 4) properly cluster...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8241787/ |
id |
doaj-71d9341692aa42b0a8854890ccceea17 |
---|---|
record_format |
Article |
spelling |
doaj-71d9341692aa42b0a8854890ccceea172021-03-29T20:31:03ZengIEEEIEEE Access2169-35362018-01-0163549356410.1109/ACCESS.2017.27881388241787Recommender Systems Clustering Using Bayesian Non Negative Matrix FactorizationJesus Bobadilla0https://orcid.org/0000-0003-0619-1322Rodolfo Bojorque1https://orcid.org/0000-0002-6045-8692Antonio Hernando Esteban2https://orcid.org/0000-0001-6985-2058Remigio Hurtado3https://orcid.org/0000-0001-7472-9417Department of Information Systems, Universidad Politécnica de Madrid, Madrid, SpainDepartment of Computer Science, Universidad Politécnica Salesiana, Cuenca, EcuadorDepartment of Information Systems, Universidad Politécnica de Madrid, Madrid, SpainDepartment of Computer Science, Universidad Politécnica Salesiana, Cuenca, EcuadorRecommender Systems present a high-level of sparsity in their ratings matrices. The collaborative filtering sparse data makes it difficult to: 1) compare elements using memory-based solutions; 2) obtain precise models using model-based solutions; 3) get accurate predictions; and 4) properly cluster elements. We propose the use of a Bayesian non-negative matrix factorization (BNMF) method to improve the current clustering results in the collaborative filtering area. We also provide an original pre-clustering algorithm adapted to the proposed probabilistic method. Results obtained using several open data sets show: 1) a conclusive clustering quality improvement when BNMF is used, compared with the classical matrix factorization or to the improved KMeans results; 2) a higher predictions accuracy using matrix factorizationbased methods than using improved KMeans; and 3) better BNMF execution times compared with those of the classic matrix factorization, and an additional improvement when using the proposed pre-clustering algorithm.https://ieeexplore.ieee.org/document/8241787/Bayesian NMFcollaborative filteringhard clusteringmatrix factorizationpre-clusteringrecommender systems |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Jesus Bobadilla Rodolfo Bojorque Antonio Hernando Esteban Remigio Hurtado |
spellingShingle |
Jesus Bobadilla Rodolfo Bojorque Antonio Hernando Esteban Remigio Hurtado Recommender Systems Clustering Using Bayesian Non Negative Matrix Factorization IEEE Access Bayesian NMF collaborative filtering hard clustering matrix factorization pre-clustering recommender systems |
author_facet |
Jesus Bobadilla Rodolfo Bojorque Antonio Hernando Esteban Remigio Hurtado |
author_sort |
Jesus Bobadilla |
title |
Recommender Systems Clustering Using Bayesian Non Negative Matrix Factorization |
title_short |
Recommender Systems Clustering Using Bayesian Non Negative Matrix Factorization |
title_full |
Recommender Systems Clustering Using Bayesian Non Negative Matrix Factorization |
title_fullStr |
Recommender Systems Clustering Using Bayesian Non Negative Matrix Factorization |
title_full_unstemmed |
Recommender Systems Clustering Using Bayesian Non Negative Matrix Factorization |
title_sort |
recommender systems clustering using bayesian non negative matrix factorization |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2018-01-01 |
description |
Recommender Systems present a high-level of sparsity in their ratings matrices. The collaborative filtering sparse data makes it difficult to: 1) compare elements using memory-based solutions; 2) obtain precise models using model-based solutions; 3) get accurate predictions; and 4) properly cluster elements. We propose the use of a Bayesian non-negative matrix factorization (BNMF) method to improve the current clustering results in the collaborative filtering area. We also provide an original pre-clustering algorithm adapted to the proposed probabilistic method. Results obtained using several open data sets show: 1) a conclusive clustering quality improvement when BNMF is used, compared with the classical matrix factorization or to the improved KMeans results; 2) a higher predictions accuracy using matrix factorizationbased methods than using improved KMeans; and 3) better BNMF execution times compared with those of the classic matrix factorization, and an additional improvement when using the proposed pre-clustering algorithm. |
topic |
Bayesian NMF collaborative filtering hard clustering matrix factorization pre-clustering recommender systems |
url |
https://ieeexplore.ieee.org/document/8241787/ |
work_keys_str_mv |
AT jesusbobadilla recommendersystemsclusteringusingbayesiannonnegativematrixfactorization AT rodolfobojorque recommendersystemsclusteringusingbayesiannonnegativematrixfactorization AT antoniohernandoesteban recommendersystemsclusteringusingbayesiannonnegativematrixfactorization AT remigiohurtado recommendersystemsclusteringusingbayesiannonnegativematrixfactorization |
_version_ |
1724194681628131328 |