Recommender System with Composite Social Trust Networks

2016 ◽  
Vol 13 (2) ◽  
pp. 56-73 ◽  
Author(s):  
Chaochao Chen ◽  
Xiaolin Zheng ◽  
Mengying Zhu ◽  
Litao Xiao
Keyword(s):  
Online Social Networks ◽  
Prediction Accuracy ◽  
Social Trust ◽  
Convergence Speed ◽  
Trust Network ◽  
True Value ◽  
Trust Networks ◽  
Factorization Model ◽  
Implicit Trust ◽  
Probabilistic Matrix Factorization

The development of online social networks has increased the importance of social recommendations. Social recommender systems are based on the idea that users who are linked in a social trust network tend to share similar interests. Thus, how to build an accurate social trust network will greatly affect recommendation performance. However, existing trust-based recommender approaches do not fully utilize social information to build rational trust networks and thus have low prediction accuracy and slow convergence speed. In this paper, the authors propose a composite trust-based probabilistic matrix factorization model, which is mainly composed of two steps: In step 1, the existing explicit trust network and the inferred implicit trust network are used to build a composite trust network. In step 2, the composite trust network is used to minimize both the rating difference and the trust difference between the true value and the inferred value. Experiments based on an Epinions dataset show that the authors' approach has significantly higher prediction accuracy and convergence speed than traditional collaborative filtering technology and the state-of-the-art trust-based recommendation approaches.

scholarly journals TrustRec: An effective approach to exploit implicit trust and distrust relationships along with explicitones for accurate recommendations

2020 ◽  
pp. 39-39
Author(s):  
Reyhani Hamedani ◽  
Irfan Ali ◽  
Jiwon Hong ◽  
Sang-Wook Kim
Keyword(s):  
Matrix Factorization ◽  
Computational Cost ◽  
Effective Solution ◽  
Trust Networks ◽  
Novel Approach ◽  
Factorization Model ◽  
Implicit Trust ◽  
The Matrix ◽  
Effectiveness And Efficiency ◽  
Single Matrix

Trust-aware recommendation approaches are widely used to mitigate the cold-start problem in recommender systems by utilizing trust networks. In this paper, we point out the problems of existing trust-aware recommendation approaches as follows: (P1) exploiting sparse explicit trust and distrust relationships; (P2) considering a misleading assumption that a user pair having a trust/distrust relationship certainly has a similar/dissimilar preference in practice; (P3) employing the transitivity of distrust relationships. Then, we propose TrustRec, a novel approach based on the matrix factorization that provides an effective solution to each of the afore mentioned problems and incorporates all of them in a single matrix factorization model. Furthermore, TrustRec exploits only top-k most similar trustees and dissimilar distrustees of each user to improve both the computational cost and accuracy. The results of our extensive experiments demonstrate that TructRec outperforms existing approaches in terms of both effectiveness and efficiency.

scholarly journals Group Recommendation Systems Based on External Social-Trust Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Guang Fang ◽  
Lei Su ◽  
Di Jiang ◽  
Liping Wu
Keyword(s):  
Social Trust ◽  
Recommendation Systems ◽  
External Information ◽  
Group Recommendation ◽  
Trust Network ◽  
Traditional Group ◽  
Preference Rating ◽  
Trust Networks ◽  
Network Utilization ◽  
Group Profile

With the development of social networks and online mobile communities, group recommendation systems support users’ interaction with similar interests or purposes with others. We often provide some advices to the close friends, such as listening to favorite music and sharing favorite dishes. However, users’ personalities have been ignored by the traditional group recommendation systems while the majority is satisfied. In this paper, a method of group recommendation based on external social-trust networks is proposed, which builds a group profile by analyzing not only users’ preferences, but also the social relationships between members inside and outside of the group. We employ the users’ degree of disagreement to adjust group preference rating by external information of social-trust network. Moreover, having a discussion about different social network utilization ratio, we proposed a method to work for smaller group size. The experimental results show that the proposed method has consistently higher precision and leads to satisfactory recommendations for groups.

TrustSVD: A Novel Trust-Based Matrix Factorization Model with User Trust and Item Ratings

2017 ◽  
Vol 7 (11) ◽  
pp. 7 ◽  
Author(s):  
K Sobha Rani
Keyword(s):  
Matrix Factorization ◽  
Social Trust ◽  
State Of The Art ◽  
Data Sets ◽  
Real World Data ◽  
Recommendation Algorithm ◽  
Active User ◽  
Factorization Model ◽  
The Social ◽  
Matrix Factorization Technique

