{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:40:34Z","timestamp":1761597634962,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T00:00:00Z","timestamp":1442361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,9,16]]},"DOI":"10.1145\/2792838.2800198","type":"proceedings-article","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T12:36:32Z","timestamp":1441715792000},"page":"51-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["PushTrust"],"prefix":"10.1145","author":[{"given":"Rana","family":"Forsati","sequence":"first","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iman","family":"Barjasteh","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farzan","family":"Masrour","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdol-Hossein","family":"Esfahanian","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hayder","family":"Radha","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,9,16]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"47","volume-title":"The network completion problem: Inferring missing nodes and edges in networks.\" in SDM","author":"Kim M.","year":"2011","unstructured":"M. Kim and J. Leskovec , \" The network completion problem: Inferring missing nodes and edges in networks.\" in SDM . SIAM , 2011 , pp. 47 -- 58 . M. Kim and J. Leskovec, \"The network completion problem: Inferring missing nodes and edges in networks.\" in SDM. SIAM, 2011, pp. 47--58."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsfs.2011.0050"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.254"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm173"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2185803"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0908366106"},{"key":"e_1_3_2_2_7_1","first-page":"209","article-title":"Network completion and survey sampling","author":"Hanneke S.","year":"2009","unstructured":"S. Hanneke and E. P. Xing , \" Network completion and survey sampling ,\" in AISTAT , 2009 , pp. 209 -- 215 . S. Hanneke and E. P. Xing, \"Network completion and survey sampling,\" in AISTAT, 2009, pp. 209--215.","journal-title":"AISTAT"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.v58:7"},{"key":"e_1_3_2_2_9_1","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"Srebro N.","year":"2004","unstructured":"N. Srebro , J. Rennie , and T. S. Jaakkola , \" Maximum-margin matrix factorization ,\" in NIPS , 2004 , pp. 1329 -- 1336 . N. Srebro, J. Rennie, and T. S. Jaakkola, \"Maximum-margin matrix factorization,\" in NIPS, 2004, pp. 1329--1336.","journal-title":"NIPS"},{"key":"e_1_3_2_2_10_1","first-page":"403","volume-title":"Kernelized probabilistic matrix factorization: Exploiting graphs and side information.\" in SDM","author":"Zhou T.","year":"2012","unstructured":"T. Zhou , H. Shan , A. Banerjee , and G. Sapiro , \" Kernelized probabilistic matrix factorization: Exploiting graphs and side information.\" in SDM , vol. 12 . SIAM , 2012 , pp. 403 -- 414 . T. Zhou, H. Shan, A. Banerjee, and G. Sapiro, \"Kernelized probabilistic matrix factorization: Exploiting graphs and side information.\" in SDM, vol. 12. SIAM, 2012, pp. 403--414."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020436"},{"key":"e_1_3_2_2_12_1","volume-title":"Bayesian matrix factorization with side information and dirichlet process mixtures.\" in AAAI","author":"Porteous I.","year":"2010","unstructured":"I. Porteous , A. U. Asuncion , and M. Welling , \" Bayesian matrix factorization with side information and dirichlet process mixtures.\" in AAAI , 2010 . I. Porteous, A. U. Asuncion, and M. Welling, \"Bayesian matrix factorization with side information and dirichlet process mixtures.\" in AAAI, 2010."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2039320.2039330"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1609\/aaai.v24i1.7578","article-title":"Transfer learning in collaborative filtering for sparsity reduction","volume":"10","author":"Pan W.","year":"2010","unstructured":"W. Pan , E. W. Xiang , N. N. Liu , and Q. Yang , \" Transfer learning in collaborative filtering for sparsity reduction .\" in AAAI , vol. 10 , 2010 , pp. 230 -- 235 . W. Pan, E. W. Xiang, N. N. Liu, and Q. Yang, \"Transfer learning in collaborative filtering for sparsity reduction.\" in AAAI, vol. 10, 2010, pp. 230--235.","journal-title":"AAAI"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577098"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"e_1_3_2_2_18_1","first-page":"757","article-title":"Transduction with matrix completion: Three birds with one stone","author":"Goldberg A.","year":"2010","unstructured":"A. Goldberg , B. Recht , J. Xu , R. Nowak , and X. Zhu , \" Transduction with matrix completion: Three birds with one stone ,\" in NIPS , 2010 , pp. 757 -- 765 . A. Goldberg, B. Recht, J. Xu, R. Nowak, and X. Zhu, \"Transduction with matrix completion: Three birds with one stone,\" in NIPS, 2010, pp. 757--765.","journal-title":"NIPS"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2638573"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2012.2197809"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/978-3-642-23783-6_28","volume-title":"Link prediction via matrix factorization,\" in Machine Learning and Knowledge Discovery in Databases","author":"Menon A. K.","year":"2011","unstructured":"A. K. Menon and C. Elkan , \" Link prediction via matrix factorization,\" in Machine Learning and Knowledge Discovery in Databases . Springer , 2011 , pp. 437 -- 452 . A. K. Menon and C. Elkan, \"Link prediction via matrix factorization,\" in Machine Learning and Knowledge Discovery in Databases. Springer, 2011, pp. 437--452."}],"event":{"name":"RecSys '15: Ninth ACM Conference on Recommender Systems","sponsor":["SIGCHI ACM Special Interest Group on Computer-Human Interaction","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval","SIGecom Special Interest Group on Economics and Computation"],"location":"Vienna Austria","acronym":"RecSys '15"},"container-title":["Proceedings of the 9th ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2792838.2800198","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2792838.2800198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:34Z","timestamp":1750223254000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2792838.2800198"}},"subtitle":["An Efficient Recommendation Algorithm by Leveraging Trust and Distrust Relations"],"short-title":[],"issued":{"date-parts":[[2015,9,16]]},"references-count":21,"alternative-id":["10.1145\/2792838.2800198","10.1145\/2792838"],"URL":"https:\/\/doi.org\/10.1145\/2792838.2800198","relation":{},"subject":[],"published":{"date-parts":[[2015,9,16]]},"assertion":[{"value":"2015-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}