Re-ranking in user-driven reputation systems with splay tree
by R. Jayashree; A. Christy
International Journal of Materials and Product Technology (IJMPT), Vol. 56, No. 1/2, 2018

Abstract: In e-learning environments, trust relationship plays a vital role in establishing collaborative activities among co-learners. Reputation is a fundamental source for measuring co-learners' trust. An efficient and effective way to construct trust relationship among faculties and students in e-learning environment is ranking. User-driven reputation systems are based only on the feedback or ratings provided by the users. Users with higher points obtain high rating compared to less scored users. Thus, by Zipf's law, alleged low users are pushed to the bottom of the ranking list. This condition is avoided by encouraging less likely users and preventing them from moving further down in ranking level. Low ranked users are provided with few more chances to participate actively in the e-learning environment. A splay tree is a binary search tree with self-balancing skill. The splay tree brings the recently accessed item to the top of the tree. A splay tree is used to represent user's ranks, and low ranked users are semi-splayed again in the tree thus preventing them from further drowning in the ranking list for the fixed number of times. In this paper, we presented Rank_Improvement algorithm to enhance average scored users and compared with the ranking algorithm in the existing question-answering websites.

Online publication date: Sun, 07-Jan-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Materials and Product Technology (IJMPT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com