全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
PLOS ONE  2014 

Ranking Reputation and Quality in Online Rating Systems

DOI: 10.1371/journal.pone.0097146

Full-Text   Cite this paper   Add to My Lib

Abstract:

How to design an accurate and robust ranking algorithm is a fundamental problem with wide applications in many real systems. It is especially significant in online rating systems due to the existence of some spammers. In the literature, many well-performed iterative ranking methods have been proposed. These methods can effectively recognize the unreliable users and reduce their weight in judging the quality of objects, and finally lead to a more accurate evaluation of the online products. In this paper, we design an iterative ranking method with high performance in both accuracy and robustness. More specifically, a reputation redistribution process is introduced to enhance the influence of highly reputed users and two penalty factors enable the algorithm resistance to malicious behaviors. Validation of our method is performed in both artificial and real user-object bipartite networks.

References

[1]  Watts DJ, Strogatz SH (19998) Collective dynamics of ‘small-world’ networks. Nature 393: 440–442.
[2]  Albert R, Barabasi AL (2002) Statistical mechanics of complex networks. Rev. Mod.Phys 74: 47–97. doi: 10.1103/revmodphys.74.47
[3]  Guttman RH, Moukas AG, Maes P (2001) Agent-mediated electronic commerce: A survey. The Knowledge Engineering Review 13: 147–159. doi: 10.1017/s0269888998002082
[4]  Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J. ACM 46: 604–632. doi: 10.1145/324133.324140
[5]  Lü L, Medo M, Yeung CH, Zhang YC, Zhang ZK, et al. (2012) Recommender systems. Physics Report 519: 1–49. doi: 10.1016/j.physrep.2012.02.006
[6]  Dellarocas C (2000) Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior. In:Proceedings of IEEE 2nd ACM conference on Electronic commerce. ACM Press, pp. 150–157
[7]  Goldberg D, Nichols D, Oki BM, Terry D (1992) Using collaborative filtering to weave an information tapestry. Communications of the ACM 35: 61–70. doi: 10.1145/138859.138867
[8]  Pan WK, Xiang EW, Yang Q (2013) Transfer learning in collaborative filtering with uncertain ratings. In: Proceedings of the Twenty-sixth AAAI Conference on Artificial Intelligence (AAAI). The AAAI Press, pp.39–55.
[9]  Wang G, Xie S, Liu B, Yu PS (2011) Review graph based online store review spammer detection. In: Proceedings of IEEE 11th International Conference on data mining. IEEE Press., pp. 1242–1247
[10]  Benevenuto F, Rodrigues T, Almeida V, Almeida J, Gonalves M (2009) Detecting spammers and content promoters in online video social networks.In: Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval. ACM press, pp.620–627.
[11]  Masum H, Zhang YC (2004) Manifesto for the reputation society. First Monday 9: 7. doi: 10.5210/fm.v9i7.1158
[12]  Herlocker JK, Konstan JA, Terverrn LG, Riedl JT (2004) Evaluating collaborative filtering recommender systems. . ACM Trans. Inf.Syst 22: 5–53. doi: 10.1145/963770.963772
[13]  Resnick P, Kuwabara K, Zeckhauser R, Friedman E (2000) Reputation systems. Communications of the ACM 43: 45–48. doi: 10.1145/355112.355122
[14]  Jsang A, Ismail R, Boyd C (2007) A survey of trust and reputation systems for online service provision. Decision support systems 43: 618–644. doi: 10.1016/j.dss.2005.05.019
[15]  Liao H, Cimini G, Medo M (2012) Measuring quality, reputation and trust in online communities. In: Proceedings of the 20th International Symposium on methodologies for intelligent systems (ISMIS). Springer Lecture Notes in Artificial Intelligence, pp. 405–414
[16]  Liao H, Xiao R, Cimini G, Medo M (2013) Ranking users, papers and authors in online scientific communities. arXiv: 1311.3064.
[17]  Tacchella A, Cristelli M, Caldarelli G, Gabrielli A, Pietronero L (2012) A New Metrics for Countries' Fitness and Products' Complexity. Scientific Report 2: 723. doi: 10.1038/srep00723
[18]  Zhou YB, Lü L, Li MH (2012) Quantifying the influence of scientists and their publications: distinguishing between prestige and popularity. New Journal of Physics 14: 033033. doi: 10.1088/1367-2630/14/3/033033
[19]  Laureti P, Moret L, Zhang YC, Yu YK (2006) Information filtering via Iterative Refinement. Europhysics Letter 75: 1006. doi: 10.1209/epl/i2006-10204-8
[20]  Yu YK, Zhang YC, Laureti P, Moret L (2006) Decoding information from noisy, redundant, and intentionally distorted sources. Physica A 371: 732–744. doi: 10.1016/j.physa.2006.04.057
[21]  Zhou YB, Lei T, Zhou T (2011) A robust ranking algorithm to spamming. Europhysics Letter 94: 48002. doi: 10.1209/0295-5075/94/48002
[22]  Lin LI (1989) A concordance correlation coefficient to evaluate reproducibility. Biometrika 45: 255–268. doi: 10.2307/2532051
[23]  Altman NS (1992) An introduction to kernel and nearest-neighbor nonparametric regression. The American Statistician 46: 175. doi: 10.1080/00031305.1992.10475879
[24]  Nagelkerke NJD (1991) A note on a general definition of the coefficient of determination. Biometrika 78: 691–692. doi: 10.1093/biomet/78.3.691
[25]  Lim EP, Nguyen VA, Jindal N, Liu B, Lauw HW (2010) Detecting product review spammers using rating behaviors. In:Proceedings of the 19th ACM international conference on Information and knowledge management. ACM Press, pp.939–948.
[26]  Lee K, Caverlee J, Webb S (2010) Uncovering social spammers: social honeypots + machine learning. In:Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval. ACM Press , pp.435–442.
[27]  Grier C, Thomas K, Paxson V, Zhang M (2010) spam: the underground on 140 characters or less. In:Proceedings of the 17th ACM conference on computer and communications security. ACM Press, pp.27–37.
[28]  Zeng A, Yeung CH, Shang MS, Zhang YC (2012) The reinforcing influence of recommendations on global diversification. Europhysics Letter 97: 18005. doi: 10.1209/0295-5075/97/18005
[29]  Shang MS, Lü L, Zhang YC, Zhou T (2010) Empirical analysis of web-based user-object bipartite networks. Europhysics Letter 90: 48006. doi: 10.1209/0295-5075/90/48006
[30]  Barabasi AL, Albert R (1999) Emergence of Scaling in Random Networks. Science 286: 509–512. doi: 10.1126/science.286.5439.509
[31]  Zeng A, Cimini G (2012) Removing spurious interactions in complex networks. Phys. Rev.E 85: 036101. doi: 10.1103/physreve.85.036101
[32]  Zhang QM, Zeng A, Shang MS (2013) Extracting the information backbone in online system. PloS one 8(5): e62624. doi: 10.1371/journal.pone.0062624
[33]  Kendall M (1938) A new measure of rank correlation. Biometrika 30: 81–93. doi: 10.1093/biomet/30.1-2.81
[34]  Hanley JA, Mcneil BJ (1982) The meaning and use of the area under a receiver operating characteristic (ROC) curve. Radiology 143: 29–36.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133