An anytime algorithm for trust propagation in social networks
Trust 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...
Main Author: | Hamilton, Andrew Johnson |
---|---|
Language: | en |
Published: |
2011
|
Online Access: | http://etd.lib.montana.edu/etd/2011/hamilton/HamiltonA1211.pdf |
Similar Items
-
Analysis of Bayesian anytime inference algorithms
by: Burgess, Scott Alan
Published: (2012) -
Performance Comparison of AI Algorithms : Anytime Algorithms
by: Butt, Rehman
Published: (2008) -
Performance Comparison of AI Algorithms : Anytime Algorithms
by: Butt, Rehman
Published: (2008) -
An anytime algorithm for optimal coalition structure generation
by: Rahwan, Talal, et al.
Published: (2009) -
An anytime algorithm for real-time routing problems
by: Zhou, Jian Xin, et al.
Published: (1995)