@inproceedings{8d99d887a1d24e1c85d23dce7eef27a7,
title = "Mutual information scheduling for ranking",
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.",
keywords = "Importance sampling, Mutual information, Pair-wise comparison, Ranking, Scheduling",
author = "Hamza Aftab and Nevin Raj and Paul Cuff and Sanjeev Kulkarni",
year = "2011",
language = "English (US)",
isbn = "9781457702679",
series = "Fusion 2011 - 14th International Conference on Information Fusion",
booktitle = "Fusion 2011 - 14th International Conference on Information Fusion",
note = "14th International Conference on Information Fusion, Fusion 2011 ; Conference date: 05-07-2011 Through 08-07-2011",
}