2014
DOI: 10.1371/journal.pone.0097146
|View full text |Cite
|
Sign up to set email alerts
|

Ranking Reputation and Quality in Online Rating Systems

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 des… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
44
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 53 publications
(45 citation statements)
references
References 35 publications
1
44
0
Order By: Relevance
“…In this paper, we set = 3 which is suggested by the proposers [17]. At the same time, Liao et al also presented another similar algorithm, called IARR2, by introducing a penalty factor to IARR.…”
Section: Iterative Ranking Frameworkmentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper, we set = 3 which is suggested by the proposers [17]. At the same time, Liao et al also presented another similar algorithm, called IARR2, by introducing a penalty factor to IARR.…”
Section: Iterative Ranking Frameworkmentioning
confidence: 99%
“…In the ideal case, = 1 indicates that the two ranking lists are exactly the same. Figure 3 shows the MSE value for IB method with different ; see (17). We also present other representative algorithms for comparisons.…”
Section: Evaluation Metricsmentioning
confidence: 99%
“…The main task of recommender system is to predict future links of each target user based on historical rating records [31,32,[35][36][37], in which the whole data set is divided into a training set and a test set and only the links in training set is known before recommendation. However, in most of the previous studies, as far as we know, the test data set is sampled randomly without consider the temporal order of the links, leading to a logical disorder in the recommendation process, i.e., predicting the past links in test set on the basis of the future links in training set.…”
Section: Related Workmentioning
confidence: 99%
“…Zhou et al [6] developed a correlation based ranking algorithm (short for CR), where the user's reputation is determined by the Pearson correlation coefficient between his/her rating vector and the corresponding objects' calculated quality vector. Liao et al [16] designed an iterative algorithm with reputation redistribution (short for IARR), presenting the reputation redistribution process to eliminate noisy information in the iterations. Meanwhile, the IARR method was modified by introducing two penalty factors (small-degree users or objects cannot have very high reputation or quality), namely IARR2 method [16], leading the objects rated by only low reputation users with less quality and the users who only rate a small number of objects with lower reputation.…”
Section: Introductionmentioning
confidence: 99%
“…Liao et al [16] designed an iterative algorithm with reputation redistribution (short for IARR), presenting the reputation redistribution process to eliminate noisy information in the iterations. Meanwhile, the IARR method was modified by introducing two penalty factors (small-degree users or objects cannot have very high reputation or quality), namely IARR2 method [16], leading the objects rated by only low reputation users with less quality and the users who only rate a small number of objects with lower reputation. In empirical rating systems, users with different degrees are evolved by different mechanisms [17][18][19].…”
Section: Introductionmentioning
confidence: 99%