Research Repository

Extracting reputation with knock-out tournament-based pairwise elicitation in complex social networks

Centeno, R and Hermoso, R and Fasli, M (2013) Extracting reputation with knock-out tournament-based pairwise elicitation in complex social networks. In: UNSPECIFIED, ? - ?.

Full text not available from this repository.

Abstract

Complex social networks are typically used in order to represent and structure social relationships that do not follow a predictable pattern of behaviour. Due to their openness and dynamics, participants in these networks have to constantly deal with uncertainty prior to commencing in any type of interaction. Reputation appears as a key concept helping users to mitigate such uncertainty. However, most of the reputation mechanisms proposed in the literature suffer from problems such as the subjectivity in the opinions and their inaccurate aggregation. With these problems in mind, this paper presents a decentralized reputation mechanism based on the concepts of pairwise elicitation processes and knock-out tournaments. The main objective of this mechanism is to build reputation rankings from qualitative opinions, so getting rid of the subjectivity problems associated with the aggregation of quantitative opinions. The proposed approach is evaluated in a real environment by using a dataset extracted from MovieLens. © 2013 Springer-Verlag.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: Published proceedings: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Jim Jamieson
Date Deposited: 18 Oct 2013 10:36
Last Modified: 17 Aug 2017 17:55
URI: http://repository.essex.ac.uk/id/eprint/8182

Actions (login required)

View Item View Item