A social recommender system based on matrix factorization considering dynamics of user preferences

Authors

Abstract:

With the expansion of social networks, the use of recommender systems in these networks has attracted considerable attention. Recommender systems have become an important tool for alleviating the information that overload problem of users by providing personalized recommendations to a user who might like based on past preferences or observed behavior about one or various items. In these systems, the users’ behavior is dynamic and their preferences change over time for different reasons. The adaptability of recommender systems to capture the evolving user preferences, which are changing constantly, is essential. Recent studies point out that the modeling and capturing the dynamics of user preferences lead to significant improvements in recommendation accuracy. In spite of the importance of this issue, only a few approaches recently proposed that take into account the dynamic behavior of the users in making recommendations. Most of these approaches are based on the matrix factorization scheme. However, most of them assume that the preference dynamics are homogeneous for all users, whereas the changes in user preferences may be individual and the time change pattern for each user differs. In addition, because the amount of numerical ratings dramatically reduced in a specific time period, the sparsity problem in these approaches is more intense. Exploiting social information such as the trust relations between users besides the users’ rating data can help to alleviate the sparsity problem. Although social information is also very sparse, especially in a time period, it is complementary to rating information. Some works use tensor factorization to capture user preference dynamics. Despite the success of these works, the processing and solving the tensor decomposition is hard and usually leads to very high computing costs in practice, especially when the tensor is large and sparse. In this paper, considering that user preferences change individually over time, and based on the intuition that social influence can affect the users’ preferences in a recommender system, a social recommender system is proposed. In this system, the users’ rating information and social trust information are jointly factorized based on a matrix factorization scheme. Based on this scheme, each users and items is characterized by a sets of features indicating latent factors of the users and items in the system. In addition, it is assumed that user preferences change smoothly, and the user preferences in the current time period depend on his/her preferences in the previous time period. Therefore, the user dynamics are modeled into this framework by learning a transition matrix of user preferences between two consecutive time periods for each individual user. The complexity analysis implies that this system can be scaled to large datasets with millions of users and items. Moreover, the experimental results on a dataset from a popular product review website, Epinions, show that the proposed system performs better than competitive methods in terms of MAE and RMSE.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A new approach for building recommender system using non negative matrix factorization method

Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is ​​decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...

full text

Assessing Impacts of a Power User Attack on a Matrix Factorization Collaborative Recommender System

Collaborative Filtering (CF) Recommender Systems (RSs) help users deal with the information overload they face when browsing, searching, or shopping for products and services. Power users are those individuals that are able to exert substantial influence over the recommendations made to other users, and RS operators encourage the existence of power user communities and leverage them to help fel...

full text

CGMF: Coupled Group-Based Matrix Factorization for Recommender System

With the advent of social influence, social recommender systems have become an active research topic for making recommendations based on the ratings of the users that have close social relations with the given user. The underlying assumption is that a user’s taste is similar to his/her friends’ in social networking. In fact, users enjoy different groups of items with different preferences. A us...

full text

A Hybrid Approach to Recommender Systems based on Matrix Factorization

Due to the huge amount of information available online, the need of personalization and filtering systems is growing permanently. Recommendation systems constitute a specific type of information filtering technique that attempt to present items according to the interest expressed by a user. Commonly online recommender are employed for e-commerce applications or customer adapted websites. In gen...

full text

Designing a trust-based recommender system in Social Rating Networks

One of the most common styles of business today is electronic business, since it is considered as a principal mean for financial transactions among advanced countries. In view of the fact that due to the evolution of human knowledge and the increase of expectations following that, traditional marketing in electronic business cannot meet current generation’s needs, in order to survive, organizat...

full text

Evolutionary User Clustering Based on Time-Aware Interest Changes in the Recommender System

The plenty of data on the Internet has created problems for users and has caused confusion in finding the proper information. Also, users' tastes and preferences change over time. Recommender systems can help users find useful information. Due to changing interests, systems must be able to evolve. In order to solve this problem, users are clustered that determine the most desirable users, it pa...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 18  issue 1

pages  28- 13

publication date 2021-05

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023