TY  - CHAP
N2  - In the Internet era the information overload and the challenge to detect quality content has raised the issue of how to rank both resources and users in online communities. In this paper we develop a general ranking method that can simultaneously evaluate users? reputation and objects? quality in an iterative procedure, and that exploits the trust relationships and social acquaintances of users as an additional source of information. We test our method on two real online communities, the EconoPhysics forum and the Last.fm music catalogue, and determine how different variants of the algorithm influence the resultant ranking. We show the benefits of considering trust relationships, and define the form of the algorithm better apt to common situations.
TI  - Measuring Quality, Reputation and Trust in Online Communities
A1  - Liao, Hao
A1  - Cimini, Giulio
A1  - Medo, Matú?
T3  - Lecture Notes in Computer Science
Y1  - 2012///
SN  - 978-3-642-34624-8
AV  - none
T2  - Foundations of Intelligent Systems. 20th International Symposium, ISMIS 2012, Macau, China, December 4-7, 2012. Proceedings
SP  - 405
KW  - Complex networks
KW  -  Ranking algorithm
KW  -  Reputation
KW  -  Trust
UR  - http://dx.doi.org/10.1007/978-3-642-34624-8_46
PB  - Springer
EP  - 414
ID  - eprints2845
ER  -