A3CRank: An adaptive ranking method based on connectivity, content and click-through data

  • Authors:

  • Ali Mohammad Zareh Bidoki;Pedram Ghodsnia;Nasser Yazdani;Farhad Oroumchian

  • Affiliations:

  • Department of Electrical & Computer Engineering, Yazd University, Yazd, Iran;David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;ECE Department, University of Tehran, Tehran, Iran;Faculty of Computer Science and Engineering, University of Wollongong in Dubai, Dubai, United Arab Emirates

  • Venue:
  • Information Processing and Management: an International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Due to the proliferation and abundance of information on the web, ranking algorithms play an important role in web search. Currently, there are some ranking algorithms based on content and connectivity such as BM25 and PageRank. Unfortunately, these algorithms have low precision and are not always satisfying for users. In this paper, we propose an adaptive method, called A3CRank, based on the content, connectivity, and click-through data triple. Our method tries to aggregate ranking algorithms such as BM25, PageRank, and TF-IDF. We have used reinforcement learning to incorporate user behavior and find a measure of user satisfaction for each ranking algorithm. Furthermore, OWA, an aggregation operator is used for merging the results of the various ranking algorithms. A3CRank adapts itself with user needs and makes use of user clicks to aggregate the results of ranking algorithms. A3CRank is designed to overcome some of the shortcomings of existing ranking algorithms by combining them together and producing an overall better ranking criterion. Experimental results indicate that A3CRank outperforms other combinational ranking algorithms such as Ranking SVM in terms of P@n and NDCG metrics. We have used 130 queries on University of California at Berkeley's web to train and evaluate our method.