{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T01:24:02Z","timestamp":1770513842389,"version":"3.49.0"},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,2,25]],"date-time":"2017-02-25T00:00:00Z","timestamp":1487980800000},"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":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2017,2,28]]},"abstract":"<jats:p>\n            In collaborative Web-based platforms, user reputation scores are generally computed according to two orthogonal perspectives:\n            <jats:italic>(a) helpfulness-based reputation (HBR)<\/jats:italic>\n            scores and\n            <jats:italic>(b) centrality-based reputation (CBR)<\/jats:italic>\n            scores. In HBR approaches, the most reputable users are those who post the most helpful reviews according to the opinion of the members of their community. In CBR approaches, a \u201cwho-trusts-whom\u201d network\u2014known as a\n            <jats:italic>trust network<\/jats:italic>\n            \u2014is available and the most reputable users occupy the most central position in the trust network, according to some definition of centrality. The identification of users featuring large HBR scores is one of the most important research issue in the field of Social Networks, and it is a critical success factor of many Web-based platforms like e-marketplaces, product review Web sites, and question-and-answering systems. Unfortunately, user reviews\/ratings are often sparse, and this makes the calculation of HBR scores inaccurate. In contrast, CBR scores are relatively easy to calculate provided that the topology of the trust network is known. In this article, we investigate if CBR scores are effective to predict HBR ones, and, to perform our study, we used real-life datasets extracted from CIAO and Epinions (two product review Web sites) and Wikipedia and applied five popular centrality measures\u2014Degree Centrality, Closeness Centrality, Betweenness Centrality, PageRank and Eigenvector Centrality\u2014to calculate CBR scores. Our analysis provides a positive answer to our research question: CBR scores allow for predicting HBR ones and Eigenvector Centrality was found to be the most important predictor. Our findings prove that we can leverage trust relationships to spot those users producing the most helpful reviews for the whole community.\n          <\/jats:p>","DOI":"10.1145\/2981545","type":"journal-article","created":{"date-parts":[[2017,2,27]],"date-time":"2017-02-27T13:06:52Z","timestamp":1488200812000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Using Centrality Measures to Predict Helpfulness-Based Reputation in Trust Networks"],"prefix":"10.1145","volume":"17","author":[{"given":"Pasquale De","family":"Meo","sequence":"first","affiliation":[{"name":"University of Messina, Messina (ME)"}]},{"given":"Katarzyna","family":"Musial-Gabrys","sequence":"additional","affiliation":[{"name":"Bournemouth University, Fern Barrow, Poole"}]},{"given":"Domenico","family":"Rosaci","sequence":"additional","affiliation":[{"name":"University of Reggio Calabria, Italy"}]},{"given":"Giuseppe M. L.","family":"Sarn\u00e8","sequence":"additional","affiliation":[{"name":"University of Reggio Calabria, Italy"}]},{"given":"Lora","family":"Aroyo","sequence":"additional","affiliation":[{"name":"VU Amsterdam, Amsterdam, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2017,2,25]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0085777"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935914"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187907"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.17730\/humo.7.3.f4033344851gl053"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"A. Berman and R. Plemmons. 1994. Nonnegative Matrices in the Mathematical Sciences. SIAM.  A. Berman and R. Plemmons. 1994. Nonnegative Matrices in the Mathematical Sciences. SIAM.","DOI":"10.1137\/1.9781611971262"},{"key":"e_1_2_1_6_1","volume-title":"Pattern Recognition and Machine Learning","author":"Bishop C.","unstructured":"C. Bishop . 2006. Pattern Recognition and Machine Learning . Springer . C. Bishop. 2006. Pattern Recognition and Machine Learning. Springer."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(01)00038-7"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961194"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4159\/9780674029095"},{"key":"e_1_2_1_11_1","volume-title":"Distance: Research in Technologically Supported Work","author":"Butler B.","year":"2007","unstructured":"B. Butler , L. Sproull , S. Kiesler , and R. Kraut . 2007 . Community effort in online groups: Who does the work and why. In Leadership at a Distance: Research in Technologically Supported Work , S. Weisband and L. Atwater (Eds.). Lawrence Erlbaum , 171--194. B. Butler, L. Sproull, S. Kiesler, and R. Kraut. 2007. Community effort in online groups: Who does the work and why. In Leadership at a Distance: Research in Technologically Supported Work, S. Weisband and L. Atwater (Eds.). Lawrence Erlbaum, 171--194."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2753\/JEC1086-4415140105"},{"key":"e_1_2_1_13_1","volume-title":"Proc. of the International Workshop on Trust, Security, and Reputation on the Semantic Web. Springer.","author":"Chirita P.","unstructured":"P. Chirita , W. Nejdl , M. Schlosser , and O. Scurtu . 2004. Personalized reputation management in P2P networks . In Proc. of the International Workshop on Trust, Security, and Reputation on the Semantic Web. Springer. P. Chirita, W. Nejdl, M. Schlosser, and O. Scurtu. 2004. Personalized reputation management in P2P networks. In Proc. of the International Workshop on Trust, Security, and Reputation on the Semantic Web. Springer."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/070710111"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1177\/0268580905055480"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.03.012"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2323892"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.12.001"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1365-2656.2008.01390.x"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772752"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_2_1_22_1","unstructured":"J. H. Friedman. 2001. Greedy function approximation: A gradient boosting machine. Ann. Stat. (2001) 1189--1232.  J. H. Friedman. 2001. Greedy function approximation: A gradient boosting machine. Ann. Stat. (2001) 1189--1232."},{"key":"e_1_2_1_23_1","volume-title":"Proc. of the 1st International Conference on Reputation: Theory and Technology. Springer, 62--74","author":"Garcin F.","unstructured":"F. Garcin , B. Faltings , and R. Jurca . 2009. Aggregating reputation feedback . In Proc. of the 1st International Conference on Reputation: Theory and Technology. Springer, 62--74 . F. Garcin, B. Faltings, and R. Jurca. 2009. Aggregating reputation feedback. In Proc. of the 1st International Conference on Reputation: Theory and Technology. Springer, 62--74."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11755593_8"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183463.1183470"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594455"},{"key":"e_1_2_1_27_1","unstructured":"P. Good. 2006. Permutation Parametric and Bootstrap Tests of Hypotheses. Springer Science 8 Business Media.   P. Good. 2006. Permutation Parametric and Bootstrap Tests of Hypotheses. Springer Science 8 Business Media."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.08.004"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988811"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2005.05.019"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775242"},{"key":"e_1_2_1_32_1","volume-title":"Proc. of the International Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 423--430","author":"Kim S.","unstructured":"S. Kim , P. Pantel , T. Chklovski , and M. Pennacchiotti . 2006. Automatically assessing review helpfulness . In Proc. of the International Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 423--430 . S. Kim, P. Pantel, T. Chklovski, and M. Pennacchiotti. 2006. Automatically assessing review helpfulness. In Proc. of the International Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 423--430."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1035134.1035162"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772756"},{"key":"e_1_2_1_35_1","volume-title":"Computing with Social Trust","author":"Levien R.","unstructured":"R. Levien . 2009. Attack-resistant trust metrics . In Computing with Social Trust . Springer , 121--132. R. Levien. 2009. Attack-resistant trust metrics. In Computing with Social Trust. Springer, 121--132."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.94"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772761"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571978"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1509\/jmkg.66.1.38.18451"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-6451.00180"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-011-0155-z"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081922"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639774"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/544741.544853"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","first-page":"P05030","DOI":"10.1088\/1742-5468\/2015\/05\/P05030","article-title":"Analyzing complex networks through correlations in centrality measurements","volume":"2015","author":"Ronqui J.","year":"2015","unstructured":"J. Ronqui and G. Travieso . 2015 . Analyzing complex networks through correlations in centrality measurements . J. Stat. Mech.: Theory Exper. 2015 , 5 (2015), P05030 . J. Ronqui and G. Travieso. 2015. Analyzing complex networks through correlations in centrality measurements. J. Stat. Mech.: Theory Exper. 2015, 5 (2015), P05030.","journal-title":"J. Stat. Mech.: Theory Exper."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2543711"},{"key":"e_1_2_1_50_1","volume-title":"Proc. of the International Joint Conference on Artificial Intelligence (IJCAI","author":"Tang J.","year":"2013","unstructured":"J. Tang , X. Hu , H. Gao , and H. Liu . 2013. Exploiting local and global social context for recommendation . In Proc. of the International Joint Conference on Artificial Intelligence (IJCAI 2013 ), 2712--2718. J. Tang, X. Hu, H. Gao, and H. Liu. 2013. Exploiting local and global social context for recommendation. In Proc. of the International Joint Conference on Artificial Intelligence (IJCAI 2013), 2712--2718."},{"key":"e_1_2_1_51_1","doi-asserted-by":"crossref","unstructured":"S. Wasserman and K. Faust. 1994. Social Network Analysis: Methods and Applications. Cambridge University Press New York NY.  S. Wasserman and K. Faust. 1994. Social Network Analysis: Methods and Applications. Cambridge University Press New York NY.","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718520"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2631775.2631809"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772879"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629530"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183626"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772796"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2981545","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2981545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:29Z","timestamp":1750273649000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2981545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,25]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2,28]]}},"alternative-id":["10.1145\/2981545"],"URL":"https:\/\/doi.org\/10.1145\/2981545","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,25]]},"assertion":[{"value":"2015-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-02-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}