ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Diversity in ranking via resistive graph centers

Dubey, Avinava and Chakrabarti, Soumen and Bhattacharyya, Chiranjib (2011) Diversity in ranking via resistive graph centers. In: KDD '11 Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, 2011, New York, NY, USA.

[img] PDF
acm_sigkdd_int_con_kno_dis_dat_min_78_2011.pdf - Published Version
Restricted to Registered users only

Download (741kB) | Request a copy
Official URL: http://dx.doi.org/10.1145/2020408.2020428

Abstract

Users can rarely reveal their information need in full detail to a search engine within 1--2 words, so search engines need to "hedge their bets" and present diverse results within the precious 10 response slots. Diversity in ranking is of much recent interest. Most existing solutions estimate the marginal utility of an item given a set of items already in the response, and then use variants of greedy set cover. Others design graphs with the items as nodes and choose diverse items based on visit rates (PageRank). Here we introduce a radically new and natural formulation of diversity as finding centers in resistive graphs. Unlike in PageRank, we do not specify the edge resistances (equivalently, conductances) and ask for node visit rates. Instead, we look for a sparse set of center nodes so that the effective conductance from the center to the rest of the graph has maximum entropy. We give a cogent semantic justification for turning PageRank thus on its head. In marked deviation from prior work, our edge resistances are learnt from training data. Inference and learning are NP-hard, but we give practical solutions. In extensive experiments with subtopic retrieval, social network search, and document summarization, our approach convincingly surpasses recently-published diversity algorithms like subtopic cover, max-marginal relevance (MMR), Grasshopper, DivRank, and SVMdiv.

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to Association for Computing Machinery.
Keywords: Graph;Conductance;Diversity;Ranking
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Depositing User: Id for Latest eprints
Date Deposited: 18 Mar 2013 09:43
Last Modified: 18 Mar 2013 09:43
URI: http://eprints.iisc.ac.in/id/eprint/46015

Actions (login required)

View Item View Item