{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:35:43Z","timestamp":1771702543117,"version":"3.50.1"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"name":"State Key Lab for Software Development Environment"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2014,6]]},"abstract":"<jats:p>The prediction of trust relationships in social networks plays an important role in the analytics of the networks. Although various link prediction algorithms for general networks may be adapted for this purpose, the recent notion of \u201ctrust propagation\u201d has been shown to effectively capture the trust-formation mechanisms and resulted in an effective prediction algorithm. This article builds on the concept of trust propagation and presents a probabilistic trust propagation model. Our model exploits the modern framework of probabilistic graphical models, more specifically, factor graphs. Under this model, the trust prediction problem can be formulated as a statistical inference problem and we derive the belief propagation algorithm as a solver for trust prediction. The model and algorithm are tested using datasets from Epinions and Ciao, by which performance advantages over the previous algorithms are demonstrated.<\/jats:p>","DOI":"10.1145\/2629530","type":"journal-article","created":{"date-parts":[[2014,7,22]],"date-time":"2014-07-22T15:08:20Z","timestamp":1406041700000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Trust Prediction via Belief Propagation"],"prefix":"10.1145","volume":"32","author":[{"given":"Richong","family":"Zhang","sequence":"first","affiliation":[{"name":"State Key Laboratory of Software Development Environment, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongyi","family":"Mao","sequence":"additional","affiliation":[{"name":"University of Ottawa, Ottawa, Ontario"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/502585.502638"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875084"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935914"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594173.1594174"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988727"},{"key":"e_1_2_1_8_1","volume-title":"Johnson","author":"Horn Roger A.","year":"1990","unstructured":"Roger A. Horn and Charles R . Johnson . 1990 . Matrix Analysis. Cambridge University Press . Roger A. Horn and Charles R. Johnson. 1990. Matrix Analysis. Cambridge University Press."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557067"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_2_1_12_1","volume-title":"Markov Random Fields and Their Applications. Contemporary Mathematics","author":"Kindermann Ross","unstructured":"Ross Kindermann and J. Laurie Snell . 1980. Markov Random Fields and Their Applications. Contemporary Mathematics , Vol. 1 . Ross Kindermann and J. Laurie Snell. 1980. Markov Random Fields and Their Applications. Contemporary Mathematics, Vol. 1."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Steffen L. Lauritzen. 1996. Graphical Models. Oxford Statistical Science Series. Steffen L. Lauritzen. 1996. Graphical Models. Oxford Statistical Science Series.","DOI":"10.1093\/oso\/9780198522195.001.0001"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1038\/234034a0"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:7"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI'10)","author":"Liu Guanfeng","unstructured":"Guanfeng Liu , Yan Wang , and Mehmet A. Orgun . 2010. Optimal social trust path selection in complex social networks . In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI'10) . Guanfeng Liu, Yan Wang, and Mehmet A. Orgun. 2010. Optimal social trust path selection in complex social networks. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI'10)."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI'11)","author":"Liu Guanfeng","unstructured":"Guanfeng Liu , Yan Wang , and Mehmet A. Orgun . 2011. Trust transitivity in complex social networks . In Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI'11) . Guanfeng Liu, Yan Wang, and Mehmet A. Orgun. 2011. Trust transitivity in complex social networks. In Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI'11)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2012.210"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571978"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297231.1297235"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124309"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339574"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772790"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2006.11.003"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/987681.987786"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629530","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2629530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:18Z","timestamp":1750230078000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["10.1145\/2629530"],"URL":"https:\/\/doi.org\/10.1145\/2629530","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2013-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}