Personalised recommendation system for ranking in question-answering websites with splay tree by avoiding tumbleweed badge
by R. Jayashree; A. Christy; S. Venkatesh
International Journal of Trust Management in Computing and Communications (IJTMCC), Vol. 4, No. 2, 2018

Abstract: An efficient and effective way to construct trust relationship among peer users in electronic learning environment is ranking. User-driven ranking systems are based only on the feedback or ratings provided by the users. Users with higher points obtain high reputation compared to less scored users. In popular question-answering websites, like stack exchange network sites, users with unanswered or ignored questions for a long time get a tumbleweed badge without considering their past history. The question-answering website community considers this award as a consolation prize and discourages the awardees instead of encouraging them. Most of the people who ask Tumbleweed questions are new or low-reputation users. The focus of this research work is to design a recommendation system that prevent tumbleweed questions from the users who are about to receive a tumbleweed badge. A splay tree is a binary search tree with a self-balancing skill which brings the recently accessed item to the top of the tree. In this paper, the splay tree represents users' ranks with methods to avoid tumbleweed badge. The spotlight of the work is to bring up average or below average scorer to top without affecting existing topers.

Online publication date: Fri, 12-Oct-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 Trust Management in Computing and Communications (IJTMCC):
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