Developing Hybrid-Based Recommender System with Naïve Bayes Optimization to Increase Prediction Efficiency

Commerce and entertainment world today have shifted to the digital platforms where customer preferences are suggested by recommender systems. Recommendations have been made using a variety of methods such as content-based, collaborative filtering-based or their hybrids. Collaborative systems are common recommenders, which use similar users’ preferences. They however have issues such as data sparsity, cold start problem and lack of scalability. When a small percentage of users express their preferences, data becomes highly sparse, thus affecting quality of recommendations. New users or items with no preferences, forms cold start issues affecting recommendations. High amount of sparse data affects how the user-item matrices are formed thus affecting the overall recommendation results. How to handle data input in the recommender engine while reducing data sparsity and increase its potential to scale up is proposed. This paper proposed development of hybrid model with data optimization using a Naïve Bayes classifier, with an aim of reducing data sparsity problem and a blend of collaborative filtering model and association rule mining-based ensembles, for recommending items with an aim of improving their predictions. Machine learning using python on Jupyter notebook was used to develop the hybrid. The models were tested using MovieLens 100k and 1M datasets. We demonstrate the final recommendations of the hybrid having new top ten highly rated movies with 68% approved recommendations. We confirm new items suggested to the active user(s) while less sparse data was input and an improved scaling up of collaborative filtering model, thus improving model efficacy and better predictions

Matrix factorization with rating completion : an enhanced SVD Model for collaborative filtering recommender systems

Collaborative filtering algorithms, such as matrix factorization techniques, are recently gaining momentum due to their promising performance on recommender systems. However, most collaborative filtering algorithms suffer from data sparsity. Active learning algorithms are effective in reducing the sparsity problem for recommender systems by requesting users to give ratings to some items when they enter the systems. In this paper, a new matrix factorization model, called Enhanced SVD (ESVD) is proposed, which incorporates the classic matrix factorization algorithms with ratings completion inspired by active learning. In addition, the connection between the prediction accuracy and the density of matrix is built to further explore its potentials. We also propose the Multi-layer ESVD, which learns the model iteratively to further improve the prediction accuracy. To handle the imbalanced data sets that contain far more users than items or more items than users, the Item-wise ESVD and User-wise ESVD are presented, respectively. The proposed methods are evaluated on the famous Netflix and Movielens data sets. Experimental results validate their effectiveness in terms of both accuracy and efficiency when compared with traditional matrix factorization methods and active learning methods

LRMM: Learning to Recommend with Missing Modalities

Multimodal learning has shown promising performance in content-based recommendation due to the auxiliary user and item information of multiple modalities such as text and images. However, the problem of incomplete and missing modality is rarely explored and most existing methods fail in learning a recommendation model with missing or corrupted modalities. In this paper, we propose LRMM, a novel framework that mitigates not only the problem of missing modalities but also more generally the cold-start problem of recommender systems. We propose modality dropout (m-drop) and a multimodal sequential autoencoder (m-auto) to learn multimodal representations for complementing and imputing missing modalities. Extensive experiments on real-world Amazon data show that LRMM achieves state-of-the-art performance on rating prediction tasks. More importantly, LRMM is more robust to previous methods in alleviating data-sparsity and the cold-start problem.Comment: 11 pages, EMNLP 201