{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T05:05:14Z","timestamp":1748063114924,"version":"3.37.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030050627"},{"type":"electronic","value":"9783030050634"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05063-4_37","type":"book-chapter","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T00:23:45Z","timestamp":1544142225000},"page":"495-510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Roundtable Gossip Algorithm: A Novel Sparse Trust Mining Method for Large-Scale Recommendation Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2437-5160","authenticated-orcid":false,"given":"Mengdi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangquan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9248-4158","authenticated-orcid":false,"given":"Rajan","family":"Shankaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2572-2355","authenticated-orcid":false,"given":"Xi","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zonghua","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"37_CR1","unstructured":"Taobao index. https:\/\/shu.taobao.com\/industry . Accessed 14 Apr 2017"},{"issue":"8","key":"37_CR2","doi-asserted-by":"publisher","first-page":"2221","DOI":"10.1007\/s11276-010-0255-1","volume":"16","author":"Z Zhang","year":"2010","unstructured":"Zhang, Z.: RADAR: a reputation-driven anomaly detection system for wireless mesh networks. Wirel. Netw. 16(8), 2221\u20132236 (2010)","journal-title":"Wirel. Netw."},{"issue":"5","key":"37_CR3","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1109\/TIFS.2016.2516912","volume":"11","author":"R Saini","year":"2016","unstructured":"Saini, R.: Jammer-assisted resource allocation in secure OFDMA with untrusted users. IEEE Trans. Inf. Forensics Secur. 11(5), 1055\u20131070 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"2","key":"37_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/TIFS.2016.2621999","volume":"12","author":"X Guo","year":"2017","unstructured":"Guo, X.: Eliminating the hardware-software boundary: a proof-carrying approach for trust evaluation on computer systems. IEEE Trans. Inf. Forensics Secur. 12(2), 405\u2013417 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"3","key":"37_CR5","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.elerap.2008.03.001","volume":"7","author":"J Zhang","year":"2008","unstructured":"Zhang, J.: Evaluating the trustworthiness of advice about seller agents in e-marketplaces: a personalized approach. Electron. Commer. Res. Appl. 7(3), 330\u2013340 (2008)","journal-title":"Electron. Commer. Res. Appl."},{"issue":"4","key":"37_CR6","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/TDSC.2015.2410792","volume":"13","author":"Z Yang","year":"2016","unstructured":"Yang, Z.: VoteTrust: leveraging friend invitation graph to defend against social network sybils. IEEE Trans. Dependable Secure Comput. 13(4), 488\u2013501 (2016)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"9","key":"37_CR7","doi-asserted-by":"publisher","first-page":"2013","DOI":"10.1109\/TIFS.2016.2570740","volume":"11","author":"Y Liu","year":"2016","unstructured":"Liu, Y.: ActiveTrust: secure and trustable routing in wireless sensor networks. IEEE Trans. Inf. Forensics Secur. 11(9), 2013\u20132027 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"1","key":"37_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.2753\/JEC1086-4415120104","volume":"12","author":"G Xu","year":"2007","unstructured":"Xu, G.: Swift trust in a virtual temporary system: a model based on the Dempster-Shafer theory of belief functions. Int. J. Electron. Commer. 12(1), 93\u2013126 (2007)","journal-title":"Int. J. Electron. Commer."},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Gao, P.: STAR: semiring trust inference for trust-aware social recommenders. In: Proceedings of the 10th ACM Conference on Recommender Systems, Boston, Massachusetts, pp. 301\u2013308 (2016)","DOI":"10.1145\/2959100.2959148"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Guo, G.: From ratings to trust: an empirical study of implicit trust in recommender systems. In: Proceedings of the 29th Annual ACM Symposium on Applied Computing, Gyeongju, Republic of Korea, pp. 248\u2013253 (2014)","DOI":"10.1145\/2554850.2554878"},{"key":"37_CR11","unstructured":"Xu, G.: TRM: computing reputation score by mining reviews. In: AAAI Workshop: Incentives and Trust in Electronic Communities, Phoenix, Arizona (2016)"},{"issue":"1","key":"37_CR12","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/TIFS.2014.2364679","volume":"10","author":"C Zhu","year":"2015","unstructured":"Zhu, C.: An authenticated trust and reputation calculation and management system for cloud and sensor networks integration. IEEE Trans. Inf. Forensics Secur. 10(1), 118\u2013131 (2015)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"3","key":"37_CR13","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/TIFS.2015.2389145","volume":"10","author":"P Zhou","year":"2015","unstructured":"Zhou, P.: Toward energy-efficient trust system through watchdog optimization for WSNs. IEEE Trans. Inf. Forensics Secur. 10(3), 613\u2013625 (2015)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"7","key":"37_CR14","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1109\/TKDE.2016.2528249","volume":"28","author":"G Guo","year":"2016","unstructured":"Guo, G.: A novel recommendation model regularized with user trust and item ratings. IEEE Trans. Knowl. Data Eng. 28(7), 1607\u20131620 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"37_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2815595","volume":"48","author":"JH Cho","year":"2015","unstructured":"Cho, J.H.: A survey on trust modeling. ACM Comput. Surv. 48(2), 1\u201340 (2015)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"37_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2906151","volume":"49","author":"W Jiang","year":"2016","unstructured":"Jiang, W.: Understanding graph-based trust evaluation in online social networks: methodologies and challenges. ACM Comput. Surv. 49(1), 1\u201335 (2016)","journal-title":"ACM Comput. Surv."},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Guo, G.: TrustSVD: collaborative filtering with both the explicit and implicit influence of user trust and of item ratings. In: Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, Texas, pp. 123\u2013129 (2015)","DOI":"10.1609\/aaai.v29i1.9153"},{"issue":"4","key":"37_CR18","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1109\/TDSC.2014.2355824","volume":"12","author":"L Guo","year":"2015","unstructured":"Guo, L.: A trust-based privacy-preserving friend recommendation scheme for online social networks. IEEE Trans. Dependable Secure Comput. 12(4), 413\u2013427 (2015)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"1","key":"37_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TDSC.2014.2309126","volume":"12","author":"Y Zhong","year":"2015","unstructured":"Zhong, Y.: A computational dynamic trust model for user authorization. IEEE Trans. Dependable Secure Comput. 12(1), 1\u201315 (2015)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"Yao, W.: Modeling dual role preferences for trust-aware recommendation. In: Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, Gold Coast, Queensland, pp. 975\u2013978 (2014)","DOI":"10.1145\/2600428.2609488"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Konstas, I.: On social networks and collaborative recommendation. In: Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Boston, MA, pp. 195\u2013202 (2009)","DOI":"10.1145\/1571941.1571977"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Chen, W.: Collaborative filtering for Orkut communities: discovery of user latent behavior. In: Proceedings of the 18th International Conference on World Wide Web, Madrid, Spain, pp. 681\u2013690 (2009)","DOI":"10.1145\/1526709.1526801"},{"issue":"2","key":"37_CR23","first-page":"58","volume":"47","author":"J Lansing","year":"2016","unstructured":"Lansing, J.: Trust in cloud computing: conceptual typology and trust-building antecedents. database: the DATABASE for advances. Inf. Syst. 47(2), 58\u201396 (2016)","journal-title":"Inf. Syst."},{"issue":"2","key":"37_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/TETC.2013.2283233","volume":"2","author":"D Zhang","year":"2017","unstructured":"Zhang, D.: Cold-start recommendation using bi-clustering and fusion for large-scale social recommender systems. IEEE Trans. Emerg. Top. Comput. 2(2), 239\u2013250 (2017)","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"37_CR25","doi-asserted-by":"crossref","unstructured":"Kamvae, S.D.: The Eigentrust algorithm for reputation management in P2P networks. In: Proceedings of the 12th International Conference on World Wide Web, Budapest, Hungary, pp. 640\u2013651 (2003)","DOI":"10.1145\/775240.775242"},{"key":"37_CR26","unstructured":"Roundtable Algorithm. http:\/\/www.top-news.top\/news-12840672.html . Accessed 12 Apr 2017"},{"key":"37_CR27","volume-title":"A Programmer\u2019s Guide to Data Mining: The Ancient Art of the Numerati","author":"Z Ron","year":"2015","unstructured":"Ron, Z.: A Programmer\u2019s Guide to Data Mining: The Ancient Art of the Numerati, 1st edn. The People\u2019s Posts and Telecommunications Press, Beijing (2015)","edition":"1"},{"key":"37_CR28","doi-asserted-by":"crossref","unstructured":"Ling, G.: Ratings meet reviews, a combined approach to recommend. In: Proceedings of the 8th ACM Conference on Recommender Systems, pp. 105\u2013112. ACM, Foster City (2014)","DOI":"10.1145\/2645710.2645728"},{"key":"37_CR29","doi-asserted-by":"crossref","unstructured":"Zhao, D.: A distributed and adaptive trust evaluation algorithm for MANET. In: Proceedings of the 12th ACM Symposium on QoS and Security for Wireless and Mobile Networks, pp. 47\u201354. ACM, New York (2016)","DOI":"10.1145\/2988272.2990297"},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"Massa, P.: Trust-aware recommender systems. In: Proceedings of the 2007 ACM Conference on Recommender Systems, pp. 17\u201324. ACM, Malta (2007)","DOI":"10.1145\/1297231.1297235"},{"key":"37_CR31","doi-asserted-by":"crossref","unstructured":"Guo, G.: ETAF: an extended trust antecedents framework for trust prediction. In: Proceedings of the 2014 International Conference on Advances in Social Networks Analysis and Mining (ASONAM), China, pp. 540\u2013547 (2014)","DOI":"10.1109\/ASONAM.2014.6921639"},{"key":"37_CR32","doi-asserted-by":"crossref","unstructured":"Ma, H.: Recommender systems with social regularization. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, pp. 287\u2013296. ACM, Hong Kong (2011)","DOI":"10.1145\/1935826.1935877"},{"key":"37_CR33","doi-asserted-by":"crossref","unstructured":"Ma, H.: Learning to recommend with social trust ensemble. In: Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Boston, MA, USA, pp. 203\u2013210 (2009)","DOI":"10.1145\/1571941.1571978"},{"key":"37_CR34","doi-asserted-by":"crossref","unstructured":"Guha, R.: Propagation of trust and distrust. In: Proceedings of the 13th International Conference on World Wide Web, pp. 403\u2013412. ACM, New York (2004)","DOI":"10.1145\/988672.988727"},{"key":"37_CR35","volume-title":"Computing and Applying Trust in Web-Based Social Networks","author":"JA Golbeck","year":"2005","unstructured":"Golbeck, J.A.: Computing and Applying Trust in Web-Based Social Networks. University of Maryland, College Park (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05063-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T20:26:31Z","timestamp":1662582391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05063-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050627","9783030050634"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05063-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}