183 research outputs found
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
Recommendation using DMF-based fine tuning method
© 2016, Springer Science+Business Media New York. Recommender Systems (RS) have been comprehensively analyzed in the past decade, Matrix Factorization (MF)-based Collaborative Filtering (CF) method has been proved to be an useful model to improve the performance of recommendation. Factors that inferred from item rating patterns shows the vectors which are useful for MF to characterize both items and users. A recommendation can concluded from good correspondence between item and user factors. A basic MF model starts with an object function, which is consisted of the squared error between original training matrix and predicted matrix as well as the regularization term (regularization parameters). To learn the predicted matrix, recommender systems minimize the squared error which has been regularized. However, two important details have been ignored: (1) the predicted matrix will be more and more accuracy as the iterations carried out, then a fix value of regularization parameters may not be the most suitable choice. (2) the final distribution trend of ratings of predicted matrix is not similar with the original training matrix. Therefore, we propose a Dynamic-MF algorithm and fine tuning method which is quite general to overcome the mentioned detail problems. Some other information, such as social relations, etc, can be easily incorporated into this method (model). The experimental analysis on two large datasets demonstrates that our approaches outperform the basic MF-based method
A Dynamic Trust Relations-Based Friend Recommendation Algorithm in Social Network Systems
A discovered algorithm based on the dynamic trust relations of users in a social network system (SNS) was proposed aiming at getting useful information more efficiently in an SNS. The proposed dynamic model combined the interests and trust relations of users to explore their good friends for recommendations. First, the network based on the interests and trust relations of users was set up. Second, the temporal factor was added to the model, then a dynamic model of the degree of the interest and trust relations of the users was calculated. Lastly, the similarities among the users were measured via this dynamic model, and the recommendation list of good friends was achieved. Results showed that the proposed algorithm effectively described the changes in the interest similarities and trust relations of users with time, and the recommended result was more accurate and effective than the traditional ones
Recommendations based on social links
The goal of this chapter is to give an overview of recent works on the development of social link-based recommender systems and to offer insights on related issues, as well as future directions for research. Among several kinds of social recommendations, this chapter focuses on recommendations, which are based on usersâ self-defined (i.e., explicit) social links and suggest items, rather than people of interest. The chapter starts by reviewing the needs for social link-based recommendations and studies that explain the viability of social networks as useful information sources. Following that, the core part of the chapter dissects and examines modern research on social link-based recommendations along several dimensions. It concludes with a discussion of several important issues and future directions for social link-based recommendation research
Simultaneous Inference of User Representations and Trust
Inferring trust relations between social media users is critical for a number
of applications wherein users seek credible information. The fact that
available trust relations are scarce and skewed makes trust prediction a
challenging task. To the best of our knowledge, this is the first work on
exploring representation learning for trust prediction. We propose an approach
that uses only a small amount of binary user-user trust relations to
simultaneously learn user embeddings and a model to predict trust between user
pairs. We empirically demonstrate that for trust prediction, our approach
outperforms classifier-based approaches which use state-of-the-art
representation learning methods like DeepWalk and LINE as features. We also
conduct experiments which use embeddings pre-trained with DeepWalk and LINE
each as an input to our model, resulting in further performance improvement.
Experiments with a dataset of 356K user pairs show that the proposed
method can obtain an high F-score of 92.65%.Comment: To appear in the proceedings of ASONAM'17. Please cite that versio
TSCMF: Temporal and social collective matrix factorization model for recommender systems
In real-world recommender systems, user preferences are dynamic and typically change
over time. Capturing the temporal dynamics of user preferences is essential to design an efficient
personalized recommender system and has recently attracted significant attention. In
this paper, we consider user preferences change individually over time. Moreover, based on
the intuition that social influence can affect the usersâ preferences in a recommender system,
we propose a Temporal and Social CollectiveMatrix Factorization model called TSCMF for
recommendation.We jointly factorize the usersâ rating information and social trust information
in a collective matrix factorization framework by introducing a joint objective function.
We model user dynamics into this framework by learning a transition matrix of user preferences
between two successive time periods for each individual user. We present an efficient
optimization algorithm based on stochastic gradient descent for solving the objective function.
The experiments on a real-world dataset illustrate that the proposed model outperforms
the competitive methods.Moreover, the complexity analysis demonstrates that the proposed
model can be scaled up to large datasets
Computational intelligent methods for trusting in social networks
104 p.This Thesis covers three research lines of Social Networks. The first proposed reseach line is related with Trust. Different ways of feature extraction are proposed for Trust Prediction comparing results with classic methods. The problem of bad balanced datasets is covered in this work. The second proposed reseach line is related with Recommendation Systems. Two experiments are proposed in this work. The first experiment is about recipe generation with a bread machine. The second experiment is about product generation based on rating given by users. The third research line is related with Influence Maximization. In this work a new heuristic method is proposed to give the minimal set of nodes that maximizes the influence of the network
- âŠ