Trust Prediction for Online Social Networks with Integrated Time-Aware Similarity

2021 ◽  
Vol 15 (6) ◽  
pp. 1-30
Author(s):  
Xiaofeng Gao ◽  
Wenyi Xu ◽  
Mingding Liao ◽  
Guihai Chen

Online social networks gain increasing popularity in recent years. In online social networks, trust prediction is significant for recommendations of high reputation users as well as in many other applications. In the literature, trust prediction problem can be solved by several strategies, such as matrix factorization, trust propagation, and -NN search. However, most of the existing works have not considered the possible complementarity among these mainstream strategies to optimize their effectiveness and efficiency. In this article, we propose a novel trust prediction approach named iSim : an integrated time-aware similarity-based collaborative filtering approach leveraging on user similarity, which integrates three kinds of factors to measure user similarity, including vector space similarity, time-aware matrix factorization, and propagated trust. This article is the first work in the literature employing time-aware matrix factorization and propagated trust in the study of similarity. Additionally, we use several methods like adding inverted index to reduce the time complexity of iSim , and provide its theoretical time bound. Moreover, we also provide the detailed overview and theoretical analysis of the existing works. Finally, the extensive experiments with real-world datasets show that iSim achieves great improvement for both efficiency and effectiveness over the state-of-the-art approaches.

2021 ◽  
Vol 2 (4) ◽  
pp. 401-417
Author(s):  
Seyed M. Ghafari ◽  
Amin Beheshti ◽  
Aditya Joshi ◽  
Cecile Paris ◽  
Shahpar Yakhchi ◽  
...  

Trust among users in online social networks is a key factor in determining the amount of information that is perceived as reliable. Compared to the number of users in online social networks, user-specified trust relations are very sparse. This makes the pair-wise trust prediction a challenging task. Social studies have investigated trust and why people trust each other. The relation between trust and personality traits of people who established those relations, has been proved by social theories. In this work, we attempt to alleviate the effect of the sparsity of trust relations by extracting implicit information from the users, in particular, by focusing on users' personality traits and seeking a low-rank representation of users. We investigate the potential impact on the prediction of trust relations, by incorporating users' personality traits based on the Big Five factor personality model. We evaluate the impact of similarities of users' personality traits and the effect of each personality trait on pair-wise trust relations. Next, we formulate a new unsupervised trust prediction model based on tensor decomposition. Finally, we empirically evaluate this model using two real-world datasets. Our extensive experiments confirm the superior performance of our model compared to the state-of-the-art approaches.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 144292-144309
Author(s):  
Seyed Mohssen Ghafari ◽  
Amin Beheshti ◽  
Aditya Joshi ◽  
Cecile Paris ◽  
Adnan Mahmood ◽  
...  

2019 ◽  
Vol 8 (2S3) ◽  
pp. 1260-1265

Social desire is Associate in Nursing mountaineering brand-new characteristic in online social networks. It positions unique issues and opportunities for referral. Throughout this paper, we typically have a tendency to installation clusteria collection of matrix factorization (MF) and nearest-neighbour (NN)- primarily based absolutely recommender systems (RSs) that check out person social network further to group affiliation facts for social desire belief. Via try outs actual social possibility traces, we have a propensity to illustrate that social network and cluster affiliation records will significantly decorate the accuracy of popularity-based totally definitely preference referral, further to social media information controls collection affiliation information in NN-primarily based techniques. We regularly have a tendency to similarly test that social in addition to cluster data is an awful lot added treasured to cold customers than to huge humans. In our experiments, smooth meta route based totally totally in reality truely definitely NN designs defeated computation-massive tool regularity versions in warmth-vote casting referral, on the equal time as users' passions for non warm temperature ballot 's may be higher strip-mined through device frequency models. We have a tendency to greater suggest a hybrid RS, cloth truely truly one in every of a type solitary strategies to accumulate the maximum dependable pinnacle-pinnacle sufficient hit price


Sign in / Sign up

Export Citation Format

Share Document