By Topic

Improving diversity in Web search results re-ranking using absorbing random walks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Gu-Li Lin ; Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China ; Hong Peng ; Qian-Li Ma ; Jia Wei
more authors

Search result diversification has become important for improving Web search effectiveness and user satisfaction, as redundancy in top ranking results often disappoints users. To solve this problem, many techniques have been proposed to make a tradeoff between the relevance and diversity. Among them, GRASSHOPPER which utilizes the framework of absorbing random walks has shown good performance. In this paper, we propose a novel algorithm named DATAR with a new ranking strategy, which improves the diversification ability of GRASSHOPPER. Also, we make a discussion on the reason why DATAR is better. We evaluated the proposed algorithm with a public dataset ODP239 and a real search result dataset collected from Google. The experiment results show that the proposed DATAR algorithm outperforms GRASSHOPPER in improving diversity in Web search results re-ranking.

Published in:

Machine Learning and Cybernetics (ICMLC), 2010 International Conference on  (Volume:5 )

Date of Conference:

11-14 July 2010