Extracting Implicit Social Relation for Social Recommendation Techniques in User Rating Prediction

Recommendation plays an increasingly important role in our daily lives. Recommender systems automatically suggest items to users that might be interesting for them. Recent studies illustrate that incorporating social trust in Matrix Factorization methods demonstrably improves accuracy of rating prediction. Such approaches mainly use the trust scores explicitly expressed by users. However, it is often challenging to have users provide explicit trust scores of each other. There exist quite a few works, which propose Trust Metrics to compute and predict trust scores between users based on their interactions. In this paper, first we present how social relation can be extracted from users' ratings to items by describing Hellinger distance between users in recommender systems. Then, we propose to incorporate the predicted trust scores into social matrix factorization models. By analyzing social relation extraction from three well-known real-world datasets, which both: trust and recommendation data available, we conclude that using the implicit social relation in social recommendation techniques has almost the same performance compared to the actual trust scores explicitly expressed by users. Hence, we build our method, called Hell-TrustSVD, on top of the state-of-the-art social recommendation technique to incorporate both the extracted implicit social relations and ratings given by users on the prediction of items for an active user. To the best of our knowledge, this is the first work to extend TrustSVD with extracted social trust information. The experimental results support the idea of employing implicit trust into matrix factorization whenever explicit trust is not available, can perform much better than the state-of-the-art approaches in user rating prediction

INTRODUCTION COMPETITORS FROM A LARGE RANGE OF DISTINCT DATA

Our analysis of the belief that four sets of data in the real world are established by trust and classification is exactly the same, and all are precise and precise propositions. Compose Comparative Trust BSM has demonstrated its ability to measure such large datasets. Analyzing social data from four realities in the real world suggests that this is not just a clear idea, but also considers the range and overall impact of trust as a reward. Second, this way of thinking is based on temples that concentrate more money on the user's ability to use, but ignore the results of their self-esteem. The effects are unclear or ambiguous. Trusted BSM proposes how to create a proposal based on a matrix. As a result, Trust BSM creates the most advanced BSM Recommendations Board with a clear, clear and reliable impact for users with active user products. The proposed policy of social information is the first BSM transfer

Comparative Analysis of Different Trust Metrics of User-User Trust-Based Recommendation System

Information overload is the biggest challenge nowadays for any website, especially e-commerce websites. However, this challenge arises for the fast growth of information on the web (WWW) with easy access to the internet. Collaborative filtering based recommender system is the most useful application to solve the information overload problem by filtering relevant information for the users according to their interests. But, the existing system faces some significant limitations such as data sparsity, low accuracy, cold-start, and malicious attacks. To alleviate the mentioned issues, the relationship of trust incorporates in the system where it can be between the users or items, and such system is known as the trust-based recommender system (TBRS). From the user perspective, the motive of the TBRS is to utilize the reliability between the users to generate more accurate and trusted recommendations. However, the study aims to present a comparative analysis of different trust metrics in the context of the type of trust definition of TBRS. Also, the study accomplishes twenty-four trust metrics in terms of the methodology, trust properties \& measurement, validation approaches, and the experimented dataset

Factored similarity models with social trust for top-N item recommendation

Trust-aware recommender systems have attracted much attention recently due to the prevalence of social networks. However, most existing trust-based approaches are designed for the recommendation task of rating prediction. Only few trust-aware methods have attempted to recommend users an ordered list of interesting items, i.e., item recommendation. In this article, we propose three factored similarity models with the incorporation of social trust for item recommendation based on implicit user feedback. Specifically, we introduce a matrix factorization technique to recover user preferences between rated items and unrated ones in the light of both user-user and item-item similarities. In addition, we claim that social trust relationships also have an important impact on a user’s preference for a specific item. Experimental results on three real-world data sets demonstrate that our approach achieves superior ranking performance to other counterparts.Accepted versio

A probabilistic model for user interest propagation in recommender systems

User interests modeling has been exploited as a critical component to improve the predictive performance of recommender systems. However, with the absence of explicit information to model user interests, most approaches to recommender systems exploit users activities (user generated contents or user ratings) to inference the interest of users. In reality, the relationship among users also serves as a rich source of information of shared interest. To this end, we propose a framework which avoids the sole dependence of user activities to infer user interests and allows the exploitation of the direct relationship between users to propagate user interests to improve system's performance. In this paper, we advocate a novel modeling framework. We construct a probabilistic user interests model and propose a user interests propagation algorithm (UIP), which applies a factor graph based approach to estimate the distribution of the interests of users. Moreover, we incorporate our UIP algorithm with conventional matrix factorization (MF) for recommender systems. Experimental results demonstrate that our proposed approach outperforms previous methods used for recommender systems