Integrating Sentiment Analysis on Hybrid Collaborative Filtering Method in a Big Data Environment

2020 ◽  
Vol 19 (02) ◽  
pp. 385-412 ◽  
Author(s):  
P. Shanmuga Sundari ◽  
M. Subaji
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Semantic Analysis ◽  
Least Square ◽  
Data Sparsity ◽  
Filtering Method ◽  
Sparsity Problem ◽  
Hybrid Collaborative Filtering ◽  
User Ratings ◽  
Hybrid Recommendation

Most of the traditional recommendation systems are based on user ratings. Here, users provide the ratings towards the product after use or experiencing it. Accordingly, the user item transactional database is constructed for recommendation. The rating based collaborative filtering method is well known method for recommendation system. This system leads to data sparsity problem as the user is unaware of other similar items. Web cataloguing service such as tags plays a significant role to analyse the user’s perception towards a particular product. Some system use tags as additional resource to reduce the data sparsity issue. But these systems require lot of specific details related to the tags. Existing system either focuses on ratings or tags based recommendation to enhance the accuracy. So these systems suffer from data sparsity and efficiency problem that leads to ineffective recommendations accuracy. To address the above said issues, this paper proposed hybrid recommendation system (Iter_ALS Iterative Alternate Least Square) to enhance the recommendation accuracy by integrating rating and emotion tags. The rating score reveals overall perception of the item and emotion tags reflects user’s feelings. In the absence of emotional tags, scores found in rating is assumed as positive or negative emotional tag score. Lexicon based semantic analysis on emotion tags value is adopted to represent the exclusive value of tag. Unified value is represented into Iter_ALS model to reduce the sparsity problem. In addition, this method handles opinion bias between ratings and tags. Experiments were tested and verified using a benchmark project of MovieLens dataset. Initially this model was tested with different sparsity levels varied between 0%-100 percent and the results obtained from the experiments shows the proposed method outperforms with baseline methods. Further tests were conducted to authenticate how it handles opinion bias by users before recommending the item. The proposed method is more capable to be adopted in many real world applications

scholarly journals Recommendation System Using Autoencoders

2020 ◽  
Vol 10 (16) ◽  
pp. 5510 ◽  
Author(s):  
Diana Ferreira ◽  
Sofia Silva ◽  
António Abelha ◽  
José Machado
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Mean Squared Error ◽  
Singular Value ◽  
High Dimensions ◽  
Data Sparsity ◽  
Filtering Method ◽  
Squared Error ◽  
Sparsity Problem ◽  
Value Decomposition

The magnitude of the daily explosion of high volumes of data has led to the emergence of the Big Data paradigm. The ever-increasing amount of information available on the Internet makes it increasingly difficult for individuals to find what they need quickly and easily. Recommendation systems have appeared as a solution to overcome this problem. Collaborative filtering is widely used in this type of systems, but high dimensions and data sparsity are always a main problem. With the idea of deep learning gaining more importance, several works have emerged to improve this type of filtering. In this article, a product recommendation system is proposed where an autoencoder based on a collaborative filtering method is employed. A comparison of this model with the Singular Value Decomposition is made and presented in the results section. Our experiment shows a very low Root Mean Squared Error (RMSE) value, considering that the recommendations presented to the users are in line with their interests and are not affected by the data sparsity problem as the datasets are very sparse, 0.996. The results are quite promising achieving an RMSE value of 0.029 in the first dataset and 0.010 in the second one.

scholarly journals Machine Learning as a method of adapting offers to the clients

2019 ◽  
Vol 13 ◽  
pp. 267-271
Author(s):  
Jacek Bielecki ◽  
Oskar Ceglarski ◽  
Maria Skublewska-Paszkowska
Keyword(s):  
Machine Learning ◽  
Collaborative Filtering ◽  
Recommendation System ◽  
Recommendation Systems ◽  
Filtering Method ◽  
Advantages And Disadvantages ◽  
Information Filter ◽  
User Ratings ◽  
Research Show

Recommendation systems are class of information filter applications whose main goal is to provide personalized recommendations. The main goal of the research was to compare two ways of creating personalized recommendations. The recommendation system was built on the basis of a content-based cognitive filtering method and on the basis of a collaborative filtering method based on user ratings. The conclusions of the research show the advantages and disadvantages of both methods.

Combining Item Rating Similarity and Item Classification Similarity for Better Recommendation Quality

2012 ◽  
Vol 461 ◽  
pp. 289-292
Author(s):  
Kai Zhou
Keyword(s):  
Collaborative Filtering ◽  
Recommender Systems ◽  
Fundamental Problem ◽  
The Other ◽  
Recommendation Algorithm ◽  
Data Sparsity ◽  
Filtering Method ◽  
Product Recommendation ◽  
Sparsity Problem

