Mutual information scheduling for ranking

Hamza Aftab, Nevin Raj, Paul Cuff, Sanjeev Kulkarni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

In this paper, an efficient and flexible scheduling algorithm for estimating the ranking of n objects through pairwise comparisons is proposed. By successively picking pairs for comparison such that the mutual information between the parameter(s) of interest and the outcome of the comparison is maximized, we quickly obtain a good approximation of these parameters using few comparisons. In simulation, this scheduling algorithm performs better than randomly selecting pairs for comparison or selecting pairs according to a natural heuristic previously proposed. However, a main advantage to this principled approach is that it appropriately adapts to a variety of models and parameters.

Original languageEnglish (US)
Title of host publicationFusion 2011 - 14th International Conference on Information Fusion
StatePublished - Sep 13 2011
Event14th International Conference on Information Fusion, Fusion 2011 - Chicago, IL, United States
Duration: Jul 5 2011Jul 8 2011

Publication series

NameFusion 2011 - 14th International Conference on Information Fusion

Other

Other14th International Conference on Information Fusion, Fusion 2011
CountryUnited States
CityChicago, IL
Period7/5/117/8/11

All Science Journal Classification (ASJC) codes

  • Information Systems

Keywords

  • Importance sampling
  • Mutual information
  • Pair-wise comparison
  • Ranking
  • Scheduling

Fingerprint Dive into the research topics of 'Mutual information scheduling for ranking'. Together they form a unique fingerprint.

  • Cite this

    Aftab, H., Raj, N., Cuff, P., & Kulkarni, S. (2011). Mutual information scheduling for ranking. In Fusion 2011 - 14th International Conference on Information Fusion [5977497] (Fusion 2011 - 14th International Conference on Information Fusion).