Scholarship & Research
Permanent URI for this communityhttps://scholarworks.montana.edu/handle/1/1
Browse
2 results
Search Results
Item Interpersonal trust measurements from social interactions in Facebook(Montana State University - Bozeman, College of Engineering, 2014) Li, Xiaoming; Chairperson, Graduate Committee: Qing YangInterpersonal trust is widely cited as an important component in several network systems such as peer-to-peer (P2P) networks, e-commerce and semantic web. However, there has been less research on measuring interpersonal trust due to the difficulty of collecting data that accurately reflects interpersonal trust. To address this issue, we quantify interpersonal trust by analyzing the social interactions between users and their friends on Facebook. Currently, friends of a user in almost all online social networks (OSN) are indistinguishable, i.e. there is no explicit indication of the strength of trust between a user and her close friends, as opposed to acquaintances. Existing research on estimating interpersonal trust in OSN faces two fundamental problems: the lacks of established dataset and a convincing evaluation method. In this thesis, we consider bidirectional interacting data in OSN to deconstruct a user's social behavior, and apply Principle Component Analysis (PCA) to estimate the interpersonal trust. A Facebook app, itrust, is developed to collect interaction data and calculate interpersonal trust. Moreover, we adopt the Kendall's tau and Generalized Kendall's tau methods to evaluate the accuracy of ranking list generated by itrust. Results show that itrust achieves more accurate interpersonal trust measurements than existing methods.Item An anytime algorithm for trust propagation in social networks(Montana State University - Bozeman, College of Engineering, 2011) Hamilton, Andrew Johnson; Chairperson, Graduate Committee: John SheppardTrust propagation in social networks is a challenging task. It is difficult to model human trust, and the data is huge and very sparse. Due to these challenges, the algorithms available to propagate trust have complexity issues. We used the MRFTrust algorithm created by Tosun and Sheppard to produce an anytime algorithm for trust propagation. To do this we use sampling techniques and increased horizon size to reduce the complexity and decrease runtimes. We show that we can dramatically reduce the number of nodes considered in the algorithm, yet still achieve a superior result.