Collaborative filtering suffers from the problems of data sparsity and cold start, which dramatically degrade recommendation performance. To help resolve these issues, we propose TrustSVD, a trust-based matrix factorization technique. By analyzing the social trust data from four real-world data sets, we conclude that not only the explicit but also the implicit influence of both ratings and trust should be taken into consideration in a recommendation model. Hence, we build on top of a state-of-the-art recommendation algorithm SVD++ which inherently involves the explicit and implicit influence of rated items, by further incorporating both the explicit and implicit influence of trusted users on the prediction of items for an active user. To our knowledge, the work reported is the first to extend SVD++ with social trust information. Experimental results on the four data sets demonstrate that our approach TrustSVD achieves better accuracy than other ten counterparts, and can better handle the concerned issues.

scholarly journals Power-law Distribution Aware Trust Prediction

2018 ◽  
Author(s):  
Xiao Wang ◽  
Ziwei Zhang ◽  
Jing Wang ◽  
Peng Cui ◽  
Shiqiang Yang
Keyword(s):  
Power Law ◽  
Low Rank ◽  
Superior Performance ◽  
Power Law Distribution ◽  
Trust Network ◽  
Trust Prediction ◽  
Trust Networks ◽  
The Arts ◽  
Proof Of Correctness ◽  
Closure Structure

Trust prediction, aiming to predict the trust relations between users in a social network, is a key to helping users discover the reliable information. Many trust prediction methods are proposed based on the low-rank assumption of a trust network. However, one typical property of the trust network is that the trust relations follow the power-law distribution, i.e., few users are trusted by many other users, while most tail users have few trustors. Due to these tail users, the fundamental low-rank assumption made by existing methods is seriously violated and becomes unrealistic. In this paper, we propose a simple yet effective method to address the problem of the violated low-rank assumption. Instead of discovering the low-rank component of the trust network alone, we learn a sparse component of the trust network to describe the tail users simultaneously. With both of the learned low-rank and sparse components, the trust relations in the whole network can be better captured. Moreover, the transitive closure structure of the trust relations is also integrated into our model. We then derive an effective iterative algorithm to infer the parameters of our model, along with the proof of correctness. Extensive experimental results on real-world trust networks demonstrate the superior performance of our proposed method over the state-of-the-arts.

Improving Recommendation Accuracy and Diversity via Multiple Social Factors and Social Circles

2019 ◽  
pp. 132-154
Author(s):  
Yong Feng ◽  
Heng Li ◽  
Zhuo Chen ◽  
Baohua Qiang
Keyword(s):  
Social Factors ◽  
Online Social Networks ◽  
Online Information ◽  
Information Discovery ◽  
Proposed Model ◽  
Probabilistic Matrix Factorization ◽  
Series Of Experiments ◽  
Networks Analysis ◽  
Recommendation Accuracy ◽  
Improved Performance

Recommender systems have been widely employed to suggest personalized online information to simplify users' information discovery process. With the popularity of online social networks, analysis and mining of social factors and social circles have been utilized to support more effective recommendations, but have not been fully investigated. In this chapter, the authors propose a novel recommendation model with the consideration of more comprehensive social factors and topics. To further enhance recommendation accuracy, four social factors are simultaneously injected into the recommendation model based on probabilistic matrix factorization. Meanwhile, the authors explore several new methods to measure these social factors. Moreover, they infer explicit and implicit social circles to enhance the performance of recommendation diversity. Finally, the authors conduct a series of experiments on publicly available data. Experimental results show the proposed model achieves significantly improved performance over the existing models in which social information have not been fully considered.

scholarly journals AgreeRelTrust—a Simple Implicit Trust Inference Model for Memory-Based Collaborative Filtering Recommendation Systems

Electronics ◽  
2019 ◽  
Vol 8 (4) ◽  
pp. 427 ◽  
Author(s):  
Zahir ◽  
Yuan ◽  
Moniz
Keyword(s):  
Collaborative Filtering ◽  
Prediction Accuracy ◽  
Computational Cost ◽  
Recommendation Systems ◽  
Similarity Measures ◽  
Extraction Methods ◽  
Common Interest ◽  
Trust Relationship ◽  
Public Data ◽  
Implicit Trust

Recommendation systems alleviate the problem of information overload by helping users find information relevant to their preference. Memory-based recommender systems use correlation-based similarity to measure the common interest among users. The trust between users is often used to address the issues associated with correlation-based similarity measures. However, in most applications, the trust relationships between users are not available. A popular method to extract the implicit trust relationship between users employs prediction accuracy. This method has several problems such as high computational cost and data sparsity. In this paper, addressing the problems associated with prediction accuracy-based trust extraction methods, we proposed a novel trust-based method called AgreeRelTrust. Unlike accuracy-based methods, this method does not require the calculation of initial prediction and the trust relationship is more meaningful. The collective agreements between any two users and their relative activities are fused to obtain the trust relationship. To evaluate the usefulness of our method, we applied it to three public data sets and compared the prediction accuracy with well-known collaborative filtering methods. The experimental results show our method has large improvements over the other methods.

Sign in / Sign up

Export Citation Format

Share Document