Show simple item record

dc.contributor.advisorChairperson, Graduate Committee: John Shepparden
dc.contributor.authorHamilton, Andrew Johnsonen
dc.description.abstractTrust 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.en
dc.publisherMontana State University - Bozeman, College of Engineeringen
dc.subject.lcshSocial networksen
dc.titleAn anytime algorithm for trust propagation in social networksen
dc.typeProfessional Paperen
dc.rights.holderCopyright 2011 by Andrew Johnson Hamiltonen
thesis.catalog.ckey1975261en, Graduate Committee: Rockford J. Ross; Rafal A. Angryken Science.en Paperen

Files in this item


This item appears in the following Collection(s)

Show simple item record

MSU uses DSpace software, copyright © 2002-2017  Duraspace. For library collections that are not accessible, we are committed to providing reasonable accommodations and timely access to users with disabilities. For assistance, please submit an accessibility request for library material.