Recommender systems are becoming increasingly popular, and collaborative filtering method is one of the most important technologies in recommender systems. The ability of recommender systems to make correct predictions is fundamentally determined by the quality and fittingness of the collaborative filtering that implements them. It is currently mainly used for business purposes such as product recommendation. Collaborative filtering has two types. One is user based collaborative filtering using the similarity between users to predict and the other is item based collaborative filtering using the similarity between items. Although both of them are successfully applied in wide regions, they suffer from a fundamental problem of data sparsity. This paper gives a personalized collaborative filtering recommendation algorithm combining the item rating similarity and the item classification similarity. This method can alleviate the data sparsity problem in the recommender systems

scholarly journals Parallelization of Hybrid Content Based and Collaborative Filtering Method in Recommendation System with Apache Spark

2019 ◽  
Vol 13 (2) ◽  
pp. 149
Author(s):  
Rakhmad Ikhsanudin ◽  
Edi Winarko
Keyword(s):  
Collaborative Filtering ◽  
Hybrid Method ◽  
Recommendation System ◽  
Apache Spark ◽  
Test Results ◽  
Popular Method ◽  
Filtering Method ◽  
Hybrid Collaborative Filtering

Collaborative Filtering as a popular method that used for recommendation system. Improvisation is done in purpose of improving the accuracy of the recommendation. A way to do this is to combine with content based method. But the hybrid method has a lack in terms of scalability. The main aim of this research is to solve problem that faced by recommendation system with hybrid collaborative filtering and content based method by applying parallelization on the Apache Spark platform.Based on the test results, the value of hybrid collaborative filtering method and content based on Apache Spark cluster with 2 node worker is 1,003 which then increased to 2,913 on cluster having 4 node worker. The speedup got more increased to 5,85 on the cluster that containing 7 node worker.

Song Recommendations Based on Artists with Cosine Similarity Algorithms and K-Nearest Neighbor

2020 ◽  
Vol 8 (4) ◽  
pp. 367
Author(s):  
Muhammad Arief Budiman ◽  
Gst. Ayu Vida Mastrika Giri
Keyword(s):  
Collaborative Filtering ◽  
Mobile Phones ◽  
Recommendation System ◽  
Nearest Neighbor ◽  
Cosine Similarity ◽  
Music Recommendation ◽  
K Nearest Neighbor ◽  
Filtering Method ◽  
K Nearest Neighbor Algorithm ◽  
Music Recommendation System

The development of the music industry is currently growing rapidly, millions of music works continue to be issued by various music artists. As for the technologies also follows these developments, examples are mobile phones applications that have music subscription services, namely Spotify, Joox, GrooveShark, and others. Application-based services are increasingly in demand by users for streaming music, free or paid. In this paper, a music recommendation system is proposed, which the system itself can recommend songs based on the similarity of the artist that the user likes or has heard. This research uses Collaborative Filtering method with Cosine Similarity and K-Nearest Neighbor algorithm. From this research, a system that can recommend songs based on artists who are related to one another is generated.

scholarly journals A New Weighted-learning Approach for Exploiting Data Sparsity in Tag-based Item Recommendation Systems

2021 ◽  
Vol 14 (1) ◽  
pp. 387-399
Author(s):  
Noor Ifada ◽  
◽  
Richi Nayak ◽  
Keyword(s):  
Recommendation System ◽  
Recommendation Systems ◽  
Learning Approach ◽  
Tensor Model ◽  
Learning Approaches ◽  
Data Sparsity ◽  
Tensor Models ◽  
Sparsity Problem ◽  
Weighted Rank

The tag-based recommendation systems that are built based on tensor models commonly suffer from the data sparsity problem. In recent years, various weighted-learning approaches have been proposed to tackle such a problem. The approaches can be categorized by how a weighting scheme is used for exploiting the data sparsity – like employing it to construct a weighted tensor used for weighing the tensor model during the learning process. In this paper, we propose a new weighted-learning approach for exploiting data sparsity in tag-based item recommendation system. We introduce a technique to represent the users’ tag preferences for leveraging the weighted-learning approach. The key idea of the proposed technique comes from the fact that users use different choices of tags to annotate the same item while the same tag may be used to annotate various items in tag-based systems. This points out that users’ tag usage likeliness is different and therefore their tag preferences are also different. We then present three novel weighting schemes that are varied in manners by how the ordinal weighting values are used for labelling the users’ tag preferences. As a result, three weighted tensors are generated based on each scheme. To implement the proposed schemes for generating item recommendations, we develop a novel weighted-learning method called as WRank (Weighted Rank). Our experiments show that considering the users' tag preferences in the tensor-based weightinglearning approach can solve the data sparsity problem as well as improve the quality of recommendation.

Sign in / Sign up

Export Citation Format

Share